arXiv subjects

Eran Nevo

Publications and source records attributed to Eran Nevo.

At least 37 records · Page 2Linked to original sources

arXiv2019

Rigidity with few locations

Graphs triangulating the $2$-sphere are generically rigid in $3$-space, due to Gluck-Dehn-Alexandrov-Cauchy. We show there is a \emph{finite} subset $A$ in $3$-space so that the vertices of each graph $G$ as above can be mapped into $A$ to make the resulted embedding of $G$ infinitesimally rigid. This assertion extends to the triangulations of any fixed compact connected surface, where the upper bound obtained on the size of $A$ increases with the genus. The assertion fails, namely no such finite $A$ exists, for the larger family of all graphs that are generically rigid in $3$-space and even in the plane.

math.CO↗

arXiv2019

Regularity of Edge Ideals Via Suspension

We study the Castelnuovo-Mumford regularity of powers of edge ideals. We prove that if G is a bipartite graph, then reg(I(G)^s) \leq 2s + reg I(G) - 2 for all s \geq 2, which is the best possible upper bound for any s. Suspension plays a key role in proof of the base case s =2.

math.AC↗

arXiv2019

Complexity yardsticks for $f$-vectors of polytopes and spheres

We consider geometric and computational measures of complexity for sets of integer vectors, asking for a qualitative difference between $f$-vectors of simplicial and general $d$-polytopes, as well as flag $f$-vectors of $d$-polytopes and regular CW $(d-1)$-spheres, for $d\ge 4$.

math.CO↗

arXiv2019

Induced equators in flag spheres

We propose a combinatorial approach to the following strengthening of Gal's conjecture: $γ(Δ)\ge γ(E)$ coefficientwise, where $Δ$ is a flag homology sphere and $E\subseteq Δ$ an induced homology sphere of codimension $1$. We provide partial evidence in favor of this approach, and prove a nontrivial nonlinear inequality that follows from the above conjecture, for boundary complexes of flag $d$-polytopes: $h_1(Δ) h_i(Δ) \ge (d-i+1)h_{i-1}(Δ) + (i+1) h_{i+1}(Δ)$ for all $0\le i\le d$.

math.CO↗

arXiv2019

Flag complexes and homology

We prove several relations on the $f$-vectors and Betti numbers of flag complexes. For every flag complex $Δ$, we show that there exists a balanced complex with the same $f$-vector as $Δ$, and whose top-dimensional Betti number is at least that of $Δ$, thereby extending a theorem of Frohmader by additionally taking homology into consideration. We obtain upper bounds on the top-dimensional Betti number of $Δ$ in terms of its face numbers. We also give a quantitative refinement of a theorem of Meshulam by establishing lower bounds on the $f$-vector of $Δ$, in terms of the top-dimensional Betti number of $Δ$. This result has a continuous analog: If $Δ$ is a $(d-1)$-dimensional flag complex whose $(d-1)$-th reduced homology group has dimension $a\geq 0$ (over some field), then the $f$-polynomial of $Δ$ satisfies the coefficient-wise inequality $f_Δ(x) \geq (1 + (\sqrt[d]{a}+1)x)^d$.

math.CO↗

arXiv2019

QGLBT for polytopes

We extend the assertion of the Generalized Lower Bound Theorem (GLBT) to general polytopes under the assumption that their low dimensional skeleton is simplicial, with partial results for the general case. We prove a quantitative version of the GLBT for general polytopes, and use it to give a topological necessary condition for polytopes to have vanishing toric $g_k$ entry. As another application of the QGLBT we prove a conjecture of Kalai on $g$-numbers for general polytopes approximating a smooth convex body.

math.CO↗

arXiv2018

Almost simplicial polytopes I. The lower and upper bound theorems

We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$ and $s$, thus generalizing the classical Lower Bound Theorem by Barnette and Upper Bound Theorem by McMullen, which treat the case of $s=0$. We characterize the minimizers and provide examples of maximizers, for any $d$. Our construction of maximizers is a generalization of cyclic polytopes, based on a suitable variation of the moment curve, and is of independent interest.

math.CO↗

arXiv2018

A lower bound theorem for centrally symmetric simplicial polytopes

Stanley proved that for any centrally symmetric simplicial $d$-polytope $P$ with $d\geq 3$, $g_2(P) \geq {d \choose 2}-d$. We provide a characterization of centrally symmetric $d$-polytopes with $d\geq 4$ that satisfy this inequality as equality. This gives a natural generalization of the classical Lower Bound Theorem for simplicial polytopes to the setting of centrally symmetric simplicial polytopes.

math.CO↗

arXiv2018

Pach's selection theorem does not admit a topological extension

Let $U_1,\dots, U_{d+1}$ be $n$-element sets in $R^d$ and let $\langle u_1,\ldots,u_{d+1}\rangle$ denote the convex hull of points $u_i$ in $U_i$ (for all $i$) which is a (possibly degenerate) simplex. Pach's selection theorem says that there are sets $Z_1 \subset U_1,\dots, Z_{d+1} \subset U_{d+1}$ and a point $u$ in $R^d$ such that each $|Z_i| > c_1(d)n$ and $u$ belongs to $\langle z_1,...,z_{d+1} \rangle$ for every choice of $z_1$ in $Z_1,\dots,z_{d+1}$ in $Z_{d+1}$. Here we show that this theorem does not admit a topological extension with linear size sets $Z_i$. However, there is a topological extension where each $|Z_i|$ is of order $(\log n)^(1/d)$.

math.CO↗

arXiv2018

Circulant matrices and Galois-Togliatti systems

The goal of this article is to compare the coefficients in the expansion of the permanent with those in the expansion of the determinant of a three-lines circulant matrix. As an application we prove a conjecture concerning the minimality of Galois-Togliatti systems.

