Related papers: Quantitative Combinatorial Nullstellensatz

We show a generalization of Mason's ABC-theorem, with the only conditions that the greatest common divisor has been divided out and no proper subsum of the (possibly multivariate) polynomial sum f_1 + f_2 + ... + f_n = 0 vanishes. As a…

We give a non-commutative Positivstellensatz for CP^n: The (commutative) *-algebra of polynomials on the real algebraic set CP^n with the pointwise product can be realized by phase space reduction as the U(1)-invariant polynomials on…

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one performs a random walk on a group enjoying a strong spectral…

A classification theorem for linear differential equations in two variables (one real and one Grassmann) having polynomial solutions(the generalized Bochner problem) is given. The main result is based on the consideration of the eigenvalue…

A generalization of the Heisenberg algebra has been recently constructed. This generalized algebra has a characteristic function which depends on one of its generators. When this function is linear, $qJ_0+s$, it is possible to construct a…

We study the copolynomials of $n$ variables, i.e. $K$-linear mappings from the ring of polynomials $K[x_1,...,x_n]$ into the commutative ring $K$. We prove an existence and uniqueness theorem for a linear differential equation of infinite…

Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…

In a seminal paper, Alon and Tarsi have introduced an algebraic technique for proving upper bounds on the choice number of graphs (and thus, in particular, upper bounds on their chromatic number). The upper bound on the choice number of $G$…

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…

We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…

We study varieties defined by parameterizing polynomials of derivatives through a computational algebro-geometric approach, especially relying on Combinatorial Nullstellensatz and Noether normalization. We establish that these polynomials…

We give the sufficient condition on coefficients $a_k$ of an algebraic polynomial $P(z)=\sum_{k=0}^{n}a_kz^k$, $a_n\not=0,$ for the pointwise Bernstein inequality $|P'(z)|\le n|P(z)|$ to be true for all $z\in\overline{\mathbb…

The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby,…

We give a systematic study of q-algebraic equations. The questions of existence, uniqueness and regularity of the solutions are solved in the space of grid-based Hahn series. The regularity is understood in terms of asymptotic behavior of…

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…

It is well known that the 2-variable Tutte polynomials contain chromatic polynomial and flow polynomial of graphs, i.e. the cases of $y=0$ and $x=0$. In 2013, K\'{a}lm\'{a}n introduced the interior and exterior polynomials which generalized…

We upper bound the number of common zeros over a finite grid of multivariate polynomials and an arbitrary finite collection of their consecutive Hasse derivatives (in a coordinate-wise sense). To that end, we make use of the tool from…

Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…

We give a constructive proof of the general Nullstellensatz: a univariate polynomial ring over a commutative Jacobson ring is Jacobson. This theorem implies that every finitely generated algebra over a zero-dimensional ring or the ring of…