English
Related papers

Related papers: Segre-Driven Radicality Testing

200 papers

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field and $A$ a standard graded $S$-algebra. In terms of the Gr\"obner basis of the defining ideal $J$ of $A$ we give a condition, called the x-condition, which implies that all graded…

Commutative Algebra · Mathematics 2020-10-23 Jürgen Herzog , Takayuki Hibi , Somayeh Moradi

We study the linear algebra of finite subsets $S$ of a Segre variety $X$. In particular we classify the pairs $(S,X)$ with $S$ linear dependent and $\#(S)\le 5$. We consider an additional condition for linear dependent sets (no two of their…

Algebraic Geometry · Mathematics 2020-02-14 Edoardo Ballico

The Ritt problem asks if there is an algorithm that tells whether one prime differential ideal is contained in another one if both are given by their characteristic sets. We give several equivalent formulations of this problem. In…

Commutative Algebra · Mathematics 2013-03-05 Oleg Golubitsky , Marina Kondratieva , Alexey Ovchinnikov

We study a class of hypothesis testing problems in which, upon observing the realization of an $n$-dimensional Gaussian vector, one has to decide whether the vector was drawn from a standard normal distribution or, alternatively, whether…

Statistics Theory · Mathematics 2010-11-22 Louigi Addario-Berry , Nicolas Broutin , Luc Devroye , Gábor Lugosi

Let $S$ be a polynomial ring in $n$ variables over a field. Let $I$ be a homogeneous ideal in $S$ generated by forms of degree at most $d$ with $\text{dim}(S/I)=r$. In the first part of this paper, we show how to derive from a result of Hoa…

Commutative Algebra · Mathematics 2022-04-20 Yihui Liang

Given a 0-dimensional affine K-algebra R=K[x_1,...,x_n]/I, where I is an ideal in a polynomial ring K[x_1,...,x_n] over a field K, or, equivalently, given a 0-dimensional affine scheme, we construct effective algorithms for checking whether…

Commutative Algebra · Mathematics 2019-08-07 Martin Kreuzer , Le Ngoc Long , Lorenzo Robbiano

Can one tell if an ideal is radical just by looking at the degrees of the generators? In general, this is hopeless. However, there are special collections of degrees in multigraded polynomial rings, with the property that any multigraded…

Commutative Algebra · Mathematics 2022-03-17 Aldo Conca , Emanuela De Negri , Elisa Gorla

We provide a real algebraic symbolic-numeric algorithm for computing the real variety $V_R(I)$ of an ideal $I$, assuming it is finite while $V_C(I)$ may not be. Our approach uses sets of linear functionals on $R[X]$, vanishing on a given…

Algebraic Geometry · Mathematics 2009-01-16 J. B. Lasserre , M. Laurent , P. Rostalski

This paper studies algebraic residual intersections in rings with Serre's condition \( S_{s} \). It demonstrates that residual intersections admit free approaches i.e. perfect subideal with the same radical. This fact leads to determining a…

Commutative Algebra · Mathematics 2025-02-13 S. Hamid Hassanzadeh

We prove that the set of Segre-degenerate points of a real-analytic subvariety $X$ in ${\mathbb{C}}^n$ is a closed semianalytic set. It is a subvariety if $X$ is coherent. More precisely, the set of points where the germ of the Segre…

Complex Variables · Mathematics 2024-05-24 Jiri Lebl

We prove an identity of Segre classes for zero-schemes of compatible sections of two vector bundles. Applications include bounds on the number of equations needed to cut out a scheme with the same Segre class as a given subscheme of (for…

Algebraic Geometry · Mathematics 2016-10-18 Paolo Aluffi

It has recently been shown that the problem of testing global convexity of polynomials of degree four is {strongly} NP-hard, answering an open question of N.Z. Shor. This result is minimal in the degree of the polynomial when global…

Optimization and Control · Mathematics 2019-03-14 Amir Ali Ahmadi , Georgina Hall

In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity. Recently, a series of paper has been published for analysis of expansion complexity and for testing sequences in terms of this new…

Number Theory · Mathematics 2019-05-06 Domingo Gómez-Pérez , László Mérai

We consider the problem of determining whether a monomial ideal is dominant. This property is critical for determining for which monomial ideals the Taylor resolution is minimal. We first analyze dominant ideals with a fixed least common…

Radical membership testing, and the special case of Hilbert's Nullstellensatz (HN), is a fundamental computational algebra problem. It is NP-hard; and has a famous PSPACE algorithm due to effective Nullstellensatz bounds. We identify a…

Computational Complexity · Computer Science 2020-06-16 Abhibhav Garg , Nitin Saxena

In this paper we continue the development of a new technique for computing elimination ideals by substitution which has been called $Z$-separating re-embeddings. Given an ideal $I$ in the polynomial ring $K[x_1,\dots,x_n]$ over a field $K$,…

Commutative Algebra · Mathematics 2024-12-25 Bernhard Andraschko , Martin Kreuzer , Le Ngoc Long

We study the Radical Identity Testing problem (RIT): Given an algebraic circuit representing a polynomial $f\in \mathbb{Z}[x_1, \ldots, x_k]$ and nonnegative integers $a_1, \ldots, a_k$ and $d_1, \ldots,$ $d_k$, written in binary, test…

Computational Complexity · Computer Science 2024-10-17 Nikhil Balaji , Klara Nosan , Mahsa Shirmohammadi , James Worrell

We consider an homogeneous ideal $I$ in the polynomial ring $S=K[x_1,\dots,$ $x_m]$ over a finite field $K=\mathbb{F}_q$ and the finite set of projective rational points $\mathbb{X}$ that it defines in the projective space…

Commutative Algebra · Mathematics 2023-10-24 Philippe Gimenez , Diego Ruano , Rodrigo San-José

An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between elliptic curves efficiently. For ordinary curves of the same…

Number Theory · Mathematics 2014-02-12 David Jao , Vladimir Soukharev

Testing the validity of probabilistic models containing unmeasured (hidden) variables is shown to be a hard task. We show that the task of testing whether models are structurally incompatible with the data at hand, requires an exponential…

Artificial Intelligence · Computer Science 2013-02-28 Dan Geiger , Azaria Paz , Judea Pearl