Related papers: Compression and complexity for sumset sizes in add…

A $k$-configuration is a collection of $k$ distinct integers $x_1,\ldots,x_k$ together with their pairwise arithmetic means $\frac{x_i+x_j}{2}$ for $1 \leq i < j \leq k$. Building on recent work of Filmus, Hatami, Hosseini and Kelman on…

With the development of low order scaling methods for performing Kohn-Sham Density Functional Theory, it is now possible to perform fully quantum mechanical calculations of systems containing tens of thousands of atoms. However, with an…

For a given finitely generated multiplicative subgroup of the rationals which possibly contain negative numbers, we derive, subject to GRH, formulas for the densities of primes for which the index of the reduction group has a given value.…

In the framework of shape constrained estimation, we review methods and works done in convex set estimation. These methods mostly build on stochastic and convex geometry, empirical process theory, functional analysis, linear programming,…

We prove a continuous Freiman's $3k-4$ theorem for small sumsets in $\mathbb{R}$ by using some ideas from Ruzsa's work on measure of sumsets in $\mathbb{R}$ as well as some graphic representation of density functions of sets. We thereby get…

Data compression techniques are characterized by four key performance indices which are (i) associated accuracy, (ii) compression ratio, (iii) computational work, and (iv) degree of freedom. The method of data compression developed in this…

Let $A$ be a subset of an additive abelian semigroup $S$ and let $hA$ be the $h$-fold sumset of $A$. The following question is considered: Let $(A_q)_{q=1}^{\infty}$ be a strictly decreasing sequence of sets in $S$ and let $A =…

We study global subalgebras of superconformal algebras in two dimensions and their unitary representations. Global superconformal multiplets are decomposed into conformal multiplets using Racah-Speiser algorithm, revealing many essential…

{The first version of this text was written and submitted to a journal on April, 12, 2018. This second version was submitted on April, 9, 2019.} We investigate the existence of subsets $A$ and $B$ of $\mathbb{N}:=\{0,1,2,\dots\}$ such that…

We extend the concepts of sum-free sets and Sidon-sets of combinatorial number theory with the aim to provide explicit constructions for spherical designs. We call a subset $S$ of the (additive) abelian group $G$ {\it $t$-free} if for all…

Subshifts are sets of colorings of $\mathbb{Z}^d$ defined by families of forbidden patterns. In a given subshift, the extender set of a finite pattern is the set of all its admissible completions. Since soficity of $\mathbb{Z}$ subshifts is…

The efficiency of exact subset sum problem algorithms which compute individual subset sums is defined as $e=min(T/z, 1)$, where $z$ is the number of subset sums computed. $e$ is related to these algorithms' computational complexity. This…

We study dimensions of sumsets and iterated sumsets and provide natural conditions which guarantee that a set $F \subseteq \mathbb{R}$ satisfies $\overline{\dim}_\text{B} F+F > \overline{\dim}_\text{B} F$ or even $\dim_\text{H} n F \to 1$.…

Let p be a prime and let A be a subset of F_p. For k<p let X_{A,k} be the (k-1)-dimensional complex on the vertex set F_p with a full (k-2)-skeleton whose (k-1)-faces are k-subsets S of F_p such that the sum of the elements of S belongs to…

Let $G$ be a locally compact abelian group with Haar measure $\mu$. For integers $n \geq 2$ and $H \geq 2$ and for any $n$-tuples $\mathbf{u}_1,\ldots, \mathbf{u}_H \in \mathbf{N}^n$, there exist measurable subsets $A_1,\ldots, A_n$ of $G$…

A k-dimensional hypertree X is a k-dimensional complex on n vertices with a full (k-1)-dimensional skeleton and \binom{n-1}{k} facets such that H_k(X;Q)=0. Here we introduce the following family of simplicial complexes. Let n,k be integers…

The basic theme of this paper is the fact that if $A$ is a finite set of integers, then the sum and product sets cannot both be small. A precise formulation of this fact is Conjecture 1 below due to Erd\H os-Szemer\'edi [E-S]. (see also…

Rademacher complexity is often used to characterize the learnability of a hypothesis class and is known to be related to the class size. We leverage this observation and introduce a new technique for estimating the size of an arbitrary…

For a finitely presented group, the word problem asks for an algorithm which declares whether or not words on the generators represent the identity. The Dehn function is a complexity measure of a direct attack on the word problem by…

Computers are good at evaluating finite sums in closed form, but there are finite sums which do not have closed forms. Summands which do not produce a closed form can often be ``fixed'' by multiplying them by a suitable polynomial. We…