Related papers: Algorithms for strongly stable ideals

We give conditions for determining the extremal behavior for the (graded) Betti numbers of squarefree monomial ideals. For the case of non-unique minima, we give several conditions which we use to produce infinite families, exponentially…

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring in $n$ variables over a field $K$. In this paper, we compute the socle of $\cb$-bounded strongly stable ideals and determine that the saturation number of strongly stable ideals and of…

Algorithms of control of differential equations solutions are under investigation in the article. Idealized and real modifications of the algorithms are distinguished. An equation, which can be the base equation for investigation of the…

We consider the multigraded Hilbert scheme corresponding to the Hilbert function of a finite number of points in general position in a smooth projective complex toric variety. We develop several criteria for a point of that parameter space…

Sparse polynomial approximation has become indispensable for approximating smooth, high- or infinite-dimensional functions from limited samples. This is a key task in computational science and engineering, e.g., surrogate modelling in…

We consider a many-to-one variant of the stable matching problem. More concretely, we consider the variant of the stable matching problem where one side has a matroid constraint. Furthermore, we consider the situation where the preference…

This paper investgates Stanley-Reisner ideals with pure resolutions. We first describe two infinite families of such ideals associated to highly symmetric complexes. We then prove a partial analogue to the first Boij-S\"oderberg Conjecture…

The aim of this paper is to make a connection between design theory and algebraic geometry/commutative algebra. In particular, given any Steiner System $S(t,n,v)$ we associate two ideals, in a suitable polynomial ring, defining a Steiner…

We call an ideal in a polynomial ring robust if it can be minimally generated by a universal Gr\"obner basis. In this paper we show that robust toric ideals generated by quadrics are essentially determinantal. We then discuss two possible…

In this paper, we study arbitrary (not necessarily associative) 3-dimensional algebras. Such an algebra A is determined by a basis and the corresponding multiplication table, which is specified by 27 structure constants. We describe all…

We continue the study of the rich family of norm-closed, automorphism invariant ideals of a continuous nest algebra. First we present a unified framework which captures all stable ideals as the kernels of limits of diagonal compressions. We…

We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…

Let J be a strongly stable monomial ideal in P=k[X0,...,Xn] and let BSt(J) be the family of all the homogeneous ideals in P such that the set N(J) of all the monomials that do not belong to J is a k-vector basis of the quotient P/I. We show…

We show that there is a stable homotopy theory of profinite spaces and use it for two main applications. On the one hand we construct an \'etale topological realization of the stable motivic homotopy theory of smooth schemes over a base…

We study an inductive method of computing initial ideals and Gr\"obner bases for families of ideals in a polynomial ring. This method starts from a given set of pairs $(I,J)$ where $I$ is any ideal and $J$ is a monomial ideal contained in…

In present paper, an analysis of the stability behaviour of ideal efficient solutions to parametric vector optimization problems is conducted. A sufficient condition for the existence of ideal efficient solutions to locally perturbed…

We give a numerical characterization of the possible extremal Betti numbers (values as well as positions) of any homogeneous ideal in a polynomial ring over a field.

In this paper, we first give some sufficient criteria for normality of monomial ideals. As applications, we show that closed neighborhood ideals of complete bipartite graphs are normal, and hence satisfy the (strong) persistence property.…

We introduce the combinatorial Lyubeznik resolution of monomial ideals. We prove that this resolution is isomorphic to the usual Lyubezbnik resolution. As an application, we give a combinatorial method to determine if an ideal is a…

We present an algorithm for explicitly computing the number of generators of the stable cohomology algebra of any rationally smooth partial toroidal compactification of ${\mathcal A}_g$, satisfying certain additivity and finiteness…