English
Related papers

Related papers: Bounds for generalized Sidon sets

200 papers

For $h \geq 1$, a $B_h$-set is a set of integers such that every integer $n$ has at most one representation in the form $n = a_{i_1} + \cdots + a_{i_h}$, where $a_{i_r} \in A$ for all $r = 1,\ldots, h$ and $a_{i_1} \leq \ldots \leq…

Number Theory · Mathematics 2024-09-26 Melvyn B. Nathanson , Kevin O'Bryant

We give sharp bounds in Breuillard, Green and Tao's finitary version of Gromov's theorem on groups with polynomial growth. Precisely, we show that for every non-negative integer d there exists $c=c(d)>0$ such that if $G$ is a group with…

Group Theory · Mathematics 2024-03-19 Romain Tessera , Matthew Tointon

We show, for every $r>d\ge 0$ or $r=d\ge 2$, the existence of a Baire generic set of $C^d$-families of $C^r$-maps $(f_a)_{a\in (-1,1)^k}$ of a manifold $M$ of dimension $\ge 2$, so that for every $a$ small the map $f_a$ has infinitely many…

Dynamical Systems · Mathematics 2015-09-30 Pierre Berger

In this article, we consider the notion of almost irredundant sets: A subset $\mathcal{X}$ of a C*-algebra $\mathcal{A}$ is called almost irredundant if and only if for every $a\in \mathcal{X}$, the element $a$ does not belong to the…

Operator Algebras · Mathematics 2020-12-29 Clayton Suguio Hida

For $k\geq3$, a collection of $k$ sets is said to form a \emph{weak $\Delta$-system} if the intersection of any two sets from the collection has the same size. Erd\H{o}s and Szemer\'{e}di asked about the size of the largest family…

Combinatorics · Mathematics 2023-01-24 Eric Naslund

Let $\Gamma$ be a finite group, let $\theta$ be an involution of $\Gamma$, and let $\rho$ be an irreducible complex representation of $\Gamma$. We bound $\dim \rho^{\Gamma^{\theta}}$ in terms of the smallest dimension of a faithful…

Representation Theory · Mathematics 2024-11-20 Nir Avni , Avraham Aizenbud

A subset $X$ of an abelian $G$ is said to be {\em complete} if every element of the subgroup generated by $X$ can be expressed as a nonempty sum of distinct elements from $X$. Let $A\subset \Z_n$ be such that all the elements of $A$ are…

Number Theory · Mathematics 2007-05-23 Y. O. Hamidoune , A. S. Lladó , O. Serra

Let $\Gamma$ be a discrete group. We show that if $\Gamma$ is nonamenable, then the algebraic tensor products $C^*_r(\Gamma)\otimes C^*_r(\Gamma)$ and $C^*(\Gamma)\otimes C^*_r(\Gamma)$ do not admit unique $C^*$-norms. Moreover, when…

Operator Algebras · Mathematics 2015-06-12 Matthew Wiersma

A Sidon set is a subset of an Abelian group with the property that each sum of two distinct elements is distinct. We construct a small maximal Sidon set of size $O((n \cdot 2^n)^{1/3})$ in the group $\mathbb{Z}_2^n$, generalizing a result…

Combinatorics · Mathematics 2022-04-12 Maximus Redman , Lauren Rose , Raphael Walker

Given an infinite set \Lambda of characters on a compact abelian group we show that \Lambda is a \Lambda(p)-set for all p>2 if and only if the limit order of the ideal of all \Lambda-summing operators coincides with that of the ideal of all…

Functional Analysis · Mathematics 2007-05-23 Carsten Michels

A dominating set in a graph $G$ is a set $S$ of vertices such that every vertex that does not belong to $S$ is adjacent to a vertex in $S$. The domination number $\gamma(G)$ of $G$ is the minimum cardinality of a dominating set of $G$. The…

Combinatorics · Mathematics 2022-08-16 Magda Dettlaff , Michael A. Henning , Jerzy Topp

The following problem has been known since the 80's. Let $\Gamma$ be an Abelian group of order $m$ (denoted $|\Gamma|=m$), and let $t$ and $m_i$, $1 \leq i \leq t$, be positive integers such that $\sum_{i=1}^t m_i=m-1$. Determine when…

Combinatorics · Mathematics 2023-06-22 Sylwia Cichacz , Karol Suchan

Let $G$ be a regular graph of degree $d$ and let $A\subset V(G)$. Say that $A$ is $\eta$-closed if the average degree of the subgraph induced by $A$ is at least $\eta d$. This says that if we choose a random vertex $x\in A$ and a random…

Combinatorics · Mathematics 2018-10-01 W. T. Gowers , O. Janzer

In additive number theory, a finite set $A$ of integers is an $h$-basis for $n$ if every integer in $\{0,1,2,\ldots, n\}$ can be represented as the sum of exactly $h$ not necessarily distinct elements of $A$. This paper introduces a new…

Number Theory · Mathematics 2026-05-28 Melvyn B. Nathanson

We prove that for every planar graph $X$ of treedepth $h$, there exists a positive integer $c$ such that for every $X$-minor-free graph $G$, there exists a graph $H$ of treewidth at most $f(h)$ such that $G$ is isomorphic to a subgraph of…

Let $hA$ denote the $h$-fold sumset of a subset $A$ of an abelian group. Resolving a problem of Nathanson, we show that for any prescribed permutations $\sigma_1, \ldots, \sigma_H \in \mathfrak{S}_n$, there exist finite subsets $A_1,…

Combinatorics · Mathematics 2025-01-07 Noah Kravitz

A set A of positive integers is called a perfect difference set if every nonzero integer has an unique representation as the difference of two elements of A. We construct dense perfect difference sets from dense Sidon sets. As a consequence…

Number Theory · Mathematics 2016-12-30 Javier Cilleruelo , Melvyn B. Nathanson

The Cayley sum graph $\Gamma_A$ of a set $A \subseteq \mathbb{Z}_n$ is defined to have vertex set $\mathbb{Z}_n$ and an edge between two distinct vertices $x, y \in \mathbb{Z}_n$ if $x + y \in A$. Green and Morris proved that if the set $A$…

Combinatorics · Mathematics 2024-12-05 Marcelo Campos , Gabriel Dahia , João Pedro Marciano

We show that for every positive integer $k$ there are positive constants $C$ and $c$ such that if $A$ is a subset of $\{1, 2, \dots, n\}$ of size at least $C n^{1/k}$, then, for some $d \leq k-1$, the set of subset sums of $A$ contains a…

Combinatorics · Mathematics 2023-11-03 David Conlon , Jacob Fox , Huy Tuan Pham

We show that group C*-algebras of finitely generated, nilpotent groups have finite nuclear dimension. It then follows, from a string of deep results, that the C*-algebra $A$ generated by an irreducible representation of such a group has…

Operator Algebras · Mathematics 2015-05-15 Caleb Eckhardt , Paul McKenney
‹ Prev 1 3 4 5 6 7 10 Next ›