Related papers: Embeddability Properties of Difference Sets

In literature, many important combinatorial properties of subsets of N have been studied both with nonstandard techniques and from the point of view of N. In this thesis we mix these two different approaches in a technique that, at the same…

Let $(a_n)_{n \geq 1}$ be a sequence of distinct positive integers. In a recent paper Rudnick established asymptotic upper bounds for the minimal gaps of $\{a_n \alpha \bmod 1, 1 \leq n \leq N\}$ as $N \to \infty$, valid for Lebesgue-almost…

We formulate and establish symmetries of certain integrable half space models, analogous to recent results on symmetries for models in a full space. Our starting point is the colored stochastic six vertex model in a half space, from which…

We describe certain sufficient conditions for an infinitely divisible probability measure on a class of connected Lie groups to be embeddable in a continuous one-parameter convolution semigroup of probability measures. (Theorem 1.3). This…

For a standard graded algebra $R$, we consider embeddings of the the poset of Hilbert functions of quotients of $R$ into the poset of ideals of $R$, as a way of classification of Hilbert functions. There are examples of rings for which such…

We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer…

Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd\H{o}s-R\'enyi graphs are typically asymmetric, real…

Regular variation of a multivariate measure with a Lebesgue density implies the regular variation of its density provided the density satisfies some regularity conditions. Unlike the univariate case, the converse also requires regularity…

This paper introduces an approach for detecting differences in the first-order structures of spatial point patterns. The proposed approach leverages the kernel mean embedding in a novel way by introducing its approximate version tailored to…

A matching from a finite subset $A$ of an abelian group $G$ to another subset $B$ is a bijection $f : A \to B$ such that $af(a) \notin A$ for all $a \in A$. The study of matchings began in the 1990s and was motivated by a conjecture of E.…

In the theory of combinatorial algebras, there is a sequence of embeddings between Kleene's second model, van Oosten's model, and Scott's graph model. We prove that none of these embeddings can be reversed. We also prove nonembedding…

Persistence diagrams are important descriptors in Topological Data Analysis. Due to the nonlinearity of the space of persistence diagrams equipped with their {\em diagram distances}, most of the recent attempts at using persistence diagrams…

We study inequalities between graded Betti numbers of ideals in a standard graded algebra over a field and their images under embedding maps, defined earlier by us in [Math. Z. 274, (2013), no. 3-4, pp. 809-819; arXiv:1009.4488]. We show…

We use some of the largest order statistics of the random projections of a reference signal to construct a binary embedding that is adapted to signals correlated with such signal. The embedding is characterized from the analytical…

We give sufficient conditions for a metric space to bilipschitz embed in L_1. In particular, if X is a length space and there is a Lipschitz map u:X--->R such that for every interval I in R, the connected components of the inverse image…

Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in…

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

We investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply our results and techniques to study effective embeddings of…

In this paper, we prove a structure theorem for the infinite union of $n$-adic doubling measures via techniques which involve far numbers. Our approach extends the results of Wu in 1998, and as a by product, we also prove a classification…

A full characterization of the boundedness of Laplace--Carleson embeddings on $L^\infty$ is provided, in terms of the Carleson intensity of the respective measure and of a suitable weighted Berezin transform of the measure. Moreover,…