Related papers: On new sum-product type estimates
We develop a new method leading the structure of finite subsets S and T of an abelian group with $|S+T|\le |S|+|T|$. We show also how to recover the known results in this area in a relatively short space.
We give new equivalent characterizations for ideals of Borel type. Also, we prove that the regularity of a product of ideals of Borel type is bounded by the sum of the regularities of those ideals.
We show Lie algebra versions of some results on homological finiteness properties of subdirect products of groups, including a version of the 1-2-3 Theorem.
The special case of closed subsets of C^n is briefly discussed.
This paper introduces a deterministic algorithm for solving an instance of the Subset Sum Problem based on a new method entitled the Bipartite Synthesis Method. The algorithm is described and shown to have worst-case limiting performance…
Given a set (or multiset) S of n numbers and a target number t, the subset sum problem is to decide if there is a subset of S that sums up to t. There are several methods for solving this problem, including exhaustive search,…
In this paper, we consider the concept of limit, one of the basic concepts of mathematical analysis. At a point $a\in{\mathbb{R}}$, the limit of a function $f$ from $A\subset\mathbb{R}$ to $\mathbb{R}$ is $L\in{\mathbb{R}}$ if and only if…
In the paper we find new inequalities involving the intersections $A\cap (A-x)$ of shifts of some subset $A$ from an abelian group. We apply the inequalities to obtain new upper bounds for the additive energy of multiplicative subgroups and…
Given a large set $U$ where each item $a\in U$ has weight $w(a)$, we want to estimate the total weight $W=\sum_{a\in U} w(a)$ to within factor of $1\pm\varepsilon$ with some constant probability $>1/2$. Since $n=|U|$ is large, we want to do…
Based on new explicit estimates for the prime counting function, we improve the currently known estimates for the particular sequence $C_n = np_n - \sum_{k \leq n}p_k$, $n \geq 1$, involving the prime numbers.
In this paper we establish lower bounds on information divergence from a distribution to certain important classes of distributions as Gaussian, exponential, Gamma, Poisson, geometric, and binomial. These lower bounds are tight and for…
In recent literature there are an increasing number of papers where the forbidden sets of difference equations are computed. We review and complete different attempts to describe the forbidden set and propose new perspectives for further…
In this paper, we develop new optional stopping theorems for scenarios where the stopping rules are defined by bounded continuity regions. Moreover, we establish a wide variety of inequalities on the supremums and infimums of functions of…
We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…
We summarize some recent work on large-Nc sum rules.
We formulate uncertainty relations for arbitrary $N$ observables. Two uncertainty inequalities are presented in terms of the sum of variances and standard deviations, respectively. The lower bounds of the corresponding sum uncertainty…
Some new Gruss type inequalities in inner product spaces and applications for integrals are given.
Using elementary methods, we establish old and new relations between binomial coefficients, Fibonacci numbers, Lucas numbers, and more.
We study a family of variants of Erd\H os' unit distance problem, concerning distances and dot products between pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, we look for…
We discuss some aspects of the theory of subelliptic estimates.