English
Related papers

Related papers: Balanced generalized lower bound inequality for si…

200 papers

A neighborliness property of marginal polytopes of hierarchical models, depending on the cardinality of the smallest non-face of the underlying simplicial complex, is shown. The case of binary variables is studied explicitly, then the…

Combinatorics · Mathematics 2016-04-08 Thomas Kahle

In a previous article, we proved tight lower bounds for the coefficients of the generalized $h$-vector of a centrally symmetric rational polytope using intersection cohomology of the associated projective toric variety. Here we present a…

Algebraic Geometry · Mathematics 2007-05-23 Annette A'Campo-Neuen

A renowned theorem of Blind and Mani, with a constructive proof by Kalai and an efficiency proof by Friedman, shows that the whole face lattice of a simple polytope can be determined from its graph. This is part of a broader story of…

Combinatorics · Mathematics 2020-06-05 Margaret M. Bayer

The aim of this paper is to characterize simplicial complexes which have standard graded vertex cover algebras. This property has several nice consequences for the squarefree monomial ideals defining these algebras. It turns out that such…

Commutative Algebra · Mathematics 2007-05-23 Juergen Herzog , Takayuki Hibi , Ngo Viet Trung , Xinxian Zheng

The conjecture of Kalai, Kleinschmidt, and Lee on the number of empty simplices of a simplicial polytope is established by relating it to the first graded Betti numbers of the polytope. The proof allows us to derive explicit optimal bounds…

Commutative Algebra · Mathematics 2007-05-23 Uwe Nagel

For a minimal inequality derived from a maximal lattice-free simplicial polytope in $\R^n$, we investigate the region where minimal liftings are uniquely defined, and we characterize when this region covers $\R^n$. We then use this…

Optimization and Control · Mathematics 2017-01-06 Amitabh Basu , Gérard Cornuéjols , Matthias Köppe

We present explicit constructions of centrally symmetric polytopes with many faces: first, we construct a d-dimensional centrally symmetric polytope P with about (1.316)^d vertices such that every pair of non-antipodal vertices of P spans…

Metric Geometry · Mathematics 2011-11-21 Alexander Barvinok , Seung Jin Lee , Isabella Novik

Chapters : Old and new inequalities; Surfaces with $\chi=1$ and the bicanonical map; Surfaces with $p_g=4$; Surfaces isogeneous to a product, Beauville surfaces and the absolute Galois group;Lefschetz pencils and braid monodromies;DEF, DIFF…

Algebraic Geometry · Mathematics 2009-09-29 Ingrid Bauer , Fabrizio Catanese , Roberto Pignatelli

In this paper we give several criteria for the edge polytope of a fundamental FHM-graph to possess a regular unimodular triangulation in terms of some simple data of the the graph. We further apply our criteria to several examples of graphs…

Combinatorics · Mathematics 2016-12-02 Ginji Hamano

We introduce a $\mathbb{Z}$--coefficient version of Guth's macroscopic stability inequality for almost-minimizing hypersurfaces. In manifolds with a lower bound on macroscopic scalar curvature, we use the inequality to prove a lower bound…

Differential Geometry · Mathematics 2017-12-14 Hannah Alpert

For any unbranched double covering of compact Riemann surfaces, we study the associated character varieties that are unitary in the global sense, which we call $\text{GL}_n\rtimes\!<\!\sigma\!>\!~$-character varieties. We introduce $k>0$…

Algebraic Geometry · Mathematics 2022-03-03 Cheng Shu

In 2012 Gubeladze (Adv.\ Math.\ 2012) introduced the notion of k-convex-normal polytopes to show that integral polytopes all of whose edges are longer than 4d(d+1) have the integer decomposition property. In the first part of this paper we…

Combinatorics · Mathematics 2014-10-24 Christian Haase , Jan Hofmann

In this paper we settle long-standing questions regarding the combinatorial complexity of Minkowski sums of polytopes: We give a tight upper bound for the number of faces of a Minkowski sum, including a characterization of the case of…

Combinatorics · Mathematics 2021-01-19 Karim Adiprasito , Raman Sanyal

It is possible for a combinatorial type of polytope to have both decomposable and indecomposable realizations; here decomposability is meant with respect to Minkowski addition. Such polytopes are called conditionally decomposable. We show…

Combinatorics · Mathematics 2024-06-04 Jie Wang , David Yost

For a $(d-1)$-dimensional simplicial complex $\Delta$ and $1\leq i\leq d$, let $f_{i-1}$ be the number of $(i-1)$-faces of $\Delta$ and $m_i$ be the number of missing $i$-faces of $\Delta$. In the nineties, Kalai asked for a…

Combinatorics · Mathematics 2025-09-24 Isabella Novik , Hailun Zheng

We prove the Noether-Lefschetz conjecture on the moduli space of quasi-polarized K3 surfaces. This is deduced as a particular case of a general theorem that states that low degree cohomology classes of arithmetic manifolds of orthogonal…

Algebraic Geometry · Mathematics 2015-04-15 Nicolas Bergeron , Zhiyuan Li , John Millson , Colette Moeglin

After fixing a triangulation $L$ of a $k$-dimensional simplex that has no new vertices on the boundary, we introduce a triangulation operation on all simplicial complexes that replaces every $k$-face with a copy of $L$, via a sequence of…

Combinatorics · Mathematics 2015-10-21 Gábor Hetyei , Eran Nevo

Let $\rho$ be a metric on the set $X=\{1,2,\dots,n+1\}$. Consider the $n$-dimensional polytope of functions $f:X\rightarrow \mathbb{R}$, which satisfy the conditions $f(n+1)=0$, $|f(x)-f(y)|\leq \rho(x,y)$. The question on classifying…

Combinatorics · Mathematics 2016-08-25 J. Gordon , F. Petrov

Let X be a locally compact space with a continuous proper action of a locally compact group G. Assuming that X satisfies a certain kind of duality in equivariant bivariant Kasparov theory, we can enrich the classical construction of…

K-Theory and Homology · Mathematics 2015-10-23 Heath Emerson , Ralf Meyer

Let P be a convex polytope not simple in general. In the focus of this paper lies a simplicial complex K_P which carries complete information about the combinatorial type of P. In the case when P is simple, K_P is the same as dP*, where P*…

Combinatorics · Mathematics 2015-05-08 A. A. Ayzenberg , V. M. Buchstaber
‹ Prev 1 3 4 5 6 7 10 Next ›