English
Related papers

Related papers: On integer solutions of Parsell-Vinogradov systems

200 papers

In this paper we derive an upper bound for the degree of the strict invariant algebraic curve of a polynomial system in the complex project plane under generic condition. The results are obtained through the algebraic multiplicities of the…

Classical Analysis and ODEs · Mathematics 2023-09-29 Jinzhi Lei , Lijun Yang

Let Q be a non-singular diagonal quadratic form in at least four variables. We provide upper bounds for the number of integer solutions to the equation Q=0, which lie in a box with sides of length 2B, as B tends to infinity. The estimates…

Number Theory · Mathematics 2007-05-23 T. D. Browning

Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…

Rings and Algebras · Mathematics 2009-12-08 Marla Slusky

We give upper and lower bounds for the number of rational points on Prym varieties over finite fields. Moreover, we determine the exact maximum and minimum number of rational points on Prym varieties of dimension 2.

Algebraic Geometry · Mathematics 2013-07-15 Yves Aubry , Safia Haloui

An upper bound on degrees of elements of a minimal generating system for invariants of quivers of dimension (2,...,2) is established over a field of arbitrary characteristic and its precision is estimated. The proof is based on the…

Rings and Algebras · Mathematics 2011-07-13 A. A. Lopatin

Given a linear equation of the form $a_1x_1 + a_2x_2 + a_3x_3 = 0$ with integer coefficients $a_i$, we are interested in maximising the number of solutions to this equation in a set $S \subseteq \mathbb{Z}$, for sets $S$ of a given size. We…

Combinatorics · Mathematics 2019-05-06 James Aaronson

An approach is proposed for bounding the number of zeros that solutions of linear differential systems with polynomial coefficients may have. A bound is obtained in a special case which improves upon currently existing.

Dynamical Systems · Mathematics 2007-05-23 Alexei Grigoriev

We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…

Number Theory · Mathematics 2025-08-26 Rachel Greenfeld , Marina Iliopoulou , Sarah Peluse

We study the maximal number of pairwise distinct columns in a $\Delta$-modular integer matrix with $m$ rows. Recent results by Lee et al. provide an asymptotically tight upper bound of $O(m^2)$ for fixed $\Delta$. We complement this and…

Combinatorics · Mathematics 2022-07-12 Gennadiy Averkov , Matthias Schymura

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…

Computational Geometry · Computer Science 2026-03-20 Alexander Munteanu , Simon Omlor , Jeff M. Phillips

The present work includes some of the author's original researches on integer solutions of Diophantine liner equations and systems. The notion of "general integer solution" of a Diophantine linear equation with two unknowns is extended to…

General Mathematics · Mathematics 2007-11-28 Florentin Smarandache

In this article, we obtain an upper bound for the number of integral points on the del Pezzo surfaces of degree two.

Number Theory · Mathematics 2020-10-30 Aritra Ghosh , Sumit Kumar , Kummari Mallesham , Saurabh Kumar Singh

Let P denote the set of all primes. Suppose that P_1, P_2, P_3 are three subsets of P with the sum of their lower densities relative to P is greater than 2. We prove that for sufficiently large odd integer n, there exist p_i\in P_i such…

Number Theory · Mathematics 2008-12-06 Hongze Li , Hao Pan

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…

Commutative Algebra · Mathematics 2021-08-31 Wei Li , Alexey Ovchinnikov , Gleb Pogudin , Thomas Scanlon

Let f(1)=1, and let f(n+1)=2^{2^{f(n)}} for every positive integer n. We conjecture that if a system S \subseteq {x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} \cup {x_i+1=x_k: i,k \in {1,...,n}} has only finitely many solutions in non-negative…

Number Theory · Mathematics 2018-08-20 Apoloniusz Tyszka

We obtain a good upper bound on the number of solutions of a diophantine equation arising from a strictly convex sequences of real numbers.

Combinatorics · Mathematics 2007-05-23 A. Iosevich , M. Rudnev , V. Ten

In this paper, we solve a maximization problem where the objective function is quadratic and the constraints set is the reachable values set of a stable discrete-time affine system. This problem is equivalent to solve an infinite number of…

Optimization and Control · Mathematics 2023-09-04 Assalé Adjé

We prove an upper bound on the degree complexity of Putinar's Positivstellensatz. This bound is much worse than the one obtained previously for Schm\"udgen's Positivstellensatz but it depends on the same parameters. As a consequence, we get…

Algebraic Geometry · Mathematics 2008-12-16 Jiawang Nie , Markus Schweighofer

We discuss, in the context of inverse linear problems in Hilbert space, the notion of the associated infinite-dimensional Krylov subspace and we produce necessary and sufficient conditions for the Krylov-solvability of a given inverse…

Numerical Analysis · Mathematics 2019-08-28 Noe Caruso , Alessandro Michelangeli , Paolo Novati

We study the Cauchy problem for the Zakharov system in one space dimension with the Diriclet boundary conditions. We establish the global well-posedness and the growth of higher-order Sobolev norms of solutions to the Zakharov system by…

Analysis of PDEs · Mathematics 2024-03-27 Nobutatsu Kobayashi