A bijection between the d-dimensional simplices with distances in \1,2\ and the partitions of d+1

DOI10.1016/J.JCTB.2005.09.003MaRDI QIDQ2490871zbMATH OpenOpenAlexFDO

Authors Christian Haase, Sascha Kurz

Publication date 18 May 2006

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

integral point sets

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Discrete geometry (52C99)

Abstract: We give a construction for the d-dimensional simplices with all distances in {1,2} from the set of partitions of d+1.

Recommendations

• A bijection for partitions simultaneously $s$-regular and $t$-distinct
• Partitions of points into simplices with \(k\)-dimensional intersection. I: The conic Tverberg's theorem
• A simple bijection for enhanced, classical, and 2-distant \(k\)-noncrossing partitions
• A Partition Property of Simplices in Euclidean Space
• On simplicial partitions of polytopes
• The bijection between plane partitions and nonnegative matrices
• Bijections between \(t\)-core partitions and \(t\)-tuples
• Partitions of points into simplices with \(k\)-dimensional intersection. II: Proof of Reay's conjecture in dimensions 4 and 5
• New cases of Reay's conjecture on partitions of points into simplices with \(k\)-dimensional intersection
• On Nonobtuse Simplicial Partitions

Cites work

• scientific article; zbMATH DE number 3136270 (Why is no real title available?)
• scientific article; zbMATH DE number 3843786 (Why is no real title available?)
• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 3221981 (Why is no real title available?)
• scientific article; zbMATH DE number 970814 (Why is no real title available?)
• scientific article; zbMATH DE number 3019031 (Why is no real title available?)
• Bounding the vertex cover number of a hypergraph
• Covering with Euclidean boxes
• On a Problem in Graph Theory
• Piercing d-intervals
• Separating pairs of points of standard boxes
• The Paradox of Nontransitive Dice
• The Voting Problem
• Transversals of d-intervals
• Voting paradoxes and digraphs realizations

Cited in

(4)

• Partitioning the complement of a simplex in \(PG(e,q^{d+1})\) into copies of PG(d,q)
• The \(\varepsilon\)-\(t\)-net problem
• Domination number of certain infinite tournaments
• Condorcet winning sets

This page was built for publication: A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\)

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