Martin Winter

activity

20182023

most citedGeometry and Topology of Symmetric Point Arrangements

2 citations · 7 across the 13 of their papers we have counts for

collaborators

Showing 2023Show all

4 papers · 1 filter

math.CO2023

Kalai's $3^{d}$ conjecture for unconditional and locally anti-blocking polytopes

Raman Sanyal, Martin Winter

Kalai's $3^{d}$ conjecture states that every centrally-symmetric $d$ -polytope has at least $3^{d}$ faces. We give short proofs for two special cases: if $P$ is unconditional (that is,…

math.CO2023

The clique graphs of the hexagonal lattice -- an explicit construction and a short proof of divergence

Martin Winter

We present a new, explicit and very geometric construction for the iterated clique graphs of the hexagonal lattice $Hex$ which makes apparent its clique-divergence and she…

math.CO2023

Characterising Clique Convergence for Locally Cyclic Graphs of Minimum Degree $δ \geq 6$

Anna M. Limbach, Martin Winter

The clique graph $k G$ of a graph $G$ has as its vertices the cliques (maximal complete subgraphs) of $G$ , two of which are adjacent in $k G$ if they have non-empty intersection in $…

math.CO2023

Rigidity, Tensegrity and Reconstruction of Polytopes under Metric Constraints

Martin Winter

We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interio…

Kalai's 3d conjecture for unconditional and locally anti-blocking polytopes

The clique graphs of the hexagonal lattice -- an explicit construction and a short proof of divergence

Characterising Clique Convergence for Locally Cyclic Graphs of Minimum Degree δ≥6

Rigidity, Tensegrity and Reconstruction of Polytopes under Metric Constraints

Kalai's $3^{d}$ conjecture for unconditional and locally anti-blocking polytopes

Characterising Clique Convergence for Locally Cyclic Graphs of Minimum Degree $δ \geq 6$