Sciweavers

Share
COMBINATORICS
2002
84views more  COMBINATORICS 2002»
9 years 10 months ago
Compositions of Random Functions on a Finite Set
If we compose sufficiently many random functions on a finite set, then the composite function will be constant. We determine the number of compositions that are needed, on average...
Avinash Dalal, Eric Schmutz
COMBINATORICS
2002
82views more  COMBINATORICS 2002»
9 years 10 months ago
Non-Repetitive Tilings
In 1906 Axel Thue showed how to construct an infinite non-repetitive (or squarefree) word on an alphabet of size 3. Since then this result has been rediscovered many times and ext...
James D. Currie, Jamie Simpson
COMBINATORICS
2002
87views more  COMBINATORICS 2002»
9 years 10 months ago
Map Genus, Forbidden Maps, and Monadic Second-Order Logic
A map is a graph equipped with a circular order of edges around each vertex. These circular orders represent local planar embeddings. The genus of a map is the minimal genus of an...
Bruno Courcelle, V. Dussaux
COMBINATORICS
2002
62views more  COMBINATORICS 2002»
9 years 10 months ago
New Lower Bounds for Heilbronn Numbers
The n-th Heilbronn number, Hn, is the largest value such that n points can be placed in the unit square in such a way that all possible triangles defined by any three of the point...
Francesc Comellas, J. Luis A. Yebra
COMBINATORICS
2002
89views more  COMBINATORICS 2002»
9 years 10 months ago
Generating a Random Sink-free Orientation in Quadratic Time
A sink-free orientation of a finite undirected graph is a choice of orientation
Henry Cohn, Robin Pemantle, James Gary Propp
COMBINATORICS
2002
77views more  COMBINATORICS 2002»
9 years 10 months ago
Motzkin Paths and Reduced Decompositions for Permutations with Forbidden Patterns
We obtain a characterization of (321, 3
William Y. C. Chen, Eva Yu-Ping Deng, Laura L. M. ...
COMBINATORICS
2002
83views more  COMBINATORICS 2002»
9 years 10 months ago
Identifying Codes with Small Radius in Some Infinite Regular Graphs
Let G = (V, E) be a connected undirected graph and S a subset of vertices. If for all vertices v V , the sets Br(v) S are all nonempty and different, where Br(v) denotes the set...
Irène Charon, Olivier Hudry, Antoine Lobste...
COMBINATORICS
2002
102views more  COMBINATORICS 2002»
9 years 10 months ago
Computation in Coxeter Groups-I. Multiplication
An efficient and purely combinatorial algorithm for calculating products in arbitrary Coxeter groups is presented, which combines ideas of Fokko du Cloux and myself. Proofs are lar...
Bill Casselman
COMBINATORICS
2002
85views more  COMBINATORICS 2002»
9 years 10 months ago
Parking Functions of Types A and B
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parki...
Philippe Biane
COMBINATORICS
2002
71views more  COMBINATORICS 2002»
9 years 10 months ago
The Number of Labeled 2-Connected Planar Graphs
Edward A. Bender, Zhicheng Gao, Nicholas C. Wormal...
books