Related papers: An example concerning set addition in F_2^n

We prove in Theorem $2.2$ that the multiplicatively closed subset generated by at most two elements in the set of natural numbers $\mathbb{N}$ has arbitrarily large gaps by explicitly constructing large integer intervals with known prime…

We study relations between subsets of integers that are large, where large can be interpreted in terms of size (such as a set of positive upper density or a set with bounded gaps) or in terms of additive structure (such as a Bohr set). Bohr…

A finite family $\mathrsfs{F}$ of subsets of a finite set $X$ is union-closed whenever $f,g\in\mathrsfs{F}$ implies $f\cup g\in\mathrsfs{F}$. These families are well known because of Frankl's conjecture. In this paper we developed further…

A family of sets $\mathcal{A}$ is union-closed if it is finite and nonempty with member sets that are all finite and distinct (at least one of which is nonempty) and it satisfies the property $X, Y \in \mathcal{A} \implies X \cup Y \in…

A $Z$-set in a metric space $X$ is a closed subset $K$ of $X$ such that each map of the Hilbert cube $Q$ into $X$ can uniformly be approximated by maps of $Q$ into $X \setminus K$. The aim of the paper is to show that there exists a functor…

We prove that if two additive functions (from a certain class) take large values with roughly the same probability then they must be identical. This is a consequence of a structure theorem making clear the inter-relation between the…

As distributed approaches to natural language semantics have developed and diversified, embedders for linguistic units larger than words have come to play an increasingly important role. To date, such embedders have been evaluated using…

We study extensions of Sem\"enov arithmetic, the first-order theory of the structure $(\mathbb{N}, +, 2^x)$. It is well-knonw that this theory becomes undecidable when extended with regular predicates over tuples of number strings, such as…

A definable set in a pair (K, k) of algebraically closed fields is co-analyzable relative to the subfield k of the pair if and only if it is almost internal to k. To prove this and some related results for tame pairs of real closed fields…

Given a finite connected graph G, place a bin at each vertex. Two bins are called a pair if they share an edge of G. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with probability…

Indexing of static and dynamic sets is fundamental to a large set of applications such as information retrieval and caching. Denoting the characteristic vector of the set by B, we consider the problem of encoding sets and multisets to…

Let $A$, $A'$ be separable $C^*$-algebras, $B$ a stable $\sigma$-unital $C^*$-algebra. Our main result is the construction of the pairing $[[A',A]]\times\operatorname{Ext}^{-1/2}(A,B)\to\operatorname{Ext}^{-1/2}(A',B)$, where $[[A',A]]$…

Any symmetric affinity function $w: V\times V \to \mathbb{R}_+$ defined on a discrete set $V$ induces Euclidean space structure on $V$. In particular, an undirected graph specified by an affinity (or adjacency) matrix can be considered as a…

Given a non-negative, decreasing sequence $a$ with sum $1$, we consider all the closed subsets of $[0,1]$ such that the lengths of their complementary open intervals are given by the terms of $a$, the so-called complementary sets. In this…

Let A be a subset of a group G = (G,.). We will survey the theory of sets A with the property that |A.A| <= K|A|, where A.A = {a_1 a_2 : a_1, a_2 in A}. The case G = (Z,+) is the famous Freiman--Ruzsa theorem.

This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms…

We investigate the causal relations in the space of states of almost commutative Lorentzian geometries. We fully describe the causal structure of a simple model based on the algebra $\mathcal{S}(\mathbb{R}^{1,1}) \otimes M_2(\mathbb{C})$,…

In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…

For a positive integer $d$, a set of points in $d$-dimensional Euclidean space is called almost-equidistant if for any three points from the set, some two are at unit distance. Let $f(d)$ denote the largest size of an almost-equidistant set…

The Frankl or Union-Closed Sets conjecture states that for any finite union-closed family of sets $\mathcal{F}$ containing some nonempty set, there is some element $i$ in the ground set $U(\mathcal F) := \bigcup_{S \in \mathcal{F}} S$ of…