English
Related papers

Related papers: Large zero-free subsets of Z/pZ

200 papers

Let $G$ be a finite abelian group. Let $g(G)$ be the smallest positive integer $t$ such that every subset of cardinality $t$ of the group $G$ contains a subset of cardinality $\mathrm{exp}(G)$ whose sum is zero. In this paper, we show that…

Number Theory · Mathematics 2020-05-26 Srilakshmi Krishnamoorthy , Karthikesh , Umesh Shankar

We study subsets of $\mathbb{F}_p^n$ that do not contain progressions of length $k$. We denote by $r_k(\mathbb{F}_p^n)$ the cardinality of such subsets containing a maximal number of elements. In this paper we focus on the case $k=p$ and…

Given a finite set $A\subseteq \mathbb{N}$, define the sum set $$A+A = \{a_i+a_j\mid a_i,a_j\in A\}$$ and the difference set $$A-A = \{a_i-a_j\mid a_i,a_j\in A\}.$$ The set $A$ is said to be sum-dominant if $|A+A|>|A-A|$. Hegarty used a…

Number Theory · Mathematics 2020-01-16 Hung Viet Chu

If E(z,s) is the nonholomorphic Eisenstein series on the upper half plane, then for all y sufficiently large, E(z,s) has a "Siegel zero." That is E(z,\beta)=0 for a real number \beta just to the left of one. We give a generalization of this…

Number Theory · Mathematics 2007-05-23 Joseph Hundley

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

Group Theory · Mathematics 2021-02-23 Yanis Amirou

Let $p$ be a prime number with $p\equiv 2\pmod{3}$ and let $n\ge 1$ be a dimension. It is known that a sum-free subset of ${\mathbb F}_p^n$ can have at most the size $\frac13(p+1)p^{n-1}$ and that, up to automorphisms of ${\mathbb F}_p^n$,…

Combinatorics · Mathematics 2024-08-29 Christian Reiher , Sofia Zotova

We prove the existence of a genus-zero complete maximal map with a prescribed singularity set and an arbitrary number of simple and complete ends. We also discuss the conditions under which this maximal map can be made into a complete…

Differential Geometry · Mathematics 2023-06-16 Pradip Kumar , Sai Rashmi Ranjan Mohanty

Let $A$ be a finite subset of an arbitrary additive group $G$, and let $\phi(A)$ denote the cardinality of the largest subset $B$ in $A$ that is sum-avoiding in $A$ (that is to say, $b_1+b_2 \not \in A$ for all distinct $b_1,b_2 \in B$).…

Combinatorics · Mathematics 2017-01-18 Terence Tao , Van Vu

Let $p$ be a prime number, $a_1, a_2, \ldots a_{4p-4}$ a sequence of elements in $(\mathbb{Z}/p\\mathbb{Z})^2$, which does not contain a subsequence of length $p$ which adds up to 0. We show that if $p$ is sufficiently large, then the…

Number Theory · Mathematics 2025-09-03 Schlage-Puchta , Jan-Christoph

Let $p$ be a prime. In this paper we classify the $p$-structure of those finite $p$-separable groups such that, given any three non-central conjugacy classes of $p$-regular elements, two of them necessarily have coprime lengths.

Group Theory · Mathematics 2025-02-25 María José Felipe , Marc Kelly Jean-Philippe , Víctor Sotomayor

A subset X of a group G is a set of pairwise non-commuting ele- ments if ab 6= ba for any two distinct elements a and b in X. If jXj ? jY j for any other set of pairwise non-commuting elements Y in G, then X is said to be a maximal subset…

Group Theory · Mathematics 2014-12-16 Mohammad Zarrin

Suppose that $A,B$ are two non-empty subsets of the finite nilpotent group $G$. If $A\not=B$, then the cardinality of the restricted sumset $$A\dotplus B={a+b: a\in A, b\in B, a\neq b} $$ is at least $$\min{p(G),|A|+|B|-2},$$ where $p(G)$…

Combinatorics · Mathematics 2012-08-22 Shanshan Du , Hao Pan

The prime-coprime graph $\Theta(G)$ of a finite group $G$ is the simple graph with vertex set $G$, where two distinct elements are adjacent whenever the greatest common divisor of their orders is either $1$ or a prime. We characterize all…

Group Theory · Mathematics 2026-04-21 Ravi Ranjan , Shubh Narayan Singh , Surbhi Kumari , Shidra Jamil

For $X$ a separable metric space define $\pp(X)$ to be the smallest cardinality of a subset $Z$ of $X$ which is not a relative $\ga$-set in $X$, i.e., there exists an $\om$-cover of $X$ with no $\ga$-subcover of $Z$. We give a…

Logic · Mathematics 2007-05-23 Arnold W. Miller

Let $G$ be a group. A subset $D$ of $G$ is a determining set of $G$, if every automorphism of $G$ is uniquely determined by its action on $D$. The determining number of $G$, denoted by $\alpha(G)$, is the cardinality of a smallest…

Group Theory · Mathematics 2018-01-26 Dengyin Wang , Shikun Ou , Haipeng Qu

An equation to compute the dp-rank of any abelian group is given. It is also shown that its dp-rank, or more generally that of any one-based group, agrees with its Vapnik-Chervonenkis density. Furthermore, strong abelian groups are…

Logic · Mathematics 2019-09-18 Yatir Halevi , Daniel Palacín

Answering a question of P. Erdos from 1965, we show that for every eps>0 there is a set A of n integers with the following property: every subset A' of A with at least (1/3 + eps)n elements contains three distinct elements x,y,z with x + y…

Combinatorics · Mathematics 2014-11-10 Sean Eberhard , Ben Green , Freddie Manners

We show that a zero-sum-free sequence of length $n$ over an abelian group spans at least $2n$ distinct subsequence sums, unless it possesses a rigid, easily-described structure.

Combinatorics · Mathematics 2022-06-02 Vsevolod F. Lev

A subset $A$ of a group $G$ is called product-free if there is no solution to $a=bc$ with $a,b,c$ all in $A$. It is easy to see that the largest product-free subset of the symmetric group $S_n$ is obtained by taking the set of all odd…

Combinatorics · Mathematics 2022-05-31 Peter Keevash , Noam Lifshitz , Dor Minzer

In this paper, we study minimal (with respect to inclusion) zero forcing sets. We first investigate when a graph can have polynomially or exponentially many distinct minimal zero forcing sets. We also study the maximum size of a minimal…

Combinatorics · Mathematics 2022-04-18 Boris Brimkov , Joshua Carlson