Related papers: A Generalisation on Erd\H{o}s Distinct Subset Sums…

In this paper, we consider certain finite sums related to the "largest odd divisor", and we obtain, using simple ideas and recurrence relations, sharp upper and lower bounds for these sums.

We obtain a substantially improved lower bound for the minimum overlap problem asked by Erd\H{o}s. Our approach uses elementary Fourier analysis to translate the problem to a convex optimization program.

In this paper, we analyze the set of all possible aggregate distributions of the sum of standard uniform random variables, a simply stated yet challenging problem in the literature of distributions with given margins. Our main results are…

We describe a new method to bound certain higher-dimensional exponential sums which are associated with tori in symplectic groups over finite fields. Our method is based on the self-reducibility property of the Weil representation. As a…

Let $\{X_{i}, i\in J\}$ be a family of locally dependent non-negative integer-valued random variables with finite expectations and variances. We consider the sum $W=\sum_{i\in J}X_i$ and use Stein's method to establish general upper error…

Higher-dimensional Dedekind sums are defined as a generalization of a recent 1-dimensional probability model of Dilcher and Girstmair to a d-dimensional cube. The analysis of the frequency distribution of marked lattice points leads to new…

We study several variants of Euler sums by using the methods of contour integration and residue theorem. These variants exhibit nice properties such as closed forms, reduction, etc., like classical Euler sums. In addition, we also define a…

We present new, faster pseudopolynomial time algorithms for the $k$-Subset Sum problem, defined as follows: given a set $Z$ of $n$ positive integers and $k$ targets $t_1, \ldots, t_k$, determine whether there exist $k$ disjoint subsets…

We address the "sums of dilates problem" by looking for non-trivial lower bounds on sumsets of the form $k \cdot X + l \cdot X$, where $k$ and $l$ are non-zero integers and $X$ is a subset of a possibly non-abelian group $G$ (written…

This paper re-examines the density for sums of independent exponential, Erlang and gamma random variables. By using a divided difference perspective, the paper provides a unified approach to finding closed-form formulae for such…

We introduce a concept called refinement and develop two different ways of refining metrics. By applying these methods we produce several refinements of the shortest-path distance on the collaboration graph and hence a couple new versions…

We prove a version of the Erd\H{o}s--Beck Theorem from discrete geometry for fractal sets in all dimensions. More precisely, let $X\subset \mathbb{R}^n$ Borel and $k \in [0, n-1]$ be an integer. Let $\dim (X \setminus H) = \dim X$ for every…

We study the parabolic variant of the Erd\H os--Falconer distance problem in finite fields. That is, if $q$ is odd, we seek size thresholds beyond which any subset $E\subset \mathbb F_q^2$ will determine many distinct parabolic distances.…

In this paper we suggest analytical methods and associated algorithms for determining the sum of the subsets $X_m$ of the set $X_n$ (subset sum problem). Our algorithm has time complexity $T=O(C_{n}^{k})$ ($k=[m/2]$, which significantly…

In this paper the structures of the generalised Euler-Lagrange equations and their associated conserved quantities are derived for one-dimensional Herglotz variational problems of order $n$. Their derivations use the framework of moving…

We generalize several classical theorems in extremal combinatorics by replacing a global constraint with an inequality which holds for all objects in a given class. In particular we obtain generalizations of Tur\'an's theorem, the…

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…

Additive combinatorics asks for lower bounds on sumsets and restricted sumsets over finite fields. Central examples are the Cauchy-Davenport theorem and the Erd\H{o}s-Heilbronn conjecture. In this note, we develop Das's linear algebraic…

This note is a continuation of an earlier paper by the authors. We describe improved constructions addressing a question of Erd\H{o}s and Szemer\'edi on sums and products of real numbers along the edges of a graph. We also add a few…

Inspired by the Erd\H{o}s' problem in Ramsey theory, we propose a dynamical version of the problem and answer it positively for circle maps.