English
Related papers

Related papers: A polynomial ideal associated to any $t$-$(v,k,\la…

200 papers

This paper investigates atomic factorizations in the monoid $\mathcal I(R)$ of nonzero ideals of a multivariate polynomial ring $R$, under ideal multiplication. Building on recent advances in factorization theory for unit-cancellative…

Commutative Algebra · Mathematics 2026-03-10 Nikola Bogdanovic , Laura Cossu , Azeem Khadam

Let $\mathbb{F}[X]$ be the polynomial ring over the variables $X=\{x_1,x_2, \ldots, x_n\}$. An ideal $I=\langle p_1(x_1), \ldots, p_n(x_n)\rangle$ generated by univariate polynomials $\{p_i(x_i)\}_{i=1}^n$ is a \emph{univariate ideal}. We…

Data Structures and Algorithms · Computer Science 2018-09-24 V. Arvind , Abhranil Chatterjee , Rajit Datta , Partha Mukhopadhyay

An ideal $I$ in a Noetherian ring is called \textit{normal} if $I^n$ is integrally closed for all $n \geq 1$. Zariski proved that in two-dimensional regular local rings, every integrally closed ideal is normal. However, in dimension three…

Commutative Algebra · Mathematics 2026-02-03 Maki Ataka , Naoyuki Matsuoka

Recall that combinatorial $2s$-designs admit a classical lower bound $b \ge \binom{v}{s}$ on their number of blocks, and that a design meeting this bound is called tight. A long-standing result of Bannai is that there exist only finitely…

Combinatorics · Mathematics 2011-10-18 Peter Dukes , Jesse Short-Gershman

A $3$-$(v,\{4,6\},1)$ design is a configuration of $v$ points and a collection of $4$- and $6$-element subsets called blocks, that jointly contain every 3-element subset exactly once. Using an exhaustive computer search on $v\leq 28$ points…

Combinatorics · Mathematics 2023-05-09 M. Epstein , D. L. Kreher , S. S. Magliveras

Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over $\mathbb{K}$. Assume that $G$ is a graph with edge ideal $I(G)$. We prove that the modules $S/\overline{I(G)^k}$ and…

Commutative Algebra · Mathematics 2018-08-13 S. A. Seyed Fakhari

Let f1, ..., fs be a polynomial family in Q[X1,..., Xn] (with s less than n) of degree bounded by D. Suppose that f1, ..., fs generates a radical ideal, and defines a smooth algebraic variety V. Consider a projection P. We prove that the…

Symbolic Computation · Computer Science 2007-05-23 Mohab Safey El Din , Philippe Trebuchet

Given an ideal $I$ in a polynomial ring $K[x_1,\dots,x_n]$ over a field $K$, we present a complete algorithm to compute the binomial part of $I$, i.e., the subideal ${\rm Bin}(I)$ of $I$ generated by all monomials and binomials in $I$. This…

Commutative Algebra · Mathematics 2023-07-19 Martin Kreuzer , Florian Walsh

In this article we first compare the set of elements in the socle of an ideal of a polynomial algebra $K[x_1,\ldots,x_d]$ over a field $K$ that are not in the ideal itself and Macaulay's inverse systems of such polynomial algebras in a…

Commutative Algebra · Mathematics 2023-09-26 Geir Agnarsson , Neil Epstein

Let $R = k[x_1, \dotsc , x_n]$ denote the standard graded polynomial ring over a field $k$. We study certain classes of equigenerated monomial ideals with the property that the so-called complementary ideal has no linear relations on the…

Commutative Algebra · Mathematics 2022-01-27 Keller VandeBogert

This paper has two aims. The first is to study ideals of minors of matrices whose entries are among the variables of a polynomial ring. Specifically, we describe matrices whose ideals of minors of a given size are prime. The main result in…

Commutative Algebra · Mathematics 2007-05-23 Mordechai Katzman

Let $G$ be a simple graph on the vertex set $\{1,\ldots,n\}$ with $m$ edges. An algebraic object attached to $G$ is the ideal $P_{G}$ generated by diagonal 2-minors of an $n \times n$ matrix of variables. In this paper we prove that if $G$…

Commutative Algebra · Mathematics 2016-07-26 Anargyros Katsabekis

Let $X$ be a matrix with entries in a polynomial ring over an algebraically closed field $K$. We prove that, if the entries of $X$ outside some $(t \times t)$-submatrix are algebraically dependent over $K$, the arithmetical rank of the…

Commutative Algebra · Mathematics 2017-11-20 Margherita Barile , Antonio Macchia

Consider the problem of constructing an experimental design, optimal for estimating parameters of a given statistical model with respect to a chosen criterion. To address this problem, the literature usually provides a single solution.…

Computation · Statistics 2024-11-05 Radoslav Harman , Lenka Filová , Samuel Rosa

Let $X$ be a set of points whose coordinates are known with limited accuracy; our aim is to give a characterization of the vanishing ideal $I(X)$ independent of the data uncertainty. We present a method to compute a polynomial basis $B$ of…

Commutative Algebra · Mathematics 2009-03-18 John Abbott , Claudia Fassino , Maria-Laura Torrente

A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…

Data Structures and Algorithms · Computer Science 2016-11-15 Damian Straszak , Nisheeth K. Vishnoi

An incidence structure consists simply of a set P of points and a set B of blocks, with a relation of incidence between points and blocks.A symmetric (v,k,\lambda) block design is the subject of this paper. The symmetric (n^2+n+1, n+1,1)…

General Mathematics · Mathematics 2017-09-14 Mingchun Xu

Let $G$ be a simple graph on $d$ vertices. We define a monomial ideal $K$ in the Stanley-Reisner ring $A$ of the order complex of the Boolean algebra on $d$ atoms. The monomials in $K$ are in one-to-one correspondence with the proper…

Combinatorics · Mathematics 2007-05-23 Einar Steingrimsson

Let $ V $ a vector space of dimension $n$. A family $ \{H_1, \ldots, H_p \} $ of vectorial hyperplans $V$ defines an arrangement $ {\cal A} $ of $ V $. For $ i \in \{ 1, \ldots, p \} $, let $ l_i $ be a linear form on $V$ with $H_i$ as…

Algebraic Geometry · Mathematics 2016-10-12 Philippe Maisonobe

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

Symbolic Computation · Computer Science 2024-08-29 Yuki Ishihara , Kazuhiro Yokoyama