The Borsuk-Ulam-property, Tucker-property and constructive proofs in combinatorics

This article is concerned with a general scheme on how to obtain constructive proofs for combinatorial theorems that have topological proofs so far. To this end the combinatorial concept of Tucker-property of a finite group $G$ is introduced and its relation to the topological Borsuk-Ulam-property is discussed. Applications of the Tucker-property in combinatorics are demonstrated.Comment: 12 pages, 0 figure

Applying G\"odel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma

We use G\"odel's Dialectica interpretation to analyse Nash-Williams' elegant but non-constructive "minimal bad sequence" proof of Higman's Lemma. The result is a concise constructive proof of the lemma (for arbitrary decidable well-quasi-orders) in which Nash-Williams' combinatorial idea is clearly present, along with an explicit program for finding an embedded pair in sequences of words.Comment: In Proceedings CL&C 2012, arXiv:1210.289

Polytopal Bier spheres and Kantorovich-Rubinstein polytopes of weighted cycles

The problem of deciding if a given triangulation of a sphere can be realized as the boundary sphere of a simplicial, convex polytope is known as the "Simplicial Steinitz problem". It is known by an indirect and non-constructive argument that a vast majority of Bier spheres are non-polytopal. Contrary to that, we demonstrate that the Bier spheres associated to threshold simplicial complexes are all polytopal. Moreover, we show that all Bier spheres are starshaped. We also establish a connection between Bier spheres and Kantorovich-Rubinstein polytopes by showing that the boundary sphere of the KR-polytope associated to a polygonal linkage (weighted cycle) is isomorphic to the Bier sphere of the associated simplicial complex of "short sets"

A Combinatorial Analog of a Theorem of F.J.Dyson

Tucker's Lemma is a combinatorial analog of the Borsuk-Ulam theorem and the case n=2 was proposed by Tucker in 1945. Numerous generalizations and applications of the Lemma have appeared since then. In 2006 Meunier proved the Lemma in its full generality in his Ph.D. thesis. There are generalizations and extensions of the Borsuk-Ulam theorem that do not yet have combinatorial analogs. In this note, we give a combinatorial analog of a result of Freeman J. Dyson and show that our result is equivalent to Dyson's theorem. As with Tucker's Lemma, we hope that this will lead to generalizations and applications and ultimately a combinatorial analog of Yang's theorem of which both Borsuk-Ulam and Dyson are special cases.Comment: Original version: 7 pages, 2 figures. Revised version: 12 pages, 4 figures, revised proofs. Final revised version: 9 pages, 2 figures, revised proof

Random tensor models in the large N limit: Uncoloring the colored tensor models

Tensor models generalize random matrix models in yielding a theory of dynamical triangulations in arbitrary dimensions. Colored tensor models have been shown to admit a 1/N expansion and a continuum limit accessible analytically. In this paper we prove that these results extend to the most general tensor model for a single generic, i.e. non-symmetric, complex tensor. Colors appear in this setting as a canonical book-keeping device and not as a fundamental feature. In the large N limit, we exhibit a set of Virasoro constraints satisfied by the free energy and an infinite family of multicritical behaviors with entropy exponents \gamma_m=1-1/m.Comment: 15 page