English
Related papers

Related papers: A Gr\"{o}bner Basis Approach to Combinatorial Null…

200 papers

In previous work, the first three authors conjectured that the ring of regular functions on a natural class of affine log Calabi-Yau varieties (those with maximal boundary) has a canonical vector space basis parameterized by the integral…

Algebraic Geometry · Mathematics 2016-10-31 Mark Gross , Paul Hacking , Sean Keel , Maxim Kontsevich

We survey foundational principles of Grothendieck's generalized spaces, including a critical glossary of the various, and often conflicting, terminological usages. Known results using generalized points support a fully pointwise notation…

Category Theory · Mathematics 2022-06-03 Steven Vickers

A motivation to study Gr\"{o}bner theory for fields with valuations comes from tropical geometry, for example, they can be used to compute tropicalization of varieties \citep{maclagan2009introduction}. The computational aspect of this…

Commutative Algebra · Mathematics 2014-04-30 Aritra Sen , Ambedkar Dukkipati

The Nullstellensatz, proved by Hilbert in 1893, is a classical result that holds when the base field is algebraically closed. When the base field is finite, a version of Hilbert's Nullstellensatz is given by Terjanian in 1966. Laksov in…

Commutative Algebra · Mathematics 2025-05-09 Rati Ludhani

In this paper, we extend the idea of comprehensive Gr\"{o}bner bases given by Weispfenning (1992) to border bases for zero dimensional parametric polynomial ideals. For this, we introduce a notion of comprehensive border bases and border…

Symbolic Computation · Computer Science 2013-12-31 Abhishek Dubey , Ambedkar Dukkipati

We present in this paper a geometric theorem which clarifies and extends in several directions work of Brownawell, Kollar and others on the effective Nullstellensatz. To begin with, we work on an arbitrary smooth complex projective variety…

Algebraic Geometry · Mathematics 2009-10-31 Lawrence Ein , Robert Lazarsfeld

Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the last years. However, the polynomial case has not been…

Optimization and Control · Mathematics 2011-01-24 Víctor Blanco , Justo Puerto

Computing the critical points of a polynomial function $q\in\mathbb Q[X_1,\ldots,X_n]$ restricted to the vanishing locus $V\subset\mathbb R^n$ of polynomials $f_1,\ldots, f_p\in\mathbb Q[X_1,\ldots, X_n]$ is of first importance in several…

Symbolic Computation · Computer Science 2014-05-26 Pierre-Jean Spaenlehauer

The 'moduli continuity method' permits an explicit algebraisation of the Gromov-Hausdorff compactification of K\"ahler-Einstein metrics on Fano manifolds in some fundamental examples. In this paper, we apply such method in the 'log setting'…

Algebraic Geometry · Mathematics 2020-11-11 Patricio Gallardo , Jesus Martinez-Garcia , Cristiano Spotti

In this paper we consider a generic degree $d$ form $ F $ in $n+1$ variables. In particular, we investigate the existence of star configurations apolar to $F$, that is the existence of apolar sets of points obtained by the $ n $-wise…

Algebraic Geometry · Mathematics 2019-09-20 Iman Bahmani Jafarloo , Enrico Carlini

Gr{\"o}bner bases is one the most powerful tools in algorithmic non-linear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential in the number of variables. However, in most of the cases,…

Symbolic Computation · Computer Science 2019-02-04 Matías Bender , Jean-Charles Faugère , Elias Tsigaridas

The primary goal of this paper is to provide a general multiplicity estimate. Our main theorem allows to reduce a proof of multiplicity lemma to the study of ideals stable under some appropriate transformation of a polynomial ring. In…

Number Theory · Mathematics 2012-11-02 Evgeniy Zorin

This paper is a survey on the study of the behaviour of the composition of polynomials on the computation of Gr\"obner bases. This survey brings together some works published between 1995 and 2007. The authors of these papers gave answers…

Commutative Algebra · Mathematics 2018-02-01 Mahmoud S. Alsersawi , Manuel Ladra

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

We consider the problem of computing critical points of the restriction of a polynomial map to an algebraic variety. This is of first importance since the global minimum of such a map is reached at a critical point. Thus, these points…

Symbolic Computation · Computer Science 2012-02-02 Jean-Charles Faugère , Mohab Safey El Din , Pierre-Jean Spaenlehauer

Strassen's Positivstellensatz is a powerful but little known theorem on preordered commutative semirings satisfying a boundedness condition similar to Archimedeanicity. It characterizes the relaxed preorder induced by all monotone…

Algebraic Geometry · Mathematics 2021-02-03 Tobias Fritz

We develop the theory of Gr\"obner bases for ideals in a polynomial ring with countably infinite variables over a field. As an application we reconstruct some of the one-one correspondences among various sets of partitions by using division…

Commutative Algebra · Mathematics 2008-06-04 Kei-ichiro Iima , Yuji Yoshino

We interpret the Combinatorial Nullstellensatz of Noga Alon as a multidimensional residue formula, describe some consequences of this interpretation and related open problems.

Combinatorics · Mathematics 2018-11-16 Roman Karasev

We give an overpartition analogue of Bressoud's combinatorial generalization of the G\"ollnitz-Gordon theorem for even moduli in general case. Let $\widetilde{O}_{k,i}(n)$ be the number of overpartitions of $n$ whose parts satisfy certain…

Combinatorics · Mathematics 2017-03-01 Thomas Y. He , Allison Y. F. Wang , Alice X. H. Zhao

We show that Hilbert's Nullstellensatz, the problem of deciding if a system of multivariate polynomial equations has a solution in the algebraic closure of the underlying field, lies in the counting hierarchy. More generally, we show that…

Computational Complexity · Computer Science 2026-02-23 Robert Andrews , Abhibhav Garg , Éric Schost