Related papers: Bounds for the degree and Betti sequences along a …
We consider the topology of simplicial complexes with vertices the points of a random point process and faces determined by distance relationships between the vertices. In particular, we study the Betti numbers of these complexes as the…
We study the question of the growth of Betti numbers of certain arithmetic varieties in tower of congruence coverings. In fact, our results are about Siegel varieties and varieties associated to orthogonal groups. We explain how a theorem…
We compute the Hilbert coefficients of a graded module with pure resolution and discuss lower and upper bounds for these coefficients for arbitrary graded modules.
We obtain a sharp bound on the degree of a globally generated vector bundle over a reduced irreducible projective variety defined over an algebraically closed field of characteristic zero. As an application, we obtain a Del Pezzo-Bertini…
We consider the multiparameter random simplicial complex on a vertex set $\{ 1,\dots,n \}$, which is parameterized by multiple connectivity probabilities. Our key results concern the topology of this complex of dimensions higher than the…
We establish the existence and uniqueness of finite free resolutions - and their attendant Betti numbers - for graded commuting d-tuples of Hilbert space operators. Our approach is based on the notion of free cover of a (perhaps…
In this survey we consider polynomial optimization problems, asking to minimize a polynomial function over a compact semialgebraic set, defined by polynomial inequalities. This models a great variety of (in general, nonlinear nonconvex)…
A tight alignment between the degree vector and the leading eigenvector arises naturally in networks with neutral degree mixing and the absence of local structures. Many real-world networks, however, violate both conditions. We derive…
We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…
We compute a minimal bigraded resolution of the Rees Algebra associated to a proper rational parametrization of a monomial plane curve. We describe explicitly both the bigraded Betti numbers and the maps of the resolution in terms of a…
Let $I \subset k[x_1, \dotsc, x_n]$ be a squarefree monomial ideal a polynomial ring. In this paper we study multiplications on the minimal free resolution $\mathbb{F}$ of $k[x_1, \dotsc, x_n]/I$. In particular, we characterize the possible…
Let $R=S/I$ be a graded algebra with $t_i$ and $T_i$ being the minimal and maximal shifts in the minimal $S$ resolution of $R$ at degree $i$. In this paper we prove that $t_n\leq t_1+T_{n-1}$, for all $n$ and as a consequence, we show that…
Let d1,...,dn be a strictly increasing sequence of integers. Boij and S\"oderberg [arXiv:math/0611081] have conjectured the existence of a graded module M of finite length over any polynomial ring K[x_1,..., x_n], whose minimal free…
We construct a minimal free resolution of the semigroup ring k[C] in terms of minimal resolutions of k[A] and k[B] when <C> is a numerical semigroup obtained by gluing two numerical semigroups <A> and <B>. Using our explicit construction,…
We give sharp lower bounds for the degree of the syzygies involving the partial derivatives of a homogeneous polynomial defining an even dimensional nodal hypersurface. This implies the validity of formulas due to M. Saito, L. Wotzlaw and…
We use discrete Morse theory to study free resolutions of monomial ideals in combination with splitting techniques. We establish the minimality of such pruned resolutions for several classes of ideals, including stable and linear quotient…
The singularity degree of a semidefinite programming problem is the smallest number of facial reduction steps to make the problem strictly feasible. We introduce two new graph parameters, called the singularity degree and the nondegenerate…
The feedback set problems are about removing the minimum number of vertices or edges from a graph to break all its cycles. Much effort has gone into understanding their complexity on planar graphs as well as on graphs of bounded degree. We…
A concrete formulation of the Lehmann-Maehly-Goerisch method for semi-definite self-adjoint operators with compact resolvent is considered. Precise rates of convergence are determined in terms of how well the trial spaces capture the…
The degree-constrained subgraph problem asks for a subgraph of a given graph such that the degree of each vertex is within some specified bounds. We study the following reconfiguration variant of this problem: Given two solutions to a…