English
Related papers

Related papers: The Structure of Critical Product Sets

200 papers

Let $p$ be an odd prime. For nontrivial proper subsets $A,B$ of $\mathbb{Z}_p$ of cardinality $s,t$, respectively, we count the number $r(A,B,B)$ of additive triples, namely elements of the form $(a, b, a+b)$ in $A \times B \times B$. For…

Combinatorics · Mathematics 2024-05-09 Sophie Huczynska , Jonathan Jedwab , Laura Johnson

For a finite abelian group $G$, a nonempty subset $A$ of $G$, and a positive integer $h$, we let $hA$ denote the $h$-fold sumset of $A$; that is, $hA$ is the collection of sums of $h$ not-necessarily-distinct elements of $A$. Furthermore,…

Number Theory · Mathematics 2016-11-23 Bela Bajnok

The Davenport constant for a finite abelian group $G$ is the minimal length $\ell$ such that any sequence of $\ell$ terms from $G$ must contain a nontrivial zero-sum sequence. For the group $G=(\mathbb Z/n\mathbb Z)^2$, its value is $2n-1$,…

Number Theory · Mathematics 2021-07-23 David J. Grynkiewicz

Let $G$ be a finite abelian group. The critical number ${\rm cr}(G)$ of $G$ is the least positive integer $\ell$ such that every subset $A\subseteq G\setminus\{0\}$ of cardinality at least $\ell$ spans $G$, i.e., every element of $G$ can be…

Combinatorics · Mathematics 2011-03-31 Dan Guo , Yongke Qu , Guoqing Wang , Qinghong Wang

A set $\mathcal{A}\subset \mathbb{N}$ is called additively decomposable (resp. asymptotically additively decomposable) if there exist sets $\mathcal{B},\mathcal{C}\subset \mathbb{N}$ of cardinality at least two each such that…

Number Theory · Mathematics 2022-04-26 P. -Y. Bienvenu

For a finite abelian group $G$ written additively, and a non-empty subset $A\subset [1,\exp(G)-1]$ the weighted Davenport Constant of $G$ with respect to the set $A$, denoted $D_A(G)$, is the least positive integer $k$ for which the…

Combinatorics · Mathematics 2018-07-12 Niranjan Balachandran , Eshita Mazumdar

Using the methods of topological dynamics, H. Furstenberg introduced the notion of a central set and proved the famous Central Sets Theorem. D. De, N. Hindman, and D. Strauss introduced $C$-set, satisfying the strong central set theorem.…

Combinatorics · Mathematics 2024-10-22 Pintu Debnath

The knapsack problem for groups was introduced by Miasnikov, Nikolaev, and Ushakov. It is defined for each finitely generated group $G$ and takes as input group elements $g_1,\ldots,g_n,g\in G$ and asks whether there are $x_1,\ldots,x_n\ge…

Group Theory · Mathematics 2021-01-18 Pascal Bergsträßer , Moses Ganardi , Georg Zetzsche

Hegyv\'ari and Hennecart showed that if $B$ is a sufficiently large brick of a Heisenberg group, then the product set $B\cdot B$ contains many cosets of the center of the group. We give a new, robust proof of this theorem that extends to…

Number Theory · Mathematics 2018-08-28 Thang Pham , Michael Tait , Le Anh Vinh , Robert Won

We consider the question of when sets definable in first-order expansions of groups contain the product of two infinite sets (we refer to this as the "productset property"). We first show that the productset property holds for any definable…

Logic · Mathematics 2023-11-03 Uri Andrews , Gabriel Conant , Isaac Goldbring

Algebraic Combinatorics originated in Algebra and Representation Theory, studying their discrete objects and integral quantities via combinatorial methods which have since developed independent and self-contained lives and brought us some…

Combinatorics · Mathematics 2023-07-03 Greta Panova

A classical result due to Blaschke states that for every analytic self-map $f$ of the open unit disk of the complex plane there exists a Blaschke product $B$ such that the zero sets of $f$ and $B$ agree. In this paper we show that there is…

Complex Variables · Mathematics 2014-02-26 Daniela Kraus

In various occasions the conjugacy problem in finitely generated amalgamated products and HNN extensions can be decided efficiently for elements which cannot be conjugated into the base groups. This observation asks for a bound on how many…

Group Theory · Mathematics 2016-05-09 Volker Diekert , Alexei G. Myasnikov , Armin Weiß

Let $G$ be a finite group written multiplicatively. By a sequence over $G$, we mean a finite sequence of terms from $G$ which is unordered, repetition of terms allowed, and we say that it is a product-one sequence if its terms can be…

Number Theory · Mathematics 2012-11-13 D. J. Grynkiewicz

In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…

Group Theory · Mathematics 2007-05-23 Zhi-Wei Sun

We prove the Arad-Herzog conjecture for various families of finite simple groups- if A and B are nontrivial conjugacy classes, then AB is not a conjugacy class. We also prove that if G is a finite simple group of Lie type and A and B are…

Group Theory · Mathematics 2012-02-28 Robert M. Guralnick , Gunter Malle , Pham Huu Tiep

Several types of nonclassical structures within the $N$-qubit Pauli group that can be seen as fundamental resources for quantum information processing are presented and discussed. Identity Products (IDs), structures fundamentally related to…

Quantum Physics · Physics 2015-06-17 Mordecai Waegell

For an abelian group $G$, $\vec{g}=(g_1,\ldots,g_d)\in G^d$ and $\epsilon=(\epsilon(1),\ldots,\epsilon(d))\in \{0,1\}^d$, let $\vec{g}\cdot \epsilon=\prod_{i=1}^{d}g_i^{\epsilon(i)}$. In this paper, it is shown that for a minimal system…

Dynamical Systems · Mathematics 2024-10-03 Jiahao Qiu , Xiangdong Ye

Let $G$ be a finite abelian group and $A$ a subset of $G$. The spectrum of $A$ is the set of its large Fourier coefficients. Known combinatorial results on the structure of spectrum, such as Chang's theorem, become trivial in the regime…

Combinatorics · Mathematics 2015-04-07 Kaave Hosseini , Shachar Lovett

We prove a version of the Cauchy-Davenport theorem for general linear maps. For subsets $A,B$ of the finite field $\mathbb{F}_p$, the classical Cauchy-Davenport theorem gives a lower bound for the size of the sumset $A+B$ in terms of the…

Combinatorics · Mathematics 2015-08-12 Simao Herdade , John Kim , Swastik Kopparty