Related papers: Difference bases in dihedral groups

A subset $B$ of an Abelian group $G$ is called a difference basis of $G$ if each element $g\in G$ can be written as the difference $g=a-b$ of some elements $a,b\in B$. The smallest cardinality $|B|$ of a difference basis $B\subset G$ is…

A subset $B$ of a group $G$ is called a difference basis of $G$ if each element $g\in G$ can be written as the difference $g=ab^{-1}$ of some elements $a,b\in B$. The smallest cardinality $|B|$ of a difference basis $B\subset G$ is called…

Let $F_n$ be a free group of rank $n$, with free generating set $X$. A subset $D$ of $F_n$ is a \emph{Distinct Difference Configuration} if the differences $g^{-1}h$ are distinct, where $g$ and $h$ range over all (ordered) pairs of distinct…

Bridging the work of Cameron, Harary, and others, we examine the base size set B(G) and determining set D(G) of several families of groups. The base size set is the set of base sizes of all faithful actions of the group G on finite sets.…

The Harborth constant of a finite group $G$, denoted $\gs(G)$, is the smallest integer $k$ such that the following holds: For $A\subseteq G$ with $|A|=k$, there exists $B\subseteq A$ with $|B|=\exp(G)$ such that the elements of $B$ can be…

We study finite groups $G$ having a subgroup $H$ and $D \subset G \setminus H$ such that the multiset $\{ xy^{-1}:x,y \in D\}$ has every non-identity element occur the same number of times (such a $D$ is called a {\it difference set}). We…

A graph $G$ is said to be $d$-distinguishable if there is a labeling of the vertices with $d$ labels so that only the trivial automorphism preserves the labels. The smallest such $d$ is the distinguishing number, Dist($G$). A subset of…

A difference basis with respect to $n$ is a subset $A \subseteq \mathbb{Z}$ such that $A - A \supseteq \{1, \ldots, n\}$. R\'{e}dei and R\'{e}nyi showed that the minimum size of a difference basis with respect to $n$ is $(c+o(1))\sqrt{n}$…

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…

For a finite subset $A$ of a group $G$, we define the right quotient set and the left quotient set of $A$, respectively, as $AA^{-1} := \{a_1a_2^{-1}:a_1,a_2\in A\}$, $A^{-1}A := \{a_1^{-1}a_2:a_1,a_2\in A\}$. While the right and left…

Let $G$ be a finite group and $K$ a field containing an element of multiplicative order $|G|$. It is shown that if $G$ has a cyclic subgroup of index at most $2$, then the separating Noether number over $K$ of $G$ coincides with the Noether…

Given a group $G$, we say that a set $A \subseteq G$ has more sums than differences (MSTD) if $|A+A| > |A-A|$, has more differences than sums (MDTS) if $|A+A| < |A-A|$, or is sum-difference balanced if $|A+A| = |A-A|$. A problem of recent…

The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The minimum size of a label class in such a labeling of $G$ with…

Introduced by Albertson et al. \cite{albertson}, the distinguishing number $D(G)$ of a graph $G$ is the least integer $r$ such that there is a $r$-labeling of the vertices of $G$ that is not preserved by any nontrivial automorphism of $G$.…

The Difference graph $\mathcal{D}(G)$ of a finite group $G$ is the difference of the enhanced power graph $\mathcal{P}_{E}(G)$ and the power graph $\mathcal{P}(G)$ with all the isolated vertices removed. In this paper, we characterize the…

An irreducible smooth representation of a $p$-adic group $G$ is said to be distinguished with respect to a subgroup $H$ if it admits a non-trivial $H$-invariant linear form. When $H$ is the fixed group of an involution on $G$ it is…

The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved only by a trivial automorphism. A set $S$ of vertices in $G$…

If V is a representation of a linear algebraic group G, a set S of G-invariant regular functions on V is called separating if the following holds: If two elements v,v' from V can be separated by an invariant function, then there is an f…

A graph G is distinguished if its vertices are labelled by a map \phi: V(G) \longrightarrow {1,2,...,k} so that no graph automorphism preserves \phi. The distinguishing number of G is the minimum number k necessary for \phi to distinguish…

Let $G$ be a permutation group acting on a set $V$. A partition $\pi$ of $V$ is distinguishing if the only element of $G$ that fixes each cell of $\pi$ is the identity. The distinguishing number of $G$ is the minimum number of cells in a…