English
Related papers

Related papers: Balanced complexes and complexes without large mis…

200 papers

Gr\"unbaum, Barnette, and Reay in 1974 completed the characterization of the pairs $(f_i,f_j)$ of face numbers of $4$-dimensional polytopes. Here we obtain a complete characterization of the pairs of flag numbers $(f_0,f_{03})$ for…

Metric Geometry · Mathematics 2020-01-28 Hannah Sjöberg , Günter M. Ziegler

Let $\Delta$ be a $d$-dimensional normal pseudomanifold, $d \ge 3.$ A relative lower bound for the number of edges in $\Delta$ is that $g_2$ of $\Delta$ is at least $g_2$ of the link of any vertex. When this inequality is sharp $\Delta$ has…

Geometric Topology · Mathematics 2020-02-18 Biplab Basak , Ed Swartz

The class of $(d-1)$-dimensional Buchsbaum* simplicial complexes is studied. It is shown that the rank-selected subcomplexes of a (completely) balanced Buchsbaum* simplicial complex are also Buchsbaum*. Using this result, lower bounds on…

Combinatorics · Mathematics 2010-02-08 Jonathan Browder , Steven Klee

The problem we consider originally arises from 2-level polytope theory. This class of polytopes generalizes a number of other polytope families. One of the important questions in this filed can be formulated as follows: is it true for a…

Combinatorics · Mathematics 2023-09-21 Andrey Kupavskii , Fedor Noskov

We show that the only rational homology spheres which can admit almost complex structures occur in dimensions two and six. Moreover, we provide infinitely many examples of six-dimensional rational homology spheres which admit almost complex…

Algebraic Topology · Mathematics 2018-11-05 Michael Albanese , Aleksandar Milivojevic

The random $2$-dimensional simplicial complex process starts with a complete graph on $n$ vertices, and in every step a new $2$-dimensional face, chosen uniformly at random, is added. We prove that with probability tending to $1$ as…

Combinatorics · Mathematics 2016-07-26 Tomasz Łuczak , Yuval Peled

For a metric space $(X, d)$ and a scale parameter $r \geq 0$, the Vietoris-Rips complex $\mathcal{VR}(X;r)$ is a simplicial complex on vertex set $X$, where a finite set $\sigma \subseteq X$ is a simplex if and only if diameter of $\sigma$…

Combinatorics · Mathematics 2023-05-16 Samir Shukla

We present a first example of a flag vector of a polyhedral sphere that is not the flag vector of any polytope. Namely, there is a unique 3-sphere with the parameters $(f_0,f_1,f_2,f_3;f_{02})=(12,40,40,12;120)$, but this sphere is not…

Metric Geometry · Mathematics 2019-02-20 Philip Brinkmann , Günter M. Ziegler

Let X,Y be finite sets and T a set of functions from X -> Y which we will call "tableaux". We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such "tableau complexes" have many nice…

Combinatorics · Mathematics 2010-02-17 Allen Knutson , Ezra Miller , Alexander Yong

A simplicial complex is d-collapsible if it can be reduced to an empty complex by repeatedly removing (collapsing) a face of dimension at most d-1 that is contained in a unique maximal face. We prove that the algorithmic question whether a…

Combinatorics · Mathematics 2015-03-13 Martin Tancer

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…

Combinatorics · Mathematics 2016-03-10 Eran Nevo , Francisco Santos , Stedman Wilson

Let $M$ be a closed triangulable manifold, and let $\Delta$ be a triangulation of $M$. What is the smallest number of vertices that $\Delta$ can have? How big or small can the number of edges of $\Delta$ be as a function of the number of…

Combinatorics · Mathematics 2015-05-26 Steven Klee , Isabella Novik

We generalize the notion of graph minors to all (finite) simplicial complexes. For every two simplicial complexes H and K and every nonnegative integer m, we prove that if H is a minor of K then the non vanishing of Van Kampen's obstruction…

Combinatorics · Mathematics 2015-06-24 Eran Nevo

Results of R. Stanley and M. Masuda completely characterize the h-vectors of simplicial posets whose order complexes are spheres. In this paper we examine the corresponding question in the case where the order complex is a ball. Using the…

Combinatorics · Mathematics 2010-09-13 Samuel Kolins

We study surface representatives of homology classes of finite complexes which minimize certain complexity measures, including its genus and Euler characteristic. Our main result is that up to surgery at nullhomotopic curves minimizers are…

Geometric Topology · Mathematics 2022-09-07 Thorben Kastenholz , Mark Pedron

Suppose $G$ is a connected complex Lie group and $H$ is a closed complex subgroup such that $X := G/H$ is Kaehler and the codimension of the top non-vanishing homology group of $X$ with coefficients in $\mathbb Z_2$ is less than or equal to…

Complex Variables · Mathematics 2016-12-30 Seyed Ruhallah Ahmadi , Bruce Gilligan

It is verified that the number of vertices in a $d$-dimensional cubical pseudomanifold is at least $2^{d+1}$. Using Adin's cubical $h$-vector, the generalized lower bound conjecture is established for all cubical 4-spheres, as well as for…

Combinatorics · Mathematics 2011-04-05 Steven Klee

We consider a spherically symmetric global monopole in general relativity in $(D=d+2)$-dimensional spacetime. The monopole is shown to be asymptotically flat up to a solid angle defect in case $\gamma < d-1$, where $\gamma$ is a parameter…

General Relativity and Quantum Cosmology · Physics 2009-11-10 Kirill A. Bronnikov , Boris E. Meierovich

In 1988, Kalai extended a construction of Billera and Lee to produce many triangulated (d-1)-spheres. In fact, in view of upper bounds on the number of simplicial d-polytopes by Goodman and Pollack, he derived that for every dimension d>=5,…

Combinatorics · Mathematics 2007-05-23 Julian Pfeifle

We classify terminal simplicial reflexive d-polytopes with 3d-1 vertices. They turn out to be smooth Fano d-polytopes. When d is even there is 1 such polytope up to isomorphism, while there are 2 when d is uneven.

Combinatorics · Mathematics 2007-05-23 Mikkel Øbro
‹ Prev 1 8 9 10 Next ›