Sciweavers

Share
COMBINATORICS
2002
76views more  COMBINATORICS 2002»
9 years 10 months ago
On the Number of Distributive Lattices
We investigate the numbers dk of all (isomorphism classes of) distributive lattices with k elements, or, equivalently, of (unlabeled) posets with k antichains. Closely related and...
Marcel Erné, Jobst Heitzig, Jürgen Rei...
COMBINATORICS
2002
71views more  COMBINATORICS 2002»
9 years 10 months ago
Permutations Which Avoid 1243 and 2143, Continued Fractions, and Chebyshev Polynomials
Several authors have examined connections between permutations which avoid 132, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues...
Eric S. Egge, Toufik Mansour
COMBINATORICS
2002
136views more  COMBINATORICS 2002»
9 years 10 months ago
Minimum Connected Dominating Sets of Random Cubic Graphs
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
William Duckworth
COMBINATORICS
2002
107views more  COMBINATORICS 2002»
9 years 10 months ago
Combinatorial Laplacian of the Matching Complex
A striking result of Bouc gives the decomposition of the representation of the symmetric group on the homology of the matching complex into irreducibles that are self-conjugate. We...
Xun Dong, Michelle L. Wachs
COMBINATORICS
2002
111views more  COMBINATORICS 2002»
9 years 10 months ago
A Density Result for Random Sparse Oriented Graphs and its Relation to a Conjecture of Woodall
We shall prove that for all 3 and > 0 there exists a sparse oriented graph of arbitrarily large order with oriented girth and such that any 1/2 + proportion of its arcs induc...
Jair Donadelli, Yoshiharu Kohayakawa
COMBINATORICS
2002
62views more  COMBINATORICS 2002»
9 years 10 months ago
On Recursively Directed Hypercubes
Carmel Domshlak
COMBINATORICS
2002
116views more  COMBINATORICS 2002»
9 years 10 months ago
Toida's Conjecture is True
Let S be a subset of the units in Zn. Let be a circulant graph of order n (a Cayley graph of Zn) such that if ij E(), then i - j (mod n) S. Toida conjectured that if is another...
Edward Dobson, Joy Morris
COMBINATORICS
2002
113views more  COMBINATORICS 2002»
9 years 10 months ago
Longest Increasing Subsequences in Pattern-Restricted Permutations
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limit...
Emeric Deutsch, A. J. Hildebrand, Herbert S. Wilf
COMBINATORICS
2002
58views more  COMBINATORICS 2002»
9 years 10 months ago
Triangle Free Sets and Arithmetic Progressions - Two Pisier Type Problems
Dennis Davenport, Neil Hindman, Dona Strauss
books