Related papers: Almost Vanishing Polynomials for Sets of Limited P…

It is an open problem to determine the dimension of the space of homogeneous polynomials of a fixed degree vanishing at finitely many points in the projective plane to certain multiplicities. We present various aspects of this problem and a…

A subset $X$ of a groupoid is said to be deficient if $|X \cdot X|\leq |X|$. It is well-known that the probability that a random groupoid has a deficient $t$-element set with $t\geq 3$ is zero. However, as conjectured in [4], we show that…

We provide some general conditions which ensure that a system of inequalities involving homogeneous polynomials with coefficients in a S-adic field has nontrivial S-integral solutions. The proofs are based on the strong approximation…

The paper addresses parametric inequality systems described by polynomial functions in finite dimensions, where state-dependent infinite parameter sets are given by finitely many polynomial inequalities and equalities. Such systems can be…

A characteristic pair is a pair (G,C) of polynomial sets in which G is a reduced lexicographic Groebner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be…

We consider multivariable polynomials over a fixed number field, linear in some of the variables. For a system of such polynomials satisfying certain technical conditions we prove the existence of search bounds for simultaneous zeros with…

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

In a 1995 paper Richard Stanley defined $X_G$, the symmetric chromatic polynomial of a Graph $G=(V,E)$. He then conjectured that $X_G$ distinguishes trees; a conjecture which still remains open. $X_G$ can be represented as a certain…

In this paper we characterize, in algebraic and geometric terms, when a graded vanishing ideal is generated by binomials over any field K.

Gaussian universality results assert that the properties of many estimators remain unchanged when the input data are replaced by Gaussians. Such results have gained popularity in high-dimensional statistics and machine learning, as…

Let $I$ be a homogeneous ideal in $R=\mathbb K[x_0,\ldots,x_n]$, such that $R/I$ is an Artinian Gorenstein ring. A famous theorem of Macaulay says that in this instance $I$ is the ideal of polynomial differential operators with constant…

Suppose the data consist of a set $S$ of points $x_j, 1 \leq j \leq J$, distributed in a bounded domain $D \subset R^N$, where $N$ and $J$ are large numbers. In this paper an algorithm is proposed for checking whether there exists a…

A \textit{symmetric ideal} $I \subseteq R = K[x_1,x_2,...]$ is an ideal that is invariant under the natural action of the infinite symmetric group. We give an explicit algorithm to find Gr\"obner bases for symmetric ideals in the infinite…

An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…

Orthogonal polynomial approximations form the foundation to a set of well-established methods for uncertainty quantification known as polynomial chaos. These approximations deliver models for emulating physical systems in a variety of…

We generalize the analog of Buchberger's first criterion, stated by Boulier et al., for detecting useless S-polynomials reductions in the computation of characteristic sets of differential ideals. The original version assumes linear…

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

In this article, we consider the notion of almost irredundant sets: A subset $\mathcal{X}$ of a C*-algebra $\mathcal{A}$ is called almost irredundant if and only if for every $a\in \mathcal{X}$, the element $a$ does not belong to the…

A mixed dominating set $S$ of a graph $G=(V,E)$ is a subset $ S \subseteq V \cup E$ such that each element $v\in (V \cup E) \setminus S$ is adjacent or incident to at least one element in $S$. The mixed domination number $\gamma_m(G)$ of a…

In this article, we propose a geometric programming method in order to compute lower bounds for real polynomials. We provide new sufficient conditions for polynomials to be nonnegative as well as to have a sum of binomial squares…