English
Related papers

Related papers: Combinatorial Nullstellensatz Techniques

200 papers

We give upper bounds for the differential Nullstellensatz in the case of ordinary systems of differential algebraic equations over any field of constants $K$ of characteristic $0$. Let $\vec{x}$ be a set of $n$ differential variables,…

Commutative Algebra · Mathematics 2014-01-14 Lisi D'Alfonso , Gabriela Jeronimo , Pablo Solernó

A new method of algebraic nature is proposed for the study of the asymptotic properties of special polynomials. The technique we foresee is based on the use of umbral operators, allowing a unified treatment of a large body of polynomial…

Classical Analysis and ODEs · Mathematics 2020-02-18 G. Dattoli , S. Licciardi , R. M. Pidatella , E. Sabia

A variant of the Archimedean Positivstellensatz is proved which is based on Archimedean semirings or quadratic modules of generating subalgebras. It allows one to obtain representations of strictly positive polynomials on compact…

Algebraic Geometry · Mathematics 2024-01-18 Konrad Schmüdgen

We study the globalization of partial actions on sets and topological spaces and of partial coactions on algebras by applying the general theory of globalization for geometric partial comodules, as previously developed by the authors. We…

Rings and Algebras · Mathematics 2022-03-31 Paolo Saracco , Joost Vercruysse

In 2005, Kayal suggested that Schoof's algorithm for counting points on elliptic curves over finite fields might yield an approach to factor polynomials over finite fields in deterministic polynomial time. We present an exposition of his…

Number Theory · Mathematics 2017-10-04 Bjorn Poonen

We bound double sums of Kloosterman sums over a finite field ${\mathbb F}_{q}$, with one or both parameters ranging over an affine space over its prime subfield ${\mathbb F}_p \subseteq {\mathbb F}_{q} $. These are finite fields analogues…

Number Theory · Mathematics 2019-03-26 Simon Macourt , Igor E. Shparlinski

We build a variant of Collatz Conjecture for polynomials over $\mathbb{F}_2$ and we prove that it is solved. By the way, we give several examples.

Number Theory · Mathematics 2023-09-01 Luis H. Gallardo , Olivier Rahavandrainy

We use the ideas of symplectic quantization for quantizing fields in finite volumes. We consider, as examples, the Klein-Gordon and electromagnetic fields in three dif- ferent boxes. As a second idea we consider the given boundary…

High Energy Physics - Theory · Physics 2013-11-05 S. Chenarani , A. Shirzad

We present a uniform framework for establishing Nullstellens\"atze for power series rings using quantifier elimination results for valued fields. As an application we obtain Nullstellens\"atze for $p$-adic power series (both formal and…

Logic · Mathematics 2024-03-11 Matthias Aschenbrenner , Ahmed Srhir

In this paper we study some iterative methods for simultaneous approximation of polynomial zeros. We give new semilocal convergence theorems with error bounds for Ehrlich's and Nourein's iterations. Our theorems generalize and improve…

Numerical Analysis · Mathematics 2007-09-10 Petko D. Proinov

In this work we develop the theory of Gr\"obner bases for modules over the ring of univariate linearized polynomials with coefficients from a finite field.

Symbolic Computation · Computer Science 2014-06-19 Margreta Kuijper , Anna-Lena Trautmann

The Bernstein polynomial basis sees significant use owing to its unique properties, particularly in the field of optimal control. However, the basis is known to have a slow rate of convergence to the function it approximates. With this in…

Optimization and Control · Mathematics 2025-09-15 Maxwell Hammond , Gage MacLin , Laurent Jay , Venanzio Cichella

In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…

Group Theory · Mathematics 2007-05-23 Zhi-Wei Sun

Combinatorial methods (or methods of elementary transformations) came to group theory from low-dimensional topology in the beginning of the century. Soon after that, combinatorial group theory became an independent area with its own…

Group Theory · Mathematics 2009-09-25 Vladimir Shpilrain

C-holomorphic functions defined on algebraic sets and having algebraic graphs can be considered as a complex counterpart of regulous functions introduced recently in real geometry. This note is a part of our study on the subject; we prove…

Algebraic Geometry · Mathematics 2020-05-12 Adam Białożyt , Maciej P. Denkowski , Piotr Tworzewski

By using the squared slack variables technique, we demonstrate that the solution set of a general polynomial complementarity problem is the image, under a specific projection, of the set of real zeroes of a system of polynomials. This paper…

Optimization and Control · Mathematics 2025-07-01 Vu Trung Hieu , Alfredo Noel Iusem , Paul Hugo Schmölling , Akiko Takeda

In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…

Classical Analysis and ODEs · Mathematics 2016-02-10 Omran Kouba

We use the stabilization functors to study the combinatorial aspects of the $F$-polynomial of a representation of any finite-dimensional basic algebra. We characterize the vertices of their Newton polytopes. We give an explicit formula for…

Representation Theory · Mathematics 2021-08-04 Jiarui Fei

Jurij Vol\v{c}i\v{c} conjectured that a noncommutative polynomial $g$ belongs to the unital $\mathbb{K}$-algebra generated by finitely many noncommutative polynomials if and only if, for matrices of every size, every joint invariant…

Rings and Algebras · Mathematics 2026-02-27 Sizhuo Yan , Jianting Yang , Lihong Zhi

Using various results from extremal set theory (interpreted in the language of additive combinatorics), we prove an asyptotically sharp version of Freiman's theorem in F_2^n: if A in F_2^n is a set for which |A + A| <= K|A| then A is…

Combinatorics · Mathematics 2007-05-23 Ben Green , Terence Tao