中文
相关论文

相关论文: Realizations of multiassociahedra via rigidity

200 篇论文

In 2003, A. Bjorner and M. de Longueville proved that the neighborhood complex of the stable Kneser graph SG_{n,k} is homotopy equivalent to a k-sphere. Further, for n=2 they showed that the neighborhood complex deformation retracts to a…

组合数学 · 数学 2011-02-11 Benjamin Braun , Matthew Zeckner

It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…

组合数学 · 数学 2018-11-28 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…

综合数学 · 数学 2007-05-23 Aleksandr Golubchik

We construct the first explicit example of a simplicial 3-ball B_{15,66} that is not collapsible. It has only 15 vertices. We exhibit a second 3-ball B_{12,38} with 12 vertices that is collapsible and evasive, but not shellable. Finally, we…

组合数学 · 数学 2014-04-21 Bruno Benedetti , Frank H. Lutz

It is known that the $(2k-1)$-sphere has at most $2^{O(n^k \log n)}$ combinatorially distinct triangulations with $n$ vertices, for every $k\ge 2$. Here we construct at least $2^{\Omega(n^k)}$ such triangulations, improving on the previous…

组合数学 · 数学 2016-03-10 Eran Nevo , Francisco Santos , Stedman Wilson

We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…

组合数学 · 数学 2026-04-02 Marek Filakovský

We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of Minkowski decomposability. Various properties of skeletons of polytopes are exhibited, each sufficient to guarantee indecomposability of a…

组合数学 · 数学 2016-07-05 Krzysztof Przesławski , David Yost

In 2019 P. Patak and M. Tancer obtained the following higher-dimensional generalization of the Heawood inequality on embeddings of graphs into surfaces. We present a short well-structured proof accessible to non-specialists in the field.…

几何拓扑 · 数学 2026-02-13 E. Kogan , A. Skopenkov

In 1980 Provan and Billera defined the notion of weak $k$-decomposability for pure simplicial complexes. They showed the diameter of a weakly $k$-decomposable simplicial complex $\Delta$ is bounded above by a polynomial function of the…

组合数学 · 数学 2012-03-09 Jesus A. De Loera , Steven Klee

The volume and the number of lattice points of the permutohedron P_n are given by certain multivariate polynomials that have remarkable combinatorial properties. We give several different formulas for these polynomials. We also study a more…

组合数学 · 数学 2007-05-23 Alexander Postnikov

Let Delta_{n-1} denote the (n-1)-dimensional simplex. Let Y be a random k-dimensional subcomplex of Delta_{n-1} obtained by starting with the full (k-1)-dimensional skeleton of Delta_{n-1} and then adding each k-simplex independently with…

组合数学 · 数学 2007-05-23 R. Meshulam , N. Wallach

Agnihotri-Woodward-Belkale polytope $\Delta$ (resp. Klyachko cone $K$) is the set of solutions of the multiplicative (resp. additive) Horn's problem, i.e., the set of triples of spectra of special unitary (resp. traceless Hermitian)…

组合数学 · 数学 2024-12-04 S. Yu. Orevkov , Yu. P. Orevkov

We show that the facet-ridge graph of a shellable simplicial sphere $\Delta$ uniquely determines the entire combinatorial structure of $\Delta$. This generalizes the celebrated result due to Blind and Mani (1987), and Kalai (1988) on…

组合数学 · 数学 2025-07-08 Yirong Yang

We prove that the second derived subdivision of any rectilinear triangulation of any convex polytope is shellable. Also, we prove that the first derived subdivision of every rectilinear triangulation of any convex 3-dimensional polytope is…

组合数学 · 数学 2015-03-20 Karim Alexander Adiprasito , Bruno Benedetti

For positive integers $n,d$, let $\lambda(n,d)$ be the minimal number of vertices of a triangulation of $n$-sphere which admits a degree $d$ simplicial map to the boundary of $(n+1)$-simplex. We show that…

组合数学 · 数学 2025-12-02 Andrey Ryabichev

We study the problem of recognizing whether a given abstract simplicial complex $K$ is the $k$-skeleton of the nerve of $j$-dimensional convex sets in $\mathbb{R}^d$. We denote this problem by $R(k,j,d)$. As a main contribution, we unify…

计算几何 · 计算机科学 2023-02-28 Patrick Schnider , Simon Weber

We investigate a novel setting for polytope rigidity, where a flex must preserve edge lengths and the planarity of faces, but is allowed to change the shapes of faces. For instance, the regular cube is flexible in this notion. We present…

组合数学 · 数学 2026-03-11 Matthias Himmelmann , Bernd Schulze , Martin Winter

We present a constructive proof, that there exists a decomposition of the 2-skeleton of the k-dimensional cross polytope \beta^k into closed surfaces of genus \leq 1, each with a transitive automorphism group given by the vertex transitive…

组合数学 · 数学 2010-09-15 Jonathan Spreer

We present a simple method to obtain information regarding the connectivity of the 1-skeleta of a wide family of simplicial complexes through bounds for the Castelnuovo-Mumford regularity of their Stanley-Reisner rings. In this way we…

组合数学 · 数学 2016-12-08 Gabriele Balletti

We consider families of simple polytopes $P$ and simplicial complexes $K$ well-known in polytope theory and convex geometry, and show that their moment-angle complexes have some remarkable homotopy properties which depend on combinatorics…

代数拓扑 · 数学 2020-11-24 Ivan Limonchenko