Related papers: Bounds for generalized Sidon sets
Let $P$ be a partially ordered set. The function $\mbox{La}^{\#}(n,P)$ denotes the size of the largest family $\mathcal{F}\subset 2^{[n]}$ that does not contain an induced copy of $P$. It was proved by Methuku and P\'alv\"olgyi that there…
Sidorenko's conjecture asserts that every bipartite graph $H$ has the property that, for any host graph $G$, the homomorphism density from $H$ to $G$ is asymptotically at least as large as in a quasirandom graph with the same edge density…
We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a rank 1 Lie group G, where the representations rho_i are not necessarily faithful. We show that, for algebraically convergent sequences (Gamma_i),…
We show that for any set $D$ of at least two digits in a given base $b$, there exists a $\delta(D,b)>0$ such that within the set $\mathcal{A}$ of numbers whose digits base $b$ are exclusively from $D$, the number of even integers in…
Let $G$ be a graph on $n$ vertices and $(H,+)$ be an abelian group. What is the minimum size ${\sf S}_H(G)$ of the set of all sums $A(u)+A(v)$ over all injections $A:V(G)\to H$? In 2012, the first author, Angel, the second author, and…
We say that a set is a multiplicative 3-Sidon set if the equation $s_1s_2s_3=t_1t_2t_3$ does not have a solution consisting of distinct elements taken from this set. In this paper we show that the size of a multiplicative 3-Sidon subset of…
We show that for a subset $A$ of the cyclic group of prime order $p>3$, if the sumset $A+A-2A$ is not the whole group, then $|A|\le \frac27\,p$. Besides combinatorial arguments, we utilize a general technique involving linear programming.
For a graph $\Gamma=(V(\Gamma),E(\Gamma))$, a subset $C$ of $V(\Gamma)$ is called an $(\alpha,\beta)$-regular set in $\Gamma$, if every vertex of $C$ is adjacent to exactly $\alpha$ vertices of $C$ and every vertex of $V(\Gamma)\setminus C$…
Let $\gamma = (\gamma_1,...,\gamma_N)$, $N \geq 2$, be a system of proper contractions on a complete metric space. Then there exists a unique self-similar non-empty compact subset $K$. We consider the union ${\mathcal G} = \cup_{i=1}^N…
Given a not-necessarily Hausdorff, topologically free, twisted \'etale groupoid $(G, L)$, we consider its "essential groupoid C*-algebra", denoted $C^*_{ess}(G, L)$, obtained by completing $C_c(G, L)$ with the smallest among all…
Building on previous work by Lambert, Plagne and the third author, we study various aspects of the behavior of additive bases in infinite abelian groups and semigroups. We show that, for every infinite abelian group $T$, the number of…
Suppose A is a unital subhomogeneous C*-algebra. We show that every central sequence in A is hypercentral if and only if every pointwise limit of a sequence of irreducible representations is multiplicity free. We also show that every…
The most powerful formulation of the Central Sets Theorem in an arbitrary semigroup was proved in the work of De, Hindman, and Strauss. The sets which satisfy the conclusion of the above Central Sets Theorem are called $C$-sets. The…
A C*-algebra is n-homogeneous (where n is finite) if every its nonzero irreducible representation acts on an n-dimensional Hilbert space. An elementary proof of Fell's characterization of n-homogeneous C*-algebras (by means of their…
Given an integer $k$, define $C_k$ as the set of integers $n > \max(k,0)$ such that $a^{n-k+1} \equiv a \pmod{n}$ holds for all integers $a$. We establish various multiplicative properties of the elements in $C_k$ and give a sufficient…
A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graph's end-structure. Using a combinatorial theorem of…
Assume $G$ is a solvable group whose elementary abelian sections are all finite. Suppose, further, that $p$ is a prime such that $G$ fails to contain any subgroups isomorphic to $C_{p^\infty}$. We show that if $G$ is nilpotent, then the…
In the ElGamal signature and encryption schemes, an element $x$ of the underlying group $G = \mathbb{Z}_p^\times = \{1, \ldots, p-1 \}$ for a prime $p$ is also considered as an exponent, for example in $g^x$, where $g$ is a generator of G.…
Given a finite subset A of an abelian group G, we study the set k \wedge A of all sums of k distinct elements of A. In this paper, we prove that |k \wedge A| >= |A| for all k in {2,...,|A|-2}, unless k is in {2,|A|-2} and A is a coset of an…
We prove that, given $\epsilon>0$ and $k\geq 1$, there is an integer $n$ such that the following holds. Suppose $G$ is a finite group and $A\subseteq G$ is $k$-stable. Then there is a normal subgroup $H\leq G$ of index at most $n$, and a…