Related papers: Embeddability Properties of Difference Sets
We show that if $A=\{a_1 < a_2 < \ldots < a_k\}$ is a set of real numbers such that the differences of the consecutive elements are distinct, then for and finite $B \subset \mathbb{R}$, $$|A+B|\gg |A|^{1/2}|B|.$$ The bound is tight up to…
In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…
A. Vershik discovered that filtrations indexed by the non-positive integers may have a paradoxical asymptotic behaviour near the time $-\infty$, called non-standardness. For example, two dyadic filtrations with trivial tail $\sigma$-field…
We prove a main gap theorem for e-saturated submodels of a homogeneous structure. We also study the number of e-saturated models, which are not elementarily embeddable to each other
A residual design ${\cal{D}}_B$ with respect to a block $B$ of a given design $\cal{D}$ is defined to be linearly embeddable over $GF(p)$ if the $p$-ranks of the incidence matrices of ${\cal{D}}_B$ and $\cal{D}$ differ by one. A sufficient…
A combinatorial characterization of measurable filters on a countable set is found. We apply it to the problem of measurability of the intersection of nonmeasurable filters.
We derive "numerical" criteria for the existence of embeddings of representations of finite dimensional algebras.
Let $K$ be an algebraically closed field of characteristic zero, and let $A$ and $B$ be two simple algebras with involution over $K$. In this note we study the embedding problem for algebras with involution. More specifically, if the…
S.Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529--563] defined limits of finite posets in parallel to the emerging theory of limits of dense graphs. We prove that each poset limit can be represented as a…
Some quantum measurements can not be performed simultaneously, i.e. they are incompatible. Here we show that every set of incompatible measurements provides an advantage over compatible ones in a suitably chosen quantum state discrimination…
Some practical results are derived for population inference based on a sample, under the two qualitative conditions of 'ignorability' and exchangeability. These are the 'Histogram Theorem', for predicting the outcome of a non-sampled member…
A key obstacle in automated analytics and meta-learning is the inability to recognize when different datasets contain measurements of the same variable. Because provided attribute labels are often uninformative in practice, this task may be…
This work focuses on the question of how identifiability of a mathematical model, that is, whether parameters can be recovered from data, is related to identifiability of its submodels. We look specifically at linear compartmental models…
Given a subshift over an arbitrary alphabet, we construct a representation of the associated unital algebra. We describe a criteria for the faithfulness of this representation in terms of the existence of cycles with no exits. Subsequently,…
This paper investigates instances of Sobolev embeddings characterized by local compactness at every point within their domain, except for a single point. We obtain the sharp conditions that distinguish compactness from non-compactness and…
Linear combinations of exponentials $e^{i\lambda_kt}$ in the case where the distance between some points $\lambda_k$ tends to zero are studied. D. Ullrich has proved the basis property of the divided differences of exponentials in the case…
Most of results of Bestvina and Mogilski [\textit{Characterizing certain incomplete infinite-dimensional absolute retracts}, Michigan Math. J. \textbf{33} (1986), 291--313] on strong $Z$-sets in ANR's and absorbing sets is generalized to…
We review and analyse techniques from the literature for extending a normed algebra, A to a normed algebra, B, so that B has interesting or desirable properties which A may lack. For example, B might include roots of monic polynomials over…
Matching two different sets of items, called heterogeneous set-to-set matching problem, has recently received attention as a promising problem. The difficulties are to extract features to match a correct pair of different sets and also…
A graph $G$ is embeddable in $\mathbb{R}^d$ if vertices of $G$ can be assigned with points of $\mathbb{R}^d$ in such a way that all pairs of adjacent vertices are at the distance 1. We show that verifying embeddability of a given graph in…