Related papers: A Generalisation on Erd\H{o}s Distinct Subset Sums…
In this paper, we deal with an elliptic problem with the Dirichlet boundary condition. We operate in Sobolev spaces and the main analytic tool we use is the Lax-Milgram lemma. First, we present the variational approach of the problem which…
Motivated by intuitions from projective algebraic geometry, we provide a novel construction of subsets of the $d$-dimensional grid $[n]^d$ of size $n - o(n)$ with no $d + 2$ points on a sphere or a hyperplane. For $d = 2$, this improves the…
We give a sharpened form of Siegel Lemma's w. r. t. the maximum norm. This implies a new lower bound on the greatest element of a sum-distinct set of positive integers (Erd\"os-Moser problem). The main tools are Minkowski's theorem on…
Consider the following parameterized counting variation of the classic subset sum problem, which arises notably in the context of higher homotopy groups of topological spaces: Let $\mathbf{v} \in \mathbb{Q}^d$ be a rational vector, $(T_{1},…
Whether the 3D incompressible Euler equations can develop a singularity in finite time from smooth initial data is one of the most challenging problems in mathematical fluid dynamics. This work attempts to provide an affirmative answer to…
We explore some properties of the conditional distribution of an i.i.d. sample under large exceedances of its sum. Thresholds for the asymptotic independance of the summands are observed, in contrast with the classical case when the…
General results on convex bodies are reviewed and used to derive an exact closed-form parametric formula for the boundary of the geometric (Minkowski) sum of $k$ ellipsoids in $n$-dimensional Euclidean space. Previously this was done…
General results on convex bodies are reviewed and used to derive an exact closed-form parametric formula for the boundary of the geometric (Minkowski) sum of $k$ ellipsoids in $n$-dimensional Euclidean space. Previously this was done…
A given subset $A$ of natural numbers is said to be complete if every element of $\N$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete. The main goal of…
Estimation is the computational task of recovering a hidden parameter $x$ associated with a distribution $D_x$, given a measurement $y$ sampled from the distribution. High dimensional estimation problems arise naturally in statistics,…
Deviation of ergodic sums is studied for substitution dynamical systems with a matrix that admits eigenvalues of modulus 1. We consider the corresponding eigenfunctions, and in Theorem 1.1 we prove that the limit inferior of the ergodic…
Discretizations of differential equations are often studied through their modified equation. This is a differential equation, usually obtained as a power series, with solutions that exactly interpolate the discretization. By comparing the…
Recent advances in quantitative unique continuation properties for solutions to uniformly elliptic, divergence form equations (with Lipschitz coefficients) has led to a good understanding of the vanishing order and size of singular and zero…
We show that if $\lambda_1,\ldots,\lambda_k$ are algebraic numbers, then $$|A+\lambda_1\cdot A+\dots+\lambda_k\cdot A|\geq H(\lambda_1,\ldots,\lambda_k)|A|-o(|A|)$$ for all finite subsets $A$ of $\mathbb{C}$, where…
Under Poincar\'e-type conditions, upper bounds are explored for the Kolmogorov distance between the distributions of weighted sums of dependent summands and the normal law. Based on improved concentration inequalities on high-dimensional…
The Erd\H{o}s-Kac theorem is a celebrated result in number theory which says that the number of distinct prime factors of a uniformly chosen random integer satisfies a central limit theorem. In this paper, we establish the large deviations…
We apply the resonance method to obtain large values of general exponential sums with positive coefficients. As applications, we show improved $\Omega$-bounds for Dirichlet and Piltz divisor problems, Gauss circle Problem, and error term…
We consider the distinct elements problem, where the goal is to estimate the number of distinct colors in an urn containing $ k $ balls based on $n$ samples drawn with replacements. Based on discrete polynomial approximation and…
We introduce methods to bound the mean of a discrete distribution (or finite population) based on sample data, for random variables with a known set of possible values. In particular, the methods can be applied to categorical data with…
The Stochastic Extragradient (SEG) method is one of the most popular algorithms for solving min-max optimization and variational inequalities problems (VIP) appearing in various machine learning tasks. However, several important questions…