Related papers: When are Morse resolutions polyhedral?
Let $K$ be a field, $V$ a finite dimensional $K$-vector space and $E$ the exterior algebra of $V$. We analyze iterated mapping cone over $E$. If $I$ is a monomial ideal of $E$ with linear quotients, we show that the mapping cone…
For each squarefree monomial ideal $I\subset S = k[x_{1},\ldots, x_{n}] $, we associate a simple graph $G_I$ by using the first linear syzygies of $I$. In cases, where $G_I$ is a cycle or a tree, we show the following are equivalent: (a) $…
A recent result of Eisenbud-Schreyer and Boij-S\"oderberg proves that the Betti diagram of any graded module decomposes as a positive rational linear combination of pure diagrams. When does this numerical decomposition correspond to an…
Let $K$ be a field, $V$ a $K$-vector space with basis $e_1,\ldots,e_n$, and $E$ the exterior algebra of $V$. To a given monomial ideal $I\subsetneq E$ we associate a special monomial ideal $J$ with generators in the same degrees as those of…
We introduce the class of principal symmetric ideals, which are ideals generated by the orbit of a single polynomial under the action of the symmetric group. Fixing the degree of the generating polynomial, this class of ideals is…
The polyhedral realizations for crystal bases of the integrable highest weight modules of $U_q(\mathfrak{g})$ have been introduced in ([T.Nakashima, J. Algebra, vol.219, no. 2, (1999)]), which describe the crystal bases as sets of lattice…
Binary polynomial optimization is equivalent to the problem of minimizing a linear function over the intersection of the multilinear set with a polyhedron. Many families of valid inequalities for the multilinear set are available in the…
We apply the homomorphism complex construction to partially ordered sets, introducing a new topological construction based on the set of maximal chains in a graded poset. Our primary objects of study are distributive lattices, with special…
Split cuts are cutting planes for mixed integer programs whose validity is derived from maximal lattice point free polyhedra of the form $S:=\{x : \pi_0 \leq \pi^T x \leq \pi_0+1 \}$ called split sets. The set obtained by adding all split…
Let $S=\mathbb{K}[x_1,\ldots,x_n]$ the polynomial ring over a field $\mathbb{K}$. In this paper for some families of monomial ideals $I \subset S$ we study the minimal number of generators of $I^k$. We use this results to find some other…
We show that any polyhedron forming a topological ball with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face to face. The result generalizes to non-simply-connected polyhedra satisfying an…
Motivated by applications in geomorphology, the aim of this paper is to extend Morse-Smale theory from smooth functions to the radial distance function (measured from an internal point), defining a convex polyhedron in 3-dimensional…
We express the multigraded Betti numbers of monomial ideals in 4 variables in terms of the multigraded Betti numbers of 66 squarefree monomial ideals, also in 4 variables. We use this class of 66 ideals to prove that monomial resolutions in…
Squarefree monomial ideals arising from finite meet-semilattices and their free resolutions are studied. For the squarefree monomial ideals corresponding to poset ideals in a distributive lattice the Alexander dual is computed.
We study how powerful algebraic discrete Morse theory is when applied to hull resolutions. The main result describes all cases when the hull resolution of the edge ideal of the complement of a triangle-free graph can be made minimal using…
The perfect matching complex of a simple graph $G$ is a simplicial complex having facets (maximal faces) as the perfect matchings of $G$. This article discusses the perfect matching complex of polygonal line tilings and the $\left(2 \times…
A tetrahedral curve is an unmixed, usually non-reduced, one-dimensional subscheme of projective 3-space whose homogeneous ideal is the intersection of powers of the ideals of the six coordinate lines. The second and third authors have shown…
Given vertex valencies admissible for a self-dual polyhedral graph, we describe an algorithm to explicitly construct such a polyhedron. Inputting in the algorithm permutations of the degree sequence can give rise to non-isomorphic graphs.…
Every multigraded free resolution of a monomial ideal I contains the Scarf multidegrees of I. We say I has a Scarf resolution if the Scarf multidegrees are sufficient to describe a minimal free resolution of I. The main question of this…
Discrete Morse theory has emerged as a powerful tool for a wide range of problems, including the computation of (persistent) homology. In this context, discrete Morse theory is used to reduce the problem of computing a topological invariant…