English
Related papers

Related papers: Combinatorial Nullstellensatz Approach to Polynomi…

200 papers

An inverse polynomial has a Chebyshev series expansion 1/\sum(j=0..k)b_j*T_j(x)=\sum'(n=0..oo) a_n*T_n(x) if the polynomial has no roots in [-1,1]. If the inverse polynomial is decomposed into partial fractions, the a_n are linear…

Classical Analysis and ODEs · Mathematics 2016-09-07 Richard J. Mathar

Building on work of Kuhlmann and Lisinski, we study the theory of the Hahn series field $\mathbb{F}_{q}(\!(\mathbb{Q})\!)$, over a finite field $\mathbb{F}_{q}$, equipped with the $t$-adic valuation, in a language of valued fields. We prove…

Logic · Mathematics 2026-04-30 Sylvy Anscombe , Blaise Boissonneau

It is shown that by eliminating duality theory of vector spaces from a recent proof of Kouba (O. Kouba, A duality based proof of the Combinatorial Nullstellensatz. Electron. J. Combin. 16 (2009), #N9) one obtains a direct proof of the…

Commutative Algebra · Mathematics 2011-07-28 Peter Christian Heinig

We determine which quadratic polynomials in three variables are expanders over an arbitrary field $\mathbb{F}$. More precisely, we prove that for a quadratic polynomial $f\in \mathbb{F}[x,y,z]$, which is not of the form $g(h(x)+k(y)+l(z))$,…

Combinatorics · Mathematics 2017-02-27 Thang Pham , Le Anh Vinh , Frank de Zeeuw

We classify the polynomials $f(x,y) \in \mathbb R[x,y]$ such that given any finite set $A \subset \mathbb R$ if $|A+A|$ is small, then $|f(A,A)|$ is large. In particular, the following bound holds : $|A+A||f(A,A)| \gtrsim |A|^{5/2}.$ The…

Classical Analysis and ODEs · Mathematics 2009-12-30 Chun-Yen Shen

We prove a noncommutative real Nullstellensatz for 2-step nilpotent Lie algebras that extends the classical, commutative real Nullstellensatz as follows: Instead of the real polynomial algebra $\mathbb R[x_1, \dots, x_d]$ we consider the…

Algebraic Geometry · Mathematics 2024-10-08 Philipp Schmitt , Matthias Schötz

The objective of this paper is the proof of a conjecture of Kontsevich on the isomorphism between groups of polynomial symplectomorphisms and automorphisms of the corresponding Weyl algebra in characteristic zero. The proof is based on the…

Algebraic Geometry · Mathematics 2020-12-03 Alexei Kanel-Belov , Andrey Elishev , Jie-Tai Yu

For any real numbers $B \ge 1$ and $\delta \in (0, 1)$ and function $f: [0, B] \rightarrow \mathbb{R}$, let $d_{B; \delta} (f) \in \mathbb{Z}_{> 0}$ denote the minimum degree of a polynomial $p(x)$ satisfying $\sup_{x \in [0, B]} \big| p(x)…

Computational Complexity · Computer Science 2022-05-13 Amol Aggarwal , Josh Alman

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

Let $f$ be a polynomial with integer coefficients such that $f(n)$ positive for any positive integer $n$. We consider diverging sequences $\{ y_n\}$ given by $y_0 = b$ and $y_{n+1} = f^{y_n}(a)$ with positive integers $a$ and $b$. We show…

Number Theory · Mathematics 2022-11-30 Rin Gotou

We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…

Number Theory · Mathematics 2025-03-04 Nicolae Ciprian Bonciocat , Rishu Garg , Jitender Singh

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…

Information Theory · Computer Science 2017-07-06 Olav Geil , Umberto Martínez-Peñas

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

Commutative Algebra · Mathematics 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

We consider quantum interpolation of polynomials. We imagine a quantum computer with black-box access to input/output pairs (x_i, f(x_i)), where f is a degree-d polynomial, and we wish to compute f(0). We give asymptotically tight quantum…

Quantum Physics · Physics 2010-03-19 Daniel M. Kane , Samuel A. Kutin

Hilbert's Nullstellensatz is a fundamental result in algebraic geometry that gives a necessary and sufficient condition for a finite collection of multivariate polynomials to have a common zero in an algebraically closed field. Associated…

Computational Complexity · Computer Science 2024-10-22 Rida Ait El Manssour , Nikhil Balaji , Klara Nosan , Mahsa Shirmohammadi , James Worrell

We determine the factorization of X*f(X)-Y*g(Y) over K[X,Y] for all squarefree additive polynomials f,g in K[X] and all fields K of odd characteristic. This answers a question of Kaloyan Slavov, who needed these factorizations in connection…

Number Theory · Mathematics 2014-07-18 Michael E. Zieve

This brief note corrects some errors in the paper quoted in the title, highlights a combinatorial result which may have been overlooked, and points to further improvements in recent literature.

Algebraic Geometry · Mathematics 2008-02-03 J. Maurice Rojas

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

Computational Complexity · Computer Science 2014-08-19 Robert L. Surowka , Kenneth W. Regan

We prove a new Elekes-Szab\'o type estimate on the size of the intersection of a Cartesian product $A\times B\times C$ with an algebraic surface $\{f=0\}$ over the reals. In particular, if $A,B,C$ are sets of $N$ real numbers and $f$ is a…

Combinatorics · Mathematics 2024-02-27 Jozsef Solymosi , Joshua Zahl

The purpose of this work is to present the derivation and an estimate of the degrees of the best approximation based on convex, coconvex and unconstrained polynomials, and discuss some applications. We simplify the term convex and coconvex…

Functional Analysis · Mathematics 2020-05-19 Malik Saad Al-Muhja , Habibulla Akhadkulov , Nazihah Ahmad
‹ Prev 1 3 4 5 6 7 10 Next ›