Cayley Graph on Nilpotent Groups with and without Hamilton Path

Author(s):  
Mohammad Badrul Alam Miah ◽  
Afroza Akter
2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Daniel El-Baz ◽  
Carlo Pagano

Abstract We prove the existence of a limiting distribution for the appropriately rescaled diameters of random undirected Cayley graphs of finite nilpotent groups of bounded rank and nilpotency class, thus extending a result of Shapira and Zuck which dealt with the case of abelian groups. The limiting distribution is defined on a space of unimodular lattices, as in the case of random Cayley graphs of abelian groups. Our result, when specialised to a certain family of unitriangular groups, establishes a very recent conjecture of Hermon and Thomas. We derive this as a consequence of a general inequality, showing that the diameter of a Cayley graph of a nilpotent group is governed by the diameter of its abelianisation.


2014 ◽  
Vol 51 (4) ◽  
pp. 547-555 ◽  
Author(s):  
B. Wehrfritz

Let G be a nilpotent group with finite abelian ranks (e.g. let G be a finitely generated nilpotent group) and suppose φ is an automorphism of G of finite order m. If γ and ψ denote the associated maps of G given by \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\gamma :g \mapsto g^{ - 1} \cdot g\phi and \psi :g \mapsto g \cdot g\phi \cdot g\phi ^2 \cdots \cdot \cdot g\phi ^{m - 1} for g \in G,$$ \end{document} then Gγ · kerγ and Gψ · ker ψ are both very large in that they contain subgroups of finite index in G.


2020 ◽  
Vol 23 (4) ◽  
pp. 641-658
Author(s):  
Gunnar Traustason ◽  
James Williams

AbstractIn this paper, we continue the study of powerfully nilpotent groups. These are powerful p-groups possessing a central series of a special kind. To each such group, one can attach a powerful nilpotency class that leads naturally to the notion of a powerful coclass and classification in terms of an ancestry tree. In this paper, we will give a full classification of powerfully nilpotent groups of rank 2. The classification will then be used to arrive at a precise formula for the number of powerfully nilpotent groups of rank 2 and order {p^{n}}. We will also give a detailed analysis of the ancestry tree for these groups. The second part of the paper is then devoted to a full classification of powerfully nilpotent groups of order up to {p^{6}}.


Author(s):  
Ashwin Sah ◽  
Mehtaab Sawhney ◽  
Yufei Zhao

Abstract Does every $n$-vertex Cayley graph have an orthonormal eigenbasis all of whose coordinates are $O(1/\sqrt{n})$? While the answer is yes for abelian groups, we show that it is no in general. On the other hand, we show that every $n$-vertex Cayley graph (and more generally, vertex-transitive graph) has an orthonormal basis whose coordinates are all $O(\sqrt{\log n / n})$, and that this bound is nearly best possible. Our investigation is motivated by a question of Assaf Naor, who proved that random abelian Cayley graphs are small-set expanders, extending a classic result of Alon–Roichman. His proof relies on the existence of a bounded eigenbasis for abelian Cayley graphs, which we now know cannot hold for general groups. On the other hand, we navigate around this obstruction and extend Naor’s result to nonabelian groups.


2021 ◽  
Vol 20 (3) ◽  
Author(s):  
Ying Liu ◽  
Jia-bin Yuan ◽  
Wen-jing Dai ◽  
Dan Li

2020 ◽  
Vol 23 (5) ◽  
pp. 801-829
Author(s):  
Mark Pengitore

AbstractThe function {\mathrm{F}_{G}(n)} gives the maximum order of a finite group needed to distinguish a nontrivial element of G from the identity with a surjective group morphism as one varies over nontrivial elements of word length at most n. In previous work [M. Pengitore, Effective separability of finitely generated nilpotent groups, New York J. Math. 24 2018, 83–145], the author claimed a characterization for {\mathrm{F}_{N}(n)} when N is a finitely generated nilpotent group. However, a counterexample to the above claim was communicated to the author, and consequently, the statement of the asymptotic characterization of {\mathrm{F}_{N}(n)} is incorrect. In this article, we introduce new tools to provide lower asymptotic bounds for {\mathrm{F}_{N}(n)} when N is a finitely generated nilpotent group. Moreover, we introduce a class of finitely generated nilpotent groups for which the upper bound of the above article can be improved. Finally, we construct a class of finitely generated nilpotent groups N for which the asymptotic behavior of {\mathrm{F}_{N}(n)} can be fully characterized.


2015 ◽  
Vol 143 (11) ◽  
pp. 4723-4731 ◽  
Author(s):  
Moon Duchin ◽  
Hao Liang ◽  
Michael Shapiro
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document