Related papers: Lower Bounds for the Number of Generic Initial Ide…

Let $K$ be a field and $X$, $Y$ denote matrices such that, the entries of $X$ are either indeterminates over $K$ or $0$ and the entries of $Y$ are indeterminates over $K$ which are different from those appearing in $X$. We consider ideals…

Let $I\supsetneq J$ be two squarefree monomial ideals of a polynomial algebra over a field generated in degree $\geq d$, resp. $\geq d+1$ . Suppose that $I$ is either generated by three monomials of degrees $d$ and a set of monomials of…

We study algebras k[x_1,...,x_n]/I which admit a grading by a subsemigroup of N^d such that every graded component is a one-dimensional k-vector space. V.I.~Arnold and coworkers proved that for d = 1 and n <= 3 there are only finitely many…

Let $K/F$ be a finite extension of number fields of degree $n \geq 2$. We establish effective field-uniform unconditional upper bounds for the least norm of a prime ideal of $F$ which is degree 1 over $\mathbb{Q}$ and does not ramify or…

Edge ideals of finite simple graphs are well-studied over polynomial rings. In this paper, we initiate the study of edge ideals over exterior algebras, specifically focusing on the depth and singular varieties of such ideals. We prove an…

We begin the study of the notion of diameter of an ideal I of a polynomial ring S over a field, an invariant measuring the distance between the minimal primes of I. We provide large classes of Hirsch ideals, i.e. ideals with diameter not…

We study ideals which are generated by monomials of degree $d$ in the polynomial ring in $n$ variables and which satisfy certain numerical side conditions regarding their exponents. Typical examples of such ideals are the ideals of Veronese…

In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the simplex method for linear programming problems having optimal solutions. The bound is polynomial of the number of constraints,…

In this article we investigate the distribution of prime ideals of residue degree bigger than one across the ideal classes in the class group of a number field $L$. A criterion for the class group of $L$ being generated by the classes of…

We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.

Let $R$ be a polynomial ring over a field and $I \subset R$ be a Gorenstein ideal of height three that is minimally generated by homogeneous polynomials of the same degree. We compute the multiplicity of the saturated special fiber ring of…

In the context of modeling biological systems, it is of interest to generate ideals of points with a unique reduced Groebner basis, and the first main goal of this paper is to identify classes of ideals in polynomial rings which share this…

The classical "generalized principal ideal theorems" of Macaulay, Eagon-Northcott, and others give sharp bounds on the heights of determinantal ideals in arbitrary rings. But in regular local rings (or graded polynomial rings) these are far…

Given a square matrix $A$ with entries in a commutative ring $S$, the ideal of $S[X]$ consisting of polynomials $f$ with $f(A) =0$ is called the null ideal of $A$. Very little is known about null ideals of matrices over general commutative…

We consider ideals $I$ in a Stanley-Reisner ring $k[\Delta]$ over the simplical complex $\Delta$, such that the tight closure of $I$, $I^*$, is equal to $\mathfrak{m}$, the standard graded maximal ideal of $k[\Delta]$. We determine the…

Let $G$ be a finite group and let $ram^{t}(G)$ denote the minimal positive integer $n$ such that $G$ can be realized as the Galois group of a tamely ramified extension of $\mathbb{Q}$ ramified only at $n$ finite primes. Let $d(G)$ denote…

Powers of (monomial) ideals is a subject that still calls attraction in various ways. Let $I\subset \mathbb K[x_1,\ldots,x_n]$ be a monomial ideal and let $G(I)$ denote the (unique) minimal monomial generating set of $I$. How small can…

In this paper we obtain significant bounds for the number of maximal subgroups of a given index of a finite group. These results allow us to give new bounds for the number of random generators needed to generate a finite $d$-generated group…

In a recent paper by Harada, Seceleanu, and \c{S}ega, the Hilbert function, betti table, and graded minimal free resolution of a general principal symmetric ideal are determined when the number of variables in the polynomial ring is…

Let $I$ be a monomial ideal $I$ in a polynomial ring $R = k[x_1,...,x_r]$. In this paper we give an upper bound on $\overline{\dstab} (I)$ in terms of $r$ and the maximal generating degree $d(I)$ of $I$ such that $\depth R/\overline{I^n}$…