DGDavid J. Grynkiewicz

David J. Grynkiewicz

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


David J. Grynkiewicz has a total of 35 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Pollard's theorem in general abelian groups

    by David J. Grynkiewicz, Runze Wang

    We make further progress towards a Kneser-type generalization of Pollard's Theorem to general abelian groups. For two sets $A$ and $B$ in an abelian group $G$, the \emph{$t$-popular sumset} of $A$ and $B$, denoted by $A+_t B$, is the set of elements in $G$ each with at least $t$ representations of the form $a+b$, where $a\in A$ and $b\in B$. For $|A|,\, |B|\ge t\geq 2$, we prove that if \begin{align*} \sum_{i=1}^t |A+_i B|< t|A|+t|B|-\frac{4}{3}t^2+\frac{2}{3}t, \end{align*} then there exist $A'\subseteq A$ and $B'\subseteq B$ with $|A\setminus A'|+|B\setminus B'|\le t-1$, $A'+_t B'=A'+B'=A+_t B$, and $ \sum_{i=1}^t |A+_i B|\ge t|A|+t|B|-t|H|,$ where $H$ is the stabilizer of $A'+B'=A+_t B$. Our result improves the main quadratic term in the previous best bound from $-2t^2$ to $-\frac{4}{3}t^2$.

  • Open Access

    The $3k-4$ Theorem modulo a Prime: High Density for $A+B$

    by David J. Grynkiewicz

    The $3k-4$ Theorem asserts that, if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with $|A|\geq |B|$ and $|A+B|=|A|+|B|+r< |A|+2|B|-3$, then there are arithmetic progressions $P_A$ and $P_B$ of common difference with $X\subseteq P_X$ with $|P_X|\leq |X|+r+1$ for all $X\in \{A,B\}$. There is much progress extending this result to $\mathbb Z/p\mathbb Z$ with $p\geq 2$ prime. Here we begin by showing that, if $A,\,B\subseteq G=\mathbb Z/p\mathbb Z$ are nonempty with $|A|\geq |B|$, $A+B\neq G$, $|A+B|=|A|+|B|+r\leq |A|+1.0527|B|-3$, and $|A+B|\leq |A|+|B|-9(r+3)$, then there are arithmetic progressions $P_A$, $P_B$ and $P_C$ of common difference such that $X\subseteq P_X$ with $|P_X|\leq |X|+r+1$ for all $X\in \{A,B,C\}$, where $C=-\,G\setminus (A+B)$. This gives a rare high density version of the $3k-4$ Theorem for general sumsets $A+B$ and is the first instance with tangible (rather than effectively existential) values for the constants for general sumsets $A+B$ with high density. The ideal conjectured density restriction under which a version of the $3k-4$ Theorem modulo $p$ is expected is $|A+B|\leq p-(r+3)$. In part by utilizing the above result as well as several other recent advances, we extend methods of Serra and Zémor to give a version valid under this ideal density constraint. We show that, if $A,\,B\subseteq G=\mathbb Z/p\mathbb Z$ are nonempty with $|A|\geq |B|$, $A+B\neq G$, $|A+B|=|A|+|B|+r\leq |A|+1.01|B|-3$, and $|A+B|\leq |A|+|B|-(r+3)$, then there exist arithmetic progressions $P_A$, $P_B$ and $P_C$ of common difference such that $X\subseteq P_X$ with $|P_X|\leq |X|+r+1$ for all $X\in \{A,B,C\}$, where $C=-\,G\setminus (A+B)$. This notably improves upon the original result of Serra and Zémor, who treated the case $A+A$, required $p$ be sufficiently large, and needed the much more restrictive small doubling hypothesis $|A+A|\leq |A|+1.0001|A|$.

  • Open Access

    Structure of a sequence with prescribed zero-sum subsequences: Rank Two $p$-groups

    by John Ebert, David J. Grynkiewicz

    Let $G=(\mathbb Z/n\mathbb Z) \oplus (\mathbb Z/n\mathbb Z)$. Let $\mathsf {s}_{\leq k}(G)$ be the smallest integer $\ell$ such that every sequence of $\ell$ terms from $G$, with repetition allowed, has a nonempty zero-sum subsequence with length at most $k$. It is known that $\mathsf {s}_{\leq 2n-1-k}(G)=2n-1+k$ for $k\in [0,n-1]$, with the structure of extremal sequences showing this bound tight determined when $k\in \{0,1,n-1\}$, and for various special cases when $k\in [2,n-2]$. For the remaining values $k\in [2,n-2]$, the characterization of extremal sequences of length $2n-2+k$ avoiding a nonempty zero-sum of length at most $2n-1-k$ remained open in general, with it conjectured that they must all have the form $e_1^{[n-1]} \boldsymbol{\cdot} e_2^{[n-1]} \boldsymbol{\cdot} (e_1 +e_2)^{[k]}$ for some basis $(e_1,e_2)$ for $G$. Here $x^{[n]}$ denotes a sequence consisting of the term $x$ repeated $n$ times. In this paper, we establish this conjecture for all $k\in [2,n-2]$ when $n$ is prime, which in view of other recent work, implies the conjectured structure for all rank two abelian groups.

  • Open Access

    On sets with small sumset and m-sum-free sets in Z/pZ

    by Pablo Candela, David Gonzalez-Sanchez, David Grynkiewicz


  • Open Access

    On product-one sequences over dihedral groups

    by Alfred Geroldinger, David J. Grynkiewicz, Jun Seok Oh, Qinghai Zhong

    Let $G$ be a finite group. A sequence over $G$ means a finite sequence of terms from $G$, where repetition is allowed and the order is disregarded. A product-one sequence is a sequence whose elements can be ordered such that their product equals the identity element of the group. The set of all product-one sequences over $G$ (with concatenation of sequences as the operation) is a finitely generated C-monoid. Product-one sequences over dihedral groups have a variety of extremal properties. This article provides a detailed investigation, with methods from arithmetic combinatorics, of the arithmetic of the monoid of product-one sequences over dihedral groups.

  • Open Access

    On sets with small sumset and m-sum-free sets in Z/pZ

    by Pablo Candela, Diego González-Sánchez, David J. Grynkiewicz

    The $3k-4$ conjecture in groups $\mathbb{Z}/p\mathbb{Z}$ for $p$ prime states that if $A$ is a nonempty subset of $\mathbb{Z}/p\mathbb{Z}$ satisfying $2A\neq \mathbb{Z}/p\mathbb{Z}$ and $|2A|=2|A|+r \leq \min\{3|A|-4,\;p-r-4\}$, then $A$ is covered by an arithmetic progression of size at most $|A|+r+1$. A theorem of Serra and Z\'emor proves the conjecture provided $r\leq 0.0001|A|$, without any additional constraint on $|A|$. Subject to the mild additional constraint $|2A|\leq 3p/4$ (which is optimal in a sense explained in the paper), our first main result improves the bound on $r$, allowing $r\leq 0.1368|A|$. We also prove a variant which further improves this bound on $r$ provided $A$ is sufficiently dense. We then give several applications. First we apply the above variant to give a new upper bound for the maximal density of $m$-sum-free sets in $\mathbb{Z}/p\mathbb{Z}$, i.e., sets $A$ having no solution $(x,y,z)\in A^3$ to the equation $x+y=mz$, where $m\geq 3$ is a fixed integer. The previous best upper bound for this maximal density was $1/3.0001$ (using the Serra-Z\'emor Theorem). We improve this to $1/3.1955$. We also present a construction following an idea of Schoen, which yields a lower bound for this maximal density of the form $1/8+o(1)_{p\to\infty}$. Another application of our main results concerns sets of the form $\frac{A+A}{A}$ in $\mathbb{F}_p$, and we also improve the structural description of large sum-free sets in $\mathbb{Z}/p\mathbb{Z}$.

  • Open Access

    A Single Set Improvement to the $3k-4$ Theorem

    by David J. Grynkiewicz

    The $3k-4$ Theorem is a classical result which asserts that if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with \begin{equation}\label{hyp}|A+B|=|A|+|B|+r\leq |A|+|B|+\min\{|A|,\,|B|\}-3-\delta,\end{equation} where $\delta=1$ if $A$ and $B$ are translates of each other, and otherwise $\delta=0$, then there are arithmetic progressions $P_A$ and $P_B$ of common difference such that $A\subseteq P_A$, $B\subseteq P_B$, $|B|\leq |P_B|+r+1$ and $|P_A|\leq |A|+r+1$. It is one of the few cases in Freiman's Theorem for which exact bounds on the sizes of the progressions are known. The hypothesis above is best possible in the sense that there are examples of sumsets $A+B$ having cardinality just one more, yet $A$ and $B$ cannot both be contained in short length arithmetic progressions. In this paper, we show that the hypothesis above can be significantly weakened and still yield the same conclusion for one of the sets $A$ and $B$. Specifically, if $|B|\geq 3$, $s\geq 1$ is the unique integer with $$(s-1)s\left(\frac{|B|}{2}-1\right)+s-1<|A|\leq s(s+1)\left(\frac{|B|}{2}-1\right)+s,$$ and \begin{equation}\label{hyp2} |A+B|=|A|+|B|+r< (\frac{|A|}{s}+\frac{|B|}{2}-1)(s+1),\end{equation} then we show there is an arithmetic progression $P_B\subseteq \mathbb Z$ with $B\subseteq P_B$ and $|P_B|\leq |B|+r+1$. The above hypothesis is best possible (without additional assumptions on $A$) for obtaining such a conclusion.