Related papers: Algorithms for strongly stable ideals

We study the ideal generated by polynomials vanishing on a semialgebraic set and propose an algorithm to calculate the generators, which is based on some techniques of the cylindrical algebraic decomposition. By applying these, polynomial…

We introduce and study monomial ideals with regular quotients, which can be seen as an extension of monomial ideals with linear quotients. Based on these investigations, we are able to calculate the Betti numbers of toric ideals belonging…

The article introduces a new algorithm for solving a class ofequilibrium problems involving strongly pseudomonotone bifunctions with Lipschitz-type condition. We describe how to incorporate the proximal-like regularized technique with…

In this paper we consider stable matchings subject to assignment constraints. These are matchings that require certain assigned pairs to be included, insist that some other assigned pairs are not, and, importantly, are stable. Our main…

We consider several notions of genericity appearing in algebraic geometry and commutative algebra. Special emphasis is put on various stability notions which are defined in a combinatorial manner and for which a number of equivalent…

In this paper, we shall provide explicit formulas for the extremal Betti numbers of $R/I$, where $I$ is the defining ideal of certain weighted hyperplanes in $\Bbb{P}^{n-1}$ and $R$ is the polynomial ring in $n$ indeterminates over a field.…

Let $S = K[x_1, \ldots, x_n]$ denote the polynomial ring in $n$ variables over a field $K$ with each $\mathrm{deg}\ x_i = 1$ and $I \subset S$ a homogeneous ideal of $S$ with $\dim S/I = d$. The Hilbert series of $S/I$ is of the form…

We introduce a new class of monomial ideals, called strong Borel type ideals, and we compute the Mumford-Castelnouvo regularity for principal strong Borel type ideals. Also, we describe the d-fixed ideals generated by powers of variables…

A homogeneous ideal is robust if its universal Gr\"obner basis is also a minimal generating set. For toric ideals, one has the stronger definition: A toric ideal is strongly robust if its Graver basis equals the set of indispensable…

We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…

For any finite poset $P$ we have the poset of isotone maps $\text{Hom}(P,\mathbb{N})$, also called $P^{op}$-partitions. To any poset ideal ${\mathcal J}$ in $\text{Hom}(P,\mathbb{N})$, finite or infinite, we associate monomial ideals: the…

We give a sharp lower bound for the Hilbert function in degree $d$ of artinian quotients $\Bbbk[x_1,\ldots,x_n]/I$ failing the Strong Lefschetz property, where $I$ is a monomial ideal generated in degree $d \geq 2$. We also provide sharp…

We propose a new construction of two-dimensional natural bi-Hamiltonian systems associated with a very simple Lie algebra. The presented construction allows us to distinguish three families of super-integrable monomial potentials for which…

In this paper we consider monomial localizations of monomial ideals and conjecture that a monomial ideal is polymatroidal if and only if all its monomial localizations have a linear resolution. The conjecture is proved for squarefree…

Zonotopal algebra deals with ideals and vector spaces of polynomials that are related to several combinatorial and geometric structures defined by a finite sequence of vectors. Given such a sequence X, an integer k>=-1 and an upper set in…

We introduce the notion of sortability and $t$-sortability for a simplicial complex and study the graphs for which their independence complexes are either sortable or $t$-sortable. We show that the proper interval graphs are precisely the…

We determine a sharp lower bound for the Hilbert function in degree $d$ of a monomial algebra failing the weak Lefschetz property over a polynomial ring with $n$ variables and generated in degree $d$, for any $d\geq 2$ and $n\geq 3$. We…

Closed subschemes in projective space with a fixed Hilbert polynomial are parametrized by a Hilbert scheme. We classify the smooth ones. We identify numerical conditions on a polynomial that completely determine when the Hilbert scheme is…

We study the binary perceptron, a random constraint satisfaction problem that asks to find a Boolean vector in the intersection of independently chosen random halfspaces. A striking feature of this model is that at every positive constraint…

This paper demonstrates that extremal ideals can be used to great effect to compute integral closures of powers and symbolic powers of square-free monomial ideals. We show that the generators of these powers are images of the generators of…