Related papers: Representation of integers by sparse binary forms

Given a primitive collection of vectors in the integer lattice, we count the number of ways it can be extended to a basis by vectors with sup-norm bounded by $T$, producing an asymptotic estimate as $T \to \infty$. This problem can be…

In this paper we characterize sparse solutions for variational problems of the form $\min_{u\in X} \phi(u) + F(\mathcal{A} u)$, where $X$ is a locally convex space, $\mathcal{A}$ is a linear continuous operator that maps into a finite…

For each $ d \geq 2$, the Hilbert transform with a polynomial oscillation as below satisfies a $ (1, r )$ sparse bound, for all $ r>1$ $$ H _{ \ast } f (x) = \sup _{\epsilon } \Bigl\lvert \int_{|y| > \epsilon} f (x-y) \frac { e ^{2 \pi i y…

We revisit a work by R. Okazaki and prove that for every cubic binary form F(x, y) with large enough discriminant, the Thue equation |F(x, y)| = 1 has at most 7 solutions in integers x and y.

We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…

We estimate the number of integer solutions to decomposable form inequalities (both asymptotic estimates and upper bounds are provided) when the degree of the form and the number of variables are relatively prime. These estimates display…

Let $\varphi(x_1,\ldots,x_h,y) = u_1x_1 + \cdots + u_hx_h+vy$ be a linear form with nonzero integer coefficients $u_1,\ldots, u_h, v.$ Let $\mathcal{A} = (A_1,\ldots, A_h)$ be an $h$-tuple of finite sets of integers and let $B$ be an…

We obtain bounds on fractional parts of binary forms of the shape $$\Psi(x,y)=\alpha_k x^k+\alpha_l x^ly^{k-l}+\alpha_{l-1}x^{l-1}y^{k-l+1}+\cdots+\alpha_0 y^k$$ with $\alpha_k,\alpha_l,\ldots,\alpha_0\in\mathbb{R}$ and $l\leq k-2.$ By…

Let $F_1,\dotsc,F_R$ be quadratic forms with integer coefficients in $n$ variables. When $n\geq 9R$ and the variety $V(F_1,\dotsc,F_R)$ is a smooth complete intersection, we prove an asymptotic formula for the number of integer points in an…

Given a negative $D>-(\log X)^{\log 2-\delta}$, we give a new upper bound on the number of square free integers $<X$ which are represented by some but not all forms of the genus of a primitive positive definite binary quadratic form $f$ of…

In a series of papers we investigated the following question: given a family $\calF$ of binary forms having nonzero discriminant and integer coefficients, for each $d\geqslant 3$, we estimate the number of integers $m$ with $|m|\leqslant N$…

We extend our previous results on the number of integers which are values of some cyclotomic form of degree larger than a given value (see \cite{FW1}), to more general families of binary forms with integer coefficients. Our main ingredient…

Let Q be a non-singular quadratic form with integer coefficients. When Q is indefinite we provide new upper bounds for the least non-trivial integral solution to the equation Q=0. When Q is positive definite we provide improved upper bounds…

Let $\psi$ and $F$ be positive definite forms with integral coefficients of equal degree. Using the circle method, we establish an asymptotic formula for the number of identical representations of $\psi$ by $F$, provided $\psi$ is…

We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer…

In this paper, we study the number of integer pair solutions to the equation $|F(x,y)| = 1$ where $F(x,y) \in \mathbb{Z}[x,y]$ is an irreducible (over $\mathbb{Z}$) binary form with degree $n \geqslant 3$ and exactly three nonzero summands.…

We consider hyper- and superelliptic equations $f(x)=by^m$ with unknowns x,y from the ring of S-integers of a given number field K. Here, f is a polynomial with S-integral coefficients of degree n with non-zero discriminant and b is a…

We introduce the concept of negative coefficients in various number-based systems, with a focus on decimal and binary systems. We demonstrate that every binary number can be transformed into a sparse form, significantly enhancing…

Let $r,h\in\mathbb{N}$ with $r\geq 7$ and let $F(x,y)\in \mathbb{Z}[x ,y]$ be a binary form such that \[ F(x , y) =(\alpha x + \beta y)^r -(\gamma x + \delta y)^r, \] where $\alpha$, $\beta$, $\gamma$ and $\delta$ are algebraic constants…

We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…