1215 search results - page 88 / 243 » Combinatorics |
COMBINATORICS
2002
15 years 3 months ago
2002
A sequence u = u1u2...un is said to be nonrepetitive if no two adjacent blocks of u are exactly the same. For instance, the sequence abcbcba contains a repetition bcbc, while abca...
114
click to vote
COMBINATORICS
2002
15 years 3 months ago
2002
We present a new expression for the partition function of the dimer arrangements and the Ising partition function of the 3-dimensional cubic lattice. We use the Pfaffian method. T...
121
click to vote
COMBINATORICS
2002
15 years 3 months ago
2002
A graph is f-choosable if for every collection of lists with list sizes specified by f there is a proper coloring using colors from the lists. The sum choice number is the minimum...
104
click to vote
COMBINATORICS
2002
15 years 3 months ago
2002
We consider permutations that avoid the pattern 1324. By studying the generating tree for such permutations, we obtain a recurrence formula for their number. A computer program pr...
129
click to vote
COMBINATORICS
2002
15 years 3 months ago
2002
Fix a rectangular Young diagram R, and consider all the products of Schur functions ssc , where and c run over all (unordered) pairs of partitions which are complementary with re...