Related papers: Completeness of sparse, almost integer and finite …

We construct a uniformly discrete, and even sparse, sequence of real numbers $\Lambda=\{\lambda_n\}$ and a function g in $L^2(R)$, such that for every q>2, every function f in $L^2(R)$ can be approximated with arbitrary small error by a…

We randomly construct various subsets $\Lambda$ of the integers which have both smallness and largeness properties. They are small since they are very close, in various meanings, to Sidon sets: the continuous functions with spectrum in…

We construct a real sequence $\{\lambda_n\}_{n=1}^{\infty}$ satisfying $\lambda_n = n + o(1)$, and a Schwartz function $f$ on $\mathbb{R}$, such that for any $N$ the system of translates $\{f(x - \lambda_n)\}$, $n > N$, is complete in the…

For every $p > (1 + \sqrt{5})/2$ we construct a uniformly discrete real sequence $\{\lambda_n\}_{n=1}^\infty$ satisfying $|\lambda_n| = n + o(1)$, a function $g \in L^p(\mathbb{R})$, and continuous linear functionals…

Let $1\le p <\infty$, $f\in L_p(\real)$ and $\Lambda\subseteq \real$. We consider the closed subspace of $L_p(\real)$, $X_p (f,\Lambda)$, generated by the set of translations $f_{(\lambda)}$ of $f$ by $\lambda \in\Lambda$. If $p=1$ and…

For any prime number p and any positive real number {\alpha}, we construct a finitely generated group {\Gamma} with p-gradient equal to {\alpha}. This construction is used to show that there exist uncountably many pairwise non-commensurable…

Lambda calculus is the basis of functional programming and higher order proof assistants. However, little is known about combinatorial properties of lambda terms, in particular, about their asymptotic distribution and random generation.…

Given an infinite set \Lambda of characters on a compact abelian group we show that \Lambda is a \Lambda(p)-set for all p>2 if and only if the limit order of the ideal of all \Lambda-summing operators coincides with that of the ideal of all…

In this paper, we prove the existence of capacity achieving linear codes with random binary sparse generating matrices. The results on the existence of capacity achieving linear codes in the literature are limited to the random binary codes…

We study the relationship between the growth rate of an integer sequence and harmonic and functional properties of the corresponding sequence of characters. In particular we show that every polynomial sequence contains a set that is…

Given lacunary sequence of integers, $n_k$, $n_{k+1}/n_k>\lambda>1$, we define a new sequence $\{m_k\}$ formed by all possible $l$-wise sums $\pm n_{k_1}\pm n_{k_2}\pm \ldots\pm n_{k_l}$. We prove if $\lambda>\lambda_l$, then any series…

We study a process of generating random positive integer weight sequences $\{ W_n \}$ where the gaps between the weights $\{ X_n = W_n - W_{n-1} \}$ are i.i.d. positive integer-valued random variables. We show that as long as the gap…

We characterize, in terms of the Beurling-Malliavin density, the discrete spectra $\Lambda\subset\R$ for which a generator exists, that is a function $\phi\in L^1(\R)$ such that its $\Lambda$-translates $\phi(x-\lambda), \lambda\in\Lambda$,…

We study properties of a sequence $\Lambda$ obtained by a randomselection of integers $n$, where $n\in\Lambda$ with probability $\varpi_{n}$, independently of the other choices. We distinguish two cases : if…

Suppose $\Lambda$ is a discrete infinite set of nonnegative real numbers. We say that $ {\Lambda}$ is of type 1 if the series $s(x)=\sum_{\lambda\in\Lambda}f(x+\lambda)$ satisfies a zero-one law. This means that for any non-negative…

In this paper we show that, if an increasing sequence $\Lambda=(\lambda_k)_{k\in\mathbb{Z}}$ has gaps going to infinity $\lambda_{k+1}-\lambda_k\to +\infty$ when $k\to\pm\infty$, then for every $T>0$ and every sequence…

Let $1 < p < \infty$, $p\neq 2$. We prove that if $d\geq d_p$ is sufficiently large, and $A\subs\R^d$ is a measurable set of positive upper density then there exists $\la_0=\la_0(A)$ such for all $\la\geq\la_0$ there are $x,y\in\R^d$ such…

Sequence-to-sequence models are a powerful workhorse of NLP. Most variants employ a softmax transformation in both their attention mechanism and output layer, leading to dense alignments and strictly positive output probabilities. This…

In this paper we study the minimal number of generators for simple Lie algebras in characteristic 0 or p > 3. We show that any such algebra can be generated by 2 elements. We also examine the 'one and a half generation' property, i.e. when…

This survey paper is based on a talk given at the 44th Summer Symposium in Real Analysis in Paris. This line of research was initiated by a question of Haight and Weizs\"aker concerning almost everywhere convergence properties of series of…