A combinatorial analog of a theorem of F.J. Dyson

DOI10.1016/J.TOPOL.2010.02.020MaRDI QIDQ975232zbMATH OpenOpenAlexFDO

Authors B. E. Eshmatov

Publication date 9 June 2010

Published in Topology and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0608204

zbMATH Keywords

Dyson's theoremsymmetric triangulationTucker labelling

Mathematics Subject Classification ID

Fixed-point and coincidence theorems (topological aspects) (54H25)

Abstract: 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.

Recommendations

• Generalizations of Tucker-Fan-Shashkin lemmas
• scientific article; zbMATH DE number 1802665
• The Borsuk-Ulam theorem and combinatorics
• Extensions of Sperner and Tucker's lemma for manifolds
• A constructive proof of Ky Fan's generalization of Tucker's lemma

Cites work

• scientific article; zbMATH DE number 1786790 (Why is no real title available?)
• scientific article; zbMATH DE number 3063670 (Why is no real title available?)
• scientific article; zbMATH DE number 3090758 (Why is no real title available?)
• scientific article; zbMATH DE number 3102257 (Why is no real title available?)
• A combinatorical proof of Kneser's conjecture
• A constructive proof of Ky Fan's generalization of Tucker's lemma
• A constructive proof of Tucker's combinatorial lemma
• A generalization of Tucker's combinatorial lemma with topological applications
• Consensus-halving via theorems of Borsuk-Ulam and Tucker
• Continuous functions defined on spheres
• Differential Topology
• Generalized Kneser coloring theorems with combinatorial proofs
• On a theorem of F. J. Dyson
• On theorems of Borsuk-Ulam, Kakutani-Yamabe-Yujobô and Dyson. II
• The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler

Cited in

(20)

• The Borsuk-Ulam theorem and combinatorics
• scientific article; zbMATH DE number 5366634 (Why is no real title available?)
• scientific article; zbMATH DE number 1786790 (Why is no real title available?)
• On a combinatorial theorem of Curtis Greene
• A combinatorial proof of a theorem of Freund
• Algorithms for finding connected separators between antipodal points
• A combinatorial proof of an infinite version of the Hales-Jewett theorem
• On approximation of asymmetric separators of the \(n\)-cube
• Iterated combinatorial density theorems
• The Thurston operator for semi-finite combinatorics
• A determinacy approach to Borel combinatorics
• A theorem on Molien type in combinatorics
• scientific article; zbMATH DE number 5944482 (Why is no real title available?)
• Combinatorial variations on Cantor's diagonal
• A constructive proof of Ky Fan's generalization of Tucker's lemma
• On a combinatorial principle of Hajnal and Komjáth
• Tucker-Ky Fan Colorings
• A modified combination rule for \(D\) numbers theory
• Combinatorial integer labeling theorems on finite sets with applications
• A combination theorem for \(PD(n)\)-pairs

This page was built for publication: A combinatorial analog of a theorem of F.J. Dyson

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975232)