math.AC↗

arXiv2018

On the cone of $f$-vectors of cubical polytopes

What is the minimal closed cone containing all $f$-vectors of cubical $d$-polytopes? We construct cubical polytopes showing that this cone, expressed in the cubical $g$-vector coordinates, contains the nonnegative $g$-orthant, thus verifying one direction of the Cubical Generalized Lower Bound Conjecture of Babson, Billera and Chan. Our polytopes also show that a natural cubical analogue of the simplicial Generalized Lower Bound Theorem does not hold.

math.CO↗

arXiv2018

On Betti numbers of flag complexes with forbidden induced subgraphs

We analyze the asymptotic extremal growth rate of the Betti numbers of clique complexes of graphs on n vertices not containing a fixed forbidden induced subgraph H. In particular, we prove a theorem of the alternative: for any H the growth rate achieves exactly one of five possible exponentials, that is, independent of the field of coefficients, the nth root of the maximal total Betti number over n-vertex graphs with no induced copy of H has a limit, as n tends to infinity, and, ranging over all H, exactly five different limits are attained. For the interesting case where H is the 4-cycle, the above limit is 1, and we prove a slightly superpolynomial upper bound.

math.CO↗

arXiv2018

On the reconstruction of polytopes

Blind and Mani, and later Kalai, showed that the face lattice of a simple polytope is determined by its graph, namely its $1$-skeleton. Call a vertex of a $d$-polytope \emph{nonsimple} if the number of edges incident to it is more than $d$. We show that (1) the face lattice of any $d$-polytope with at most two nonsimple vertices is determined by its $1$-skeleton; (2) the face lattice of any $d$-polytope with at most $d-2$ nonsimple vertices is determined by its $2$-skeleton; and (3) for any $d>3$ there are two $d$-polytopes with $d-1$ nonsimple vertices, isomorphic $(d-3)$-skeleta and nonisomorphic face lattices. In particular, the result (1) is best possible for $4$-polytopes.

math.CO↗

arXiv2018

Turán, involution and shifting

We propose a strengthening of the conclusion in Turán's (3,4)-conjecture in terms of algebraic shifting, and show that its analogue for graphs does hold. In another direction, we generalize the Mantel-Turán theorem by weakening its assumption: for any graph G on n vertices and any involution on its vertex set, if for any 3-set S of the vertices, the number of edges in G spanned by S, plus the number of edges in G spanned by the image of S under the involution, is at least 2, then the number of edges in G is at least the Mantel-Turán bound, namely the number achieved by two disjoint cliques of sizes n/2 rounded up and down.

math.CO↗

arXiv2017

Bounds for entries of $γ$-vectors of flag homology spheres

We present some enumerative and structural results for flag homology spheres. For a flag homology sphere $Δ$, we show that its $γ$-vector $γ^Δ=(1,γ_1,γ_2,\ldots)$ satisfies: \begin{align*} γ_j=0,\text{ for all } j>γ_1, \quad γ_2\leq\binom{γ_1}{2}, \quad γ_{γ_1}\in\{0,1\}, \quad \text{ and }γ_{γ_1-1}\in\{0,1,2,γ_1\}, \end{align*} supporting a conjecture of Nevo and Petersen. Further we characterize the possible structures for $Δ$ in extremal cases. As an application, the techniques used produce infinitely many $f$-vectors of flag balanced simplicial complexes that are not $γ$-vectors of flag homology spheres (of any dimension); these are the first examples of this kind. In addition, we prove a flag analog of Perles' 1970 theorem on $k$-skeleta of polytopes with "few" vertices, specifically: the number of combinatorial types of $k$-skeleta of flag homology spheres with $γ_1\leq b$, of any given dimension, is bounded independently of the dimension.

math.CO↗

arXiv2016

Lefschetz properties of balanced 3-polytopes

In this paper, we study Lefschetz properties of Artinian reductions of Stanley-Reisner rings of balanced simplicial $3$-polytopes. A $(d-1)$-dimensional simplicial complex is said to be balanced if its graph is $d$-colorable. If a simplicial complex is balanced, then its Stanley-Reisner ring has a special system of parameters induced by the coloring. We prove that the Artinian reduction of the Stanley-Reisner ring of a balanced simplicial $3$-polytope with respect to this special system of parameters has the strong Lefschetz property if the characteristic of the base field is not two or three. Moreover, we characterize $(2,1)$-balanced simplicial polytopes, i.e., polytopes with exactly one red vertex and two blue vertices in each facet, such that an analogous property holds. In fact, we show that this is the case if and only if the induced graph on the blue vertices satisfies a Laman-type combinatorial condition.

math.CO↗

arXiv2016

On vanishing patterns in $j$-strands of edge ideals

We consider two problems regarding vanishing patterns in the Betti table of edge ideals $I$ in polynomial algebra $S$. First, we show that the $j$-strand is connected if $j=3$ (for $j=2$ this is easy and known), and give examples where the $j$-strand is not connected for any $j>3$. Next, we apply our result on strand connectivity to establish the subadditivity conjecture for edge ideals, $t_{a+b}\leq t_a+t_b$, in case $b=2,3$ (the case $b=1$ is known). Here $t_i$ stands for the maximal shifts in the minimal free $S$-resolution of $S/I$

math.AC↗

arXiv2016

A Geometric Lower Bound Theorem

We resolve a conjecture of Kalai relating approximation theory of convex bodies by simplicial polytopes to the face numbers and primitive Betti numbers of these polytopes and their toric varieties. The proof uses higher notions of chordality. Further, for C^2-convex bodies, asymptotically tight lower bounds on the g-numbers of the approximating polytopes are given, in terms of their Hausdorff distance from the convex body.

math.MG↗