60 search results - page 6 / 12 » combinatorics 1998 |
COMBINATORICS
1998
13 years 6 months ago
1998
Using Zeilberger’s factorization of two-stack-sortable permutations, we write a functional equation — of a strange sort — that defines their generating function according t...
COMBINATORICS
1998
13 years 6 months ago
1998
The Galois number Gn(q) is defined to be the number of subspaces of the n-dimensional vector space over the finite field GF(q). When q is prime, we prove that Gn(q) is equal to...
COMBINATORICS
1998
13 years 6 months ago
1998
The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the BrouwerVan Eupen construction that t...
COMBINATORICS
1998
13 years 6 months ago
1998
: Following Frankl and F¨uredi [1] we say a family, F, of subsets of an n-set is weakly union-free if F does not contain four distinct sets A, B, C, D with A ∪ B = C ∪ D. If i...
COMBINATORICS
1998
13 years 6 months ago
1998
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...