Sciweavers

46 search results - page 6 / 10
» jct 2011
Sort
View
JCT
2011
74views more  JCT 2011»
13 years 4 months ago
Basis theorems for continuous n-colorings
This article is devoted to the study of continuous colorings of the n-element subsets of a Polish space. The homogeneity number hm(c) of an n-coloring c : [X]n → 2 is the least s...
Stefanie Frick, Stefan Geschke
JCT
2011
93views more  JCT 2011»
13 years 15 days ago
A graph-theoretic approach to quasigroup cycle numbers
Abstract. Norton and Stein associated a number with each idempotent quasigroup or diagonalized Latin square of given finite order n, showing that it is congruent mod 2 to the tria...
Brent Kerby, Jonathan D. H. Smith
JCT
2011
67views more  JCT 2011»
13 years 4 months ago
Inversion arrangements and Bruhat intervals
Let W be a finite reflection group. For a given w ∈ W, the following assertion may or may not be satisfied: (∗) The principal Bruhat order ideal of w contains as many elemen...
Axel Hultman
JCT
2011
66views more  JCT 2011»
13 years 4 months ago
Enumeration of non-crossing pairings on bit strings
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
Todd Kemp, Karl Mahlburg, Amarpreet Rattan, Cliffo...
JCT
2011
83views more  JCT 2011»
13 years 4 months ago
The weighted hook length formula
Abstract. Based on the ideas in [CKP], we introduce the weighted analogue of the branching rule for the classical hook length formula, and give two proofs of this result. The firs...
Ionut Ciocan-Fontanine, Matjaz Konvalinka, Igor Pa...