Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userWord Length Perturbations in Certain Symmetric Presentations of Dihedral Groups
58
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities called $lambda_{1}$ and $lambda_{2}$ have been defined that allow for a precise measure of how stable a group is under certain types of small perturbations in the generating expressions for the elements of the group. These quantities provide a means to measure differences among all possible paths in a Cayley graph for a group, establish a group theoretic analog for the notion of stability in nonlinear dynamical systems, and play an important role in the application of groups to computational genomics. In this paper, we further expose the fundamental properties of $lambda_{1}$ and $lambda_{2}$ by establishing their bounds when the underlying group is a dihedral group. An essential step in our approach is to completely characterize so-called symmetric presentations of the dihedral groups, providing insight into the manner in which $lambda_{1}$ and $lambda_{2}$ interact with finite group presentations. This is of interest independent of the study of the quantities $lambda_{1},; lambda_{2}$. Finally, we discuss several conjectures and open questions for future consideration.
rate research
Read More
A subset $B$ of a group $G$ is called a difference basis of $G$ if each element $gin G$ can be written as the difference $g=ab^{-1}$ of some elements $a,bin B$. The smallest cardinality $|B|$ of a difference basis $Bsubset G$ is called the difference size of $G$ and is denoted by $Delta[G]$. The fraction $eth[G]:=Delta[G]/{sqrt{|G|}}$ is called the difference characteristic of $G$. We prove that for every $ninmathbb N$ the dihedral group $D_{2n}$ of order $2n$ has the difference characteristic $sqrt{2}leeth[D_{2n}]leqfrac{48}{sqrt{586}}approx1.983$. Moreover, if $nge 2cdot 10^{15}$, then $eth[D_{2n}]<frac{4}{sqrt{6}}approx1.633$. Also we calculate the difference sizes and characteristics of all dihedral groups of cardinality $le80$.
We introduce a new method for computing the word length of an element of Thompsons group F with respect to a consecutive generating set of the form X_n={x_0,x_1,...,x_n}, which is a subset of the standard infinite generating set for F. We use this method to show that (F,X_n) is not almost convex, and has pockets of increasing, though bounded, depth dependent on n.
In this paper, we find a strong new restriction on the structure of CI-groups. We show that, if $R$ is a generalised dihedral group and if $R$ is a CI-group, then for every odd prime $p$ the Sylow $p$-subgroup of $R$ has order $p$, or $9$. Consequently, any CI-group with quotient a generalised dihedral group has the same restriction, that for every odd prime $p$ the Sylow $p$-subgroup of the group has order $p$, or $9$. We also give a counter example to the conjecture that every BCI-group is a CI-group.
A Cayley (di)graph $Cay(G,S)$ of a group $G$ with respect to $S$ is said to be normal if the right regular representation of $G$ is normal in the automorphism group of $Cay(G,S)$, and is called a CI-(di)graph if there is $alphain Aut(G)$ such that $S^alpha=T$, whenever $Cay(G,S)cong Cay(G,T)$ for a Cayley (di)graph $Cay(G,T)$. A finite group $G$ is called a DCI-group or a NDCI-group if all Cayley digraphs or normal Cayley digraphs of $G$ are CI-digraphs, and is called a CI-group or a NCI-group if all Cayley graphs or normal Cayley graphs of $G$ are CI-graphs, respectively. Motivated by a conjecture proposed by Adam in 1967, CI-groups and DCI-groups have been actively studied during the last fifty years by many researchers in algebraic graph theory. It takes about thirty years to obtain the classification of cyclic CI-groups and DCI-groups, and recently, the first two authors, among others, classified cyclic NCI-groups and NDCI-groups. Even though there are many partial results on dihedral CI-groups and DCI-groups, their classification is still elusive. In this paper, we prove that a dihedral group of order $2n$ is a NCI-group or a NDCI-group if and only if $n=2,4$ or $n$ is odd. As a direct consequence, we have that if a dihedral group $D_{2n}$ of order $2n$ is a DCI-group then $n=2$ or $n$ is odd-square-free, and that if $D_{2n}$ is a CI-group then $n=2,9$ or $n$ is odd-square-free, throwing some new light on classification of dihedral CI-groups and DCI-groups.
We study an impartial game introduced by Anderson and Harary. This game is played by two players who alternately choose previously-unselected elements of a finite group. The first player who builds a generating set from the jointly-selected elements wins. We determine the nim-numbers of this game for generalized dihedral groups, which are of the form $operatorname{Dih}(A)= mathbb{Z}_2 ltimes A$ for a finite abelian group $A$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
