Related papers: Difference bases in cyclic groups

For each member $\mathcal{A}$ of a family of linear cycle sets whose underlying abelian group is cyclic of order a power of a prime number, we compute all the central extensions of $\mathcal{A}$ by an arbitrary abelian group.

A graph $G$ has a $C_k$-decomposition if its edge set can be partitioned into cycles of length $k$. We show that if $\delta(G)\geq 2|G|/3-1$, then $G$ has a $C_4$-decomposition, and if $\delta(G)\geq |G|/2$, then $G$ has a…

The separation dimension of a graph $G$, written $\pi(G)$, is the minimum number of linear orderings of $V(G)$ such that every two nonincident edges are "separated" in some ordering, meaning that both endpoints of one edge appear before…

A difference set is said to have classical parameters if $ (v,k, \lambda) = (\frac{q^d-1}{q-1}, \frac{q^{d-1}-1}{q-1}, \frac{q^{d-2}-1}{q-1}).$ The case $d=3$ corresponds to planar difference sets. We focus here on the family of abelian…

For $\Lambda$-$n$-coalescents with mutation, we analyse the size $O_n$ of the partition block of $i\in\{1,\ldots,n\}$ at the time where the first mutation appears on the tree that affects $i$ and is shared with any other…

A set $B$ is a basis for a vector space $V$ if every element of $V$ can be uniquely written as a linear combination of the elements of $B$. There is a similar definition of a basis for a finite group. We show that certain semidirect…

In this paper we study the family of cyclic codes such that its minimum distance reaches the maximum of its BCH bounds. We also show a way to construct cyclic codes with that property by means of computations of some divisors of a…

The representation dimension of a finite group $G$ is the minimal dimension of a faithful complex linear representation of $G$. We prove that the representation dimension of any finite group $G$ is at most $\sqrt{|G|}$ except if $G$ is a…

For a finite group $G$, we associate the quantity $\beta(G)=\frac{|L(G)|}{|G|}$, where $L(G)$ is the subgroup lattice of $G$. Different properties and problems related to this ratio are studied throughout the paper. We determine the second…

A permutation is defined to be cycle-up-down if it is a product of cycles that, when written starting with their smallest element, have an up-down pattern. We prove bijectively and analytically that these permutations are enumerated by the…

We prove that if $G = G_1\times\dots\times G_n$ acts essentially, properly and cocompactly on a CAT(0) cube complex X, then the cube complex splits as a product. We use this theorem to give various examples of groups for which the minimal…

We determine the minimal non-trivial integer group determinant for the dicyclic group of order $4n$ when $n$ is odd. We also discuss the set of all integer group determinants for the dicyclic groups of order $4p$.

Hall's theorem on differences of bijections characterizes the multisets $$ \{a_1,\ldots,a_{|G|}\} $$ in a finite abelian group $G$ that can be written in the form $$ a_i=b_i-c_i, $$ where both $b_1,\ldots,b_{|G|}$ and $c_1,\ldots,c_{|G|}$…

Let $G$ be a simple $n$-vertex graph and $W\subseteq\V(G)$. We say that $W$ is a $\delta_k$-small set if $$ \sqrt[k]{\frac{\sum_{v\in W}d^k(v)}{\abs W}}\leq n-\abs W. $$ Let $\varphi^{(k)}(G)$ denote the smallest natural number $r$ such…

A base for a permutation group $G$ acting on a set $\Omega$ is a sequence $\mathcal{B}$ of points of $\Omega$ such that the pointwise stabiliser $G_{\mathcal{B}}$ is trivial. The base size of $G$ is the size of a smallest base for $G$. We…

A set $\mathcal{G}$ of integers is called a $g$-Golomb ruler of length $n$ if the difference between any two distinct elements of $\mathcal{G}$ is repeated at most $g$ times. If $g=1$, these are also called $B_2$-sets, Sidon sets, and…

We determine the finite groups $G$ in which every subset $A \subseteq G$ of cardinality dividing the order of $G$ is a \emph{factor}, i.e. has a complement $B \subseteq G$ of cardinality $|G|/|A|$ such that $G = A \cdot B$ or $G = B \cdot…

Little groups are enumerated for the irreps and their components in any basis of O(3) and SO(3) up to rank 9, and for all irreps of C$_{\infty}$, C$_{\infty h}$, C$_{\infty v}$, D$_{\infty}$ and D$_{\infty h}$. The results are obtained by a…

For a finite group $G$, let $\sigma(G)$ be the number of subgroups of $G$ and $\sigma_\iota(G)$ the number of isomorphism types of subgroups of $G$. Let $L=L_r(p^e)$ denote a simple group of Lie type, rank $r$, over a field of order $p^e$…

The Cremona dimension of a group $G$ is the minimal $n$ such that $G$ is isomorphic to a subgroup of the Cremona group of birational transformations of an $n$-dimensional rational variety. In this survey article, we give many examples that…