English
Related papers

Related papers: Counting points on bilinear and trilinear hypersur…

200 papers

In this paper, we will give a uniform upper bound of the number of rational points of bounded height in non-singular curves by applying the global determinant method.

Number Theory · Mathematics 2024-03-20 Chunhui Liu

Let $A$ be an $(m \times n)$ integral matrix, and let $P=\{ x : A x \leq b\}$ be an $n$-dimensional polytope. The width of $P$ is defined as $ w(P)=min\{ x\in \mathbb{Z}^n\setminus\{0\} :\: max_{x \in P} x^\top u - min_{x \in P} x^\top v…

Computational Geometry · Computer Science 2022-11-30 Dmitry Gribanov , Sergey Veselov

Let f be a polinomial with coefficients in a finite field F. Let $\Psi : F \to C^{\ast}$ be a non-trivial additive character. In this paper we give bounds for the exponential sums $\sum_{x\in F^n} \Psi (Tr_{F/F_p} (f(x)))$ in some cases…

alg-geom · Mathematics 2008-02-03 Ricardo Garcia Lopez

Let $ T_{P } f (x) = \int e ^{i P (y)} K (y) f (x-y) \; dy $, where $ K (y)$ is a smooth Calder\'on-Zygmund kernel on $ \mathbb R ^{n}$, and $ P$ be a polynomial. We show that there is a sparse bound for the bilinear form $ \langle T_P f, g…

Classical Analysis and ODEs · Mathematics 2017-01-06 Michael T. Lacey , Scott Spencer

Consider an absolutely irreducible polynomial $F(Y,X_1,\ldots,X_n) \in \mathbb{Z}[Y,X_1,\ldots,X_n]$ that is monic in $Y$ and is a polynomial in $Y^m$ for an integer $m \geq 1$. Let $N(F,B)$ count the number of $\mathbf{x} \in [-B,B]^n \cap…

Number Theory · Mathematics 2025-05-19 Dante Bonolis , Lillian B. Pierce , Katharine Woo

We determine upper bounds on the number of rational points of an affine or projective algebraic set defined over an extension of a finite field by a system of polynomial equations, including the case where the algebraic set is not defined…

Algebraic Geometry · Mathematics 2014-07-28 Gilles Lachaud , Robert Rolland

For a large class (heuristically most) of irreducible binary cubic forms $F(x,y) \in \mathbb Z[x,y]$, Bennett and Dahmen proved that the generalized superelliptic equation $F(x,y)=z^l$ has at most finitely many solutions in $x,y \in \mathbb…

Number Theory · Mathematics 2020-04-20 George Catalin Turcas

Let P(x,y) be a rational polynomial and k in Q be a generic value. If the curve (P(x,y)=k) is irreducible and admits an infinite number of points whose coordinates are integers then there exist algebraic automorphisms that send P(x,y) to…

Algebraic Geometry · Mathematics 2014-02-26 Arnaud Bodin

Conditions for the existence of at least three positive solutions to the nonlinear first-order problem with a nonlinear nonlocal boundary condition given by && y'(t) - p(t)y(t) = \sum_{i=1}^m f_i\big(t,y(t)\big), \quad t\in[0,1], && \lambda…

Classical Analysis and ODEs · Mathematics 2012-07-23 Douglas R. Anderson

We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…

Algebraic Geometry · Mathematics 2015-09-22 Saugata Basu , Martin Sombra

We study integer-valued matrices with bounded determinants. Such matrices appear in the theory of integer programs (IP) with bounded determinants. For example, Artmann et al. showed that an IP can be solved in strongly polynomial time if…

Optimization and Control · Mathematics 2022-11-17 Jon Lee , Joseph Paat , Ingo Stallknecht , Luze Xu

In this paper we use matrices, whose entries satisfy certain linear conditions, to obtain composition identities $f(x_i)f(y_i)=f(z_i)$, where $f(x_i)$ is an irreducible form, with integer coefficients, of degree $n$ in $n$ variables ($n$…

Number Theory · Mathematics 2020-05-18 Ajai Choudhry

We give a new bound on the number of collinear triples for two arbitrary subsets of a finite field. This improves on existing results which rely on the Cauchy inequality. We then us this to provide a new bound on trilinear and quadrilinear…

Number Theory · Mathematics 2017-09-01 Simon Macourt

We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…

Combinatorics · Mathematics 2025-10-31 Dominique Maldague , Hong Wang , Dmitrii Zakharov

Let $B$ be a bilinear form on pairs of points in the complex plane, of the form $B(p,q) = p^TMq$, for an invertible $2\times2$ complex matrix $M$. We prove that any finite set $S$ contained in an irreducible algebraic curve $C$ of degree…

Metric Geometry · Mathematics 2015-02-24 Claudiu Valculescu , Frank de Zeeuw

Let $f$ be a polynomial in $n$ variables $x_1,\dots,x_n$ with real coefficients. In [Ghasemi-Marshal], Ghasemi and Marshall give an algorithm, based on geometric programming, which computes a lower bound for $f$ on $\mathbb{R}^n$. In…

Optimization and Control · Mathematics 2025-10-06 Mehdi Ghasemi , Murray Marshall

Let $f(x) = \sum\limits _{i=0}^{n} a_i x^i $ be a polynomial with coefficients from the ring $\mathbb{Z}$ of integers satisfying either $(i)$ $0 < a_0 \leq a_{1} \leq \cdots \leq a_{k-1} < a_{k} < a_{k+1} \leq \cdots \leq a_n$ for some $k$,…

Commutative Algebra · Mathematics 2016-12-07 Anuj Jakhar , Neeraj Sangwan

A thorough analysis is made of the Fourier coefficients for vector-valued modular forms associated to three-dimensional irreducible representations of the modular group. In particular, the following statement is verified for all but a…

Number Theory · Mathematics 2015-04-01 Christopher Marks

Starting with an infinite set of non linear Equations for the Li-Keiper coefficients, we first specify a lower bound emerging from the infinite set and give a characterization of it. Then, we propose a possible new upper and lower bound for…

General Mathematics · Mathematics 2020-12-16 Merlini Danilo , Sala Massimo , Sala Nicoletta

We provide upper bounds for the sum of the multiplicities of the non-constant irreducible factors that appear in the canonical decomposition of a polynomial $f(X)\in\mathbb{Z}[X]$, in case all the roots of $f$ lie inside an Apollonius…