Related papers: Representation of integers by sparse binary forms

We consider following geometric Ramsey problem: find the least dimension $n$ such that for any 2-coloring of edges of complete graph on the points $\{\pm 1\}^n$ there exists 4-vertex coplanar monochromatic clique. Problem was first analyzed…

We introduce the binary value principle which is a simple subset-sum instance expressing that a natural number written in binary cannot be negative, relating it to central problems in proof and algebraic complexity. We prove conditional…

In this paper we introduce the class of infinite infimal convolution functionals and apply these functionals to the regularization of ill-posed inverse problems. The proposed regularization involves an infimal convolution of a continuously…

We give an upper bound for the norm of the determinant of additively indecomposable, totally positive definite quadratic forms defined over the ring of integers of totally real number fields. We apply these results to find lower and upper…

We establish the existence of weak solutions of a nonlinear radiation-type boundary value problem for elliptic equation on divergence form with discontinuous leading coefficient. Quantitative estimates play a crucial role on the real…

We present the framework of slowly varying regression under sparsity, allowing sparse regression models to exhibit slow and sparse variations. The problem of parameter estimation is formulated as a mixed-integer optimization problem. We…

In 1977 Montgomery and Vaughan gave tight bounds for exponential sums of the form $\sum_{n\leq x}f(n)e(n\alpha)$ where $f$ is a $1$-bounded multiplicative function and $\alpha\in\mathbb R$, close to the conjectured $\ll \frac{x}{\sqrt{q}}+…

We establish uniform bounds on the multiplicities of irreducible admissible representations appearing in spaces of functions on symmetric spaces over $p$-adic fields. These multiplicities can exceed one and depend intricately on the group,…

Motivated by the need to better understand the properties of sparse cutting-planes used in mixed integer programming solvers, the paper [2] studied the idealized problem of how well a polytope is approximated by the use of sparse valid…

Consider the discrete cubic Hilbert transform defined on finitely supported functions $f$ on $\mathbb{Z}$ by \begin{eqnarray*} H_3f(n) = \sum_{m \not = 0} \frac{f(n- m^3)}{m}. \end{eqnarray*} We prove that there exists $r <2$ and universal…

In this sequence, we first prove an abstract Morse index theorem in a Hilbert space modeling a variational problem with constraints. Then, our abstract formulation is applied to study several optimization setups including closed CMC…

In this paper, we study binary constrained codes that are resilient to bit-flip errors and erasures. In our first approach, we compute the sizes of constrained subcodes of linear codes. Since there exist well-known linear codes that achieve…

We fix a gap in our proof of an upper bound for the number of positive integers $n\le x$ for which the Euler function $\varphi(n)$ has all prime factors at most $y$. While doing this we obtain a stronger, likely best-possible result.

Let A be a set of integers and let h \geq 2. For every integer n, let r_{A, h}(n) denote the number of representations of n in the form n=a_1+...+a_h, where a_1,...,a_h belong to the set A, and a_1\leq ... \leq a_h. The function r_{A,h}…

We prove the Hasse principle and weak approximation for varieties defined over number fields by the nonsingular intersection of pairs of quadratic forms in 8 variables. The argument develops work of Colliot-Thelene, Sansuc and…

A tantalizing open problem, posed independently by Stiebitz in 1995 and by Alon in 2006, asks whether for every pair of integers $s,t \ge 1$ there exists a finite number $F(s,t)$ such that the vertex set of every digraph of minimum…

In this paper, we investigate the symmetry properties of a variable coefficient nonlinear space-time fractional Burgers' equation. Fractional Lie symmetries and corresponding infinitesimal generators are obtained. With the help of the…

Many NP-complete problems take integers as part of their input instances. These input integers are generally binarized, that is, provided in the form of the "binary" numeral representation, and the lengths of such binary forms are used as a…

In many applications, one is faced with an inverse problem, where the known signal depends in a bilinear way on two unknown input vectors. Often at least one of the input vectors is assumed to be sparse, i.e., to have only few non-zero…

Let $r$ be a sufficiently large positive integer, and let $N \ge \exp\exp(r^{50})$. Then any $r$-colouring of $[N]$ contains a monochromatic copy of $\{x+y,xy\}$ with $x > y > 2$.