Related papers: Combinatorial Nullstellensatz Techniques

Carleman linearization is a technique that embeds systems of ordinary differential equations with polynomial nonlinearities into infinite dimensional linear systems in a procedural way. In this paper we generalize the method for systems of…

Let $V$ be a real algebraic variety with singularities and $f$ be a real polynomial non-negative on $V$. Assume that the regular locus of $V$ is dense in $V$ by the usual topology. Using Hironaka's resolution of singularities and…

We approximate the Riemann Zeta-Function by polynomials and Dirichlet polynomials with restricted zeros.

We adapt methods coming from additive combinatorics in groups to the study of linear span in associative unital algebras. In particular, we establish for these algebras analogues of Diderrich-Kneser's and Hamidoune's theorems on sumsets and…

Grigoriev and Podolskii (2018) have established a tropical analogue of the effective Nullstellensatz, showing that a system of tropical polynomial equations is solvable if and only if a linearized system obtained from a truncated Macaulay…

In this paper methods for simultaneous finding all roots of generalized polynomials are developed. These methods are related to the case when the roots are multiple. They possess cubic rate of convergence and they are as labour-consuming as…

We describe a framework that unifies the two types of polynomials introduced respectively by Bacher and Mouton and by Rutschmann and Wettstein to analyze the number of triangulations of point sets. Using this insight, we generalize the…

Let $A$ denote an affine algebra over an algebraically closed field $k$, with $\dim A=d\geq 3$. In the light of availability of cancellation theorems for stably free modules $P$ with $rank(P)=d-1$ (corank one), we try to implement the…

A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.

The point-splitting regularization technique for composite operators is discussed in connection with anomaly calculation. We present a pedagogical and self-contained review of the topic with an emphasis on the technical details. We also…

We address a systematic combinatorial approach to the anti-normal ordering problem. In this way, we use the Stirling numbers and their generating function, the so-called Bell polynomials, together with the operational methods to anti-normal…

In this paper, we prove some general convergence theorems for the Picard iteration in cone metric spaces over a solid vector space. As an application, we provide a detailed convergence analysis of the Weierstrass iterative method for…

We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…

The first part is expository: it explains how finite fields may be used to prove theorems on infinite fields by a reduction mod p process. The second part gives a variant of P.Smith's fixed point theorem which applies in any characteristic.

The results in the paper are related to the classification problem for invariant subspaces of multiplication operators in several variables. The main results consist of characterizations, in the two dimensional case, of ideals of…

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…

We introduce a systematic approach for treating the large N limit of matrix field theories.

We provide an index bound for character sums of polynomials over finite fields. This improves the Weil bound for high degree polynomials with small indices, as well as polynomials with large indices that are generated by cyclotomic mappings…

We obtain lower bounds for the cardinality of $k$-fold sum-sets of reciprocals of elements of suitable defined short intervals in high degree extensions of finite fields. Combining our results with bounds for multilinear character sums we…

We describe a method to evaluate multivariate polynomials over a finite field and discuss its multiplicative complexity.