Related papers: Embeddability Properties of Difference Sets

In this paper, we investigate linear systems on hyperelliptic varieties. We prove analogues of well-known theorems on abelian varieties, like Lefschetz's embedding theorem and higher k-jet embedding theorems. Syzygy or $N_p$-properties are…

We propose an axiomatic approach towards studying unlikely intersections by introducing the framework of distinguished categories. This includes commutative algebraic groups and mixed Shimura varieties. It allows us to define all basic…

Let $A$ and $B$ two $F_q$-subspaces of a finite field, of the same size, and let $A^{-1}$ denote the set of inverses of the nonzero elements of $A$. Mattarei proved that $A^{-1}$ can only be contained in $A$ if either $A$ is a subfield, or…

We prove a general transfer theorem for multivariate random sequences with independent random indexes in the double array limit setting. We also prove its partial inverse providing necessary and sufficient conditions for the convergence of…

Let $\mathcal{A}$ be a set of positive numbers. A graph $G$ is called an $\mathcal{A}$-embeddable graph in $\mathbb{R}^d$ if the vertices of $G$ can be positioned in $\mathbb{R}^d$ so that the distance between endpoints of any edge is an…

In this paper we establish some subnormal embeddings of groups into groups with additional properties; in particular embeddings of countable groups into 2-generated groups with some extra properties. The results obtained are generalizations…

As a generalization of Hausdorff's extension theorem of metrics, we prove an interpolation theorem of a family of metrics defined on closed subsets of metrizable spaces. As an application, we investigate typicality of subsets of moduli…

A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of systems of linked symmetric designs. The central problems are…

Joint spectral embeddings facilitate analysis of multiple network data by simultaneously mapping vertices in each network to points in Euclidean space where statistical inference is then performed. In this work, we consider one such joint…

We consider the classical Besov and Triebel-Lizorkin spaces defined via differences and prove a homogeneity property for functions with bounded support in the frame of these spaces. As the proof is based on compact embeddings between the…

Let $v$ be an odd real polynomial (i.e. a polynomial of the form $\sum_{j=1}^\ell a_jx^{2j-1}$). We utilize sets of iterated differences to establish new results about sets of the form $\mathcal…

We prove central limit theorems for the number of descents and the number of inversions after a shelf-shuffle. In particular, we bound the convergence rate for the number of inversions independently of the number of shelves. Along the way,…

Using a slight modification of an argument of Croot, Ruzsa and Schoen we establish a quantitative result on the existence of a dilated copy of any given configuration of integer points in sparse difference sets. More precisely, given any…

We study identifiability of finite mixtures of Dirichlet distributions on the interior of the simplex. We first prove a shift identity showing that every Dirichlet density can be written as a mixture of $J$ shifted Dirichlet densities,…

Embedding data into vector spaces is a very popular strategy of pattern recognition methods. When distances between embeddings are quantized, performance metrics become ambiguous. In this paper, we present an analysis of the ambiguity…

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

A relational structure is called reversible iff every bijective endomorphism of that structure is an automorphism. We give several equivalents of that property in the class of disconnected binary structures and some its subclasses. For…

Sets of desirable gambles constitute a quite general type of uncertainty model with an interesting geometrical interpretation. We give a general discussion of such models and their rationality criteria. We study exchangeability assessments…

For nonempty sets $A,B$ of nonnegative integers and an integer $n$, let $r_{A,B}(n)$ be the number of representations of $n$ as $a+b$ and $d_{A,B}(n)$ be the number of representations of $n$ as $a-b$, where $a\in A, b\in B$. In this paper,…

We prove that the joint embedding property is undecidable for hereditary graph classes, via a reduction from the tiling problem. The proof is then adapted to show the undecidability of the joint homomorphism property as well.