English
Related papers

Related papers: A parametric version of the Hilbert Nullstellensat…

200 papers

We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…

Discrete Mathematics · Computer Science 2016-05-20 Jarkko Kari , Michal Szabados

Let $R$ be a polynomial ring over a field and $M= \bigoplus_n M_n$ a finitely generated graded $R$-module, minimally generated by homogeneous elements of degree zero with a graded $R$-minimal free resolution $\mathbf{F}$. A Cohen-Macaulay…

Commutative Algebra · Mathematics 2021-01-01 Sabine El Khoury , Manoj Kummini , Hema Srinivasan

The "openness" of a complex polynomial mapping is discussed and applied to the Fundamental Theorem of Algebra. In this category fall proofs of S. Wolfenstein, R.L. Thompson, J. Milnor, and S. Reich-S. Smale. These proofs take into account…

Complex Variables · Mathematics 2015-12-02 Jon A. Sjogren

The space of subvarieties of P^n with a fixed Hilbert polynomial is not complete. Grothendieck defined a completion by relaxing "variety" to "scheme", giving the complete_Hilbert scheme_ of subschemes of P^n with fixed Hilbert polynomial.…

Algebraic Geometry · Mathematics 2010-05-02 Valery Alexeev , Allen Knutson

In this paper we develop an axiomatic setup for algorithmic homological algebra of Abelian categories. This is done by exhibiting all existential quantifiers entering the definition of an Abelian category, which for the sake of…

Commutative Algebra · Mathematics 2017-10-27 Mohamed Barakat , Markus Lange-Hegermann

Graphons are symmetric measurable functions that arise from a sequence of graphs. A graphon variety is the a set of all graphons defined by a condition of the form $t(g, W) = 0$ for a fixed quantum graph $g$, where $t(.,.)$ is the…

Algebraic Geometry · Mathematics 2026-05-18 Madelyn Andersen

We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…

alg-geom · Mathematics 2008-02-03 M. Giusti , J. Heintz , K. Hägele , J. E. Morais , L. M. Pardo , J. L. Montaña

We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…

Algebraic Geometry · Mathematics 2009-09-25 J. Maurice Rojas

Positivstellensatz is a fundamental result in real algebraic geometry providing algebraic certificates for positivity of polynomials on semialgebraic sets. In this article Positivstellens\"atze for trace polynomials positive on…

Rings and Algebras · Mathematics 2019-01-23 Igor Klep , Špela Špenko , Jurij Volčič

In this expository paper, we present simple proofs of the Classical, Real, Projective and Combinatorial Nullstellens\"atze. Several applications are also presented such as a classical theorem of Stickelberger for solutions of polynomial…

Commutative Algebra · Mathematics 2022-02-25 Kriti Goel , Dilip P. Patil , Jugal Verma

We prove upper and lower bounds for all the coefficients in the Hilbert Polynomial of a graded Gorenstein algebra $S=R/I$ with a quasi-pure resolution over $R$. The bounds are in terms of the minimal and the maximal shifts in the resolution…

Commutative Algebra · Mathematics 2012-02-08 Sabine El Khoury , Hema Srinivasan

We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…

Discrete Mathematics · Computer Science 2015-10-02 Jarkko Kari , Michal Szabados

Let $I$ be a homogeneous ideal in the polynomial ring $R = k[z_1, \cdots, z_n]$ , where $k$ is an algebraically closed field of characteristic zero. Macaulay's Theorem provides constraints on the Hilbert function of $I$ or $R/I$ from one…

Complex Variables · Mathematics 2025-12-29 Yun Gao

The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…

Cryptography and Security · Computer Science 2022-09-22 Alessio Caminata , Elisa Gorla

We significantly strengthen and generalize the theorem lifting Nullstellensatz degree to monotone span program size by Pitassi and Robere (2018) so that it works for any gadget with high enough rank, in particular, for useful gadgets such…

Computational Complexity · Computer Science 2020-01-08 Susanna F. de Rezende , Or Meir , Jakob Nordström , Toniann Pitassi , Robert Robere , Marc Vinyals

Putinar's Positivstellensatz is a central theorem in real algebraic geometry. It states the following: If you have a set $S= \{ x \in R^n \ | \ g_1 (x) \geq 0, ... , g_m(x) \geq 0\}$ described by some real polynomials $g_i$, then every real…

Algebraic Geometry · Mathematics 2016-03-23 Tom-Lukas Kriel

In this paper, we introduce and study differential graded (DG for short) polynomial algebras. In brief, a DG polynomial algebra $\mathcal{A}$ is a connected cochain DG algebra such that its underlying graded algebra $\mathcal{A}^{\#}$ is a…

Rings and Algebras · Mathematics 2018-04-25 X. -F. Mao , X. -D. Gao , Y. -N. Yang , J. -H. Chen

A relatively compressed algebra with given socle degrees is an Artinian quotient $A$ of a given graded algebra $R/\fc$, whose Hilbert function is maximal among such quotients with the given socle degrees. For us $\fc$ is usually a…

Commutative Algebra · Mathematics 2007-05-23 Juan C. Migliore , Rosa Miró-Roig , Uwe Nagel

Positivstellens{\"a}tze are a group of theorems on the positivity of involution algebras over $\mathbb{R}$ or $\mathbb{C}$. One of the most well-known Positivstellensatz is the solution to Hilbert's 17th problem given by E. Artin, which…

Representation Theory · Mathematics 2024-06-12 Hao Liang

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
‹ Prev 1 3 4 5 6 7 10 Next ›