17,344 research outputs found
Generalized Kneser coloring theorems with combinatorial proofs
The Kneser conjecture (1955) was proved by Lov\'asz (1978) using the
Borsuk-Ulam theorem; all subsequent proofs, extensions and generalizations also
relied on Algebraic Topology results, namely the Borsuk-Ulam theorem and its
extensions. Only in 2000, Matou\v{s}ek provided the first combinatorial proof
of the Kneser conjecture.
Here we provide a hypergraph coloring theorem, with a combinatorial proof,
which has as special cases the Kneser conjecture as well as its extensions and
generalization by (hyper)graph coloring theorems of Dol'nikov,
Alon-Frankl-Lov\'asz, Sarkaria, and Kriz. We also give a combinatorial proof of
Schrijver's theorem.Comment: 19 pages, 4 figure
A simple model of trees for unicellular maps
We consider unicellular maps, or polygon gluings, of fixed genus. A few years
ago the first author gave a recursive bijection transforming unicellular maps
into trees, explaining the presence of Catalan numbers in counting formulas for
these objects. In this paper, we give another bijection that explicitly
describes the "recursive part" of the first bijection. As a result we obtain a
very simple description of unicellular maps as pairs made by a plane tree and a
permutation-like structure. All the previously known formulas follow as an
immediate corollary or easy exercise, thus giving a bijective proof for each of
them, in a unified way. For some of these formulas, this is the first bijective
proof, e.g. the Harer-Zagier recurrence formula, the Lehman-Walsh formula and
the Goupil-Schaeffer formula. We also discuss several applications of our
construction: we obtain a new proof of an identity related to covered maps due
to Bernardi and the first author, and thanks to previous work of the second
author, we give a new expression for Stanley character polynomials, which
evaluate irreducible characters of the symmetric group. Finally, we show that
our techniques apply partially to unicellular 3-constellations and to related
objects that we call quasi-constellations.Comment: v5: minor revision after reviewers comments, 33 pages, added a
refinement by degree of the Harer-Zagier formula and more details in some
proof
Large Limits in Tensor Models: Towards More Universality Classes of Colored Triangulations in Dimension
We review an approach which aims at studying discrete (pseudo-)manifolds in
dimension and called random tensor models. More specifically, we
insist on generalizing the two-dimensional notion of -angulations to higher
dimensions. To do so, we consider families of triangulations built out of
simplices with colored faces. Those simplices can be glued to form new building
blocks, called bubbles which are pseudo-manifolds with boundaries. Bubbles can
in turn be glued together to form triangulations. The main challenge is to
classify the triangulations built from a given set of bubbles with respect to
their numbers of bubbles and simplices of codimension two. While the colored
triangulations which maximize the number of simplices of codimension two at
fixed number of simplices are series-parallel objects called melonic
triangulations, this is not always true anymore when restricting attention to
colored triangulations built from specific bubbles. This opens up the
possibility of new universality classes of colored triangulations. We present
three existing strategies to find those universality classes. The first two
strategies consist in building new bubbles from old ones for which the problem
can be solved. The third strategy is a bijection between those colored
triangulations and stuffed, edge-colored maps, which are some sort of hypermaps
whose hyperedges are replaced with edge-colored maps. We then show that the
present approach can lead to enumeration results and identification of
universality classes, by working out the example of quartic tensor models. They
feature a tree-like phase, a planar phase similar to two-dimensional quantum
gravity and a phase transition between them which is interpreted as a
proliferation of baby universes
The chromatic number of almost stable Kneser hypergraphs
Let be the set of -subsets of such that for all
, we have We define almost -stable Kneser hypergraph
to be the
-uniform hypergraph whose vertex set is and whose edges are the
-uples of disjoint elements of .
With the help of a -Tucker lemma, we prove that, for prime and for
any , the chromatic number of almost 2-stable Kneser hypergraphs
is equal
to the chromatic number of the usual Kneser hypergraphs ,
namely that it is equal to
Defining to be the number of prime divisors of , counted with
multiplicities, this result implies that the chromatic number of almost
-stable Kneser hypergraphs is equal to the
chromatic number of the usual Kneser hypergraphs for any
, namely that it is equal to $\lceil\frac{n-(k-1)r}{r-1}\rceil.
Constructing Simplicial Branched Covers
Branched covers are applied frequently in topology - most prominently in the
construction of closed oriented PL d-manifolds. In particular, strong bounds
for the number of sheets and the topology of the branching set are known for
dimension d<=4. On the other hand, Izmestiev and Joswig described how to obtain
a simplicial covering space (the partial unfolding) of a given simplicial
complex, thus obtaining a simplicial branched cover [Adv. Geom. 3(2):191-255,
2003]. We present a large class of branched covers which can be constructed via
the partial unfolding. In particular, for d<=4 every closed oriented PL
d-manifold is the partial unfolding of some polytopal d-sphere.Comment: 15 pages, 8 figures, typos corrected and conjecture adde
- …