Automorphic Bloch theorems for hyperbolic lattices

J Maciejko, S Rayan - … of the National Academy of Sciences, 2022 - National Acad Sciences
Hyperbolic lattices are a new form of synthetic quantum matter in which particles effectively
hop on a discrete tessellation of two-dimensional (2D) hyperbolic space, a non-Euclidean …

[图书][B] Handbook of computational group theory

DF Holt, B Eick, EA O'Brien - 2005 - taylorfrancis.com
The origins of computation group theory (CGT) date back to the late 19th and early 20th
centuries. Since then, the field has flourished, particularly during the past 30 to 40 years, and …

Flat bands and band-touching from real-space topology in hyperbolic lattices

T Bzdušek, J Maciejko - Physical Review B, 2022 - APS
Motivated by the recent experimental realizations of hyperbolic lattices in circuit quantum
electrodynamics and in classical electric-circuit networks, we study flat bands and band …

[图书][B] Group-theoretic algorithms and graph isomorphism

CM Hoffmann - 1982 - Springer
Recall that the distance of a vertex u from a vertex v in the graph X is the length of a shortest
path between u and v. Similarly, if e=(vl, v2) is an edge of X, we define the distance of a …

An elementary introduction to coset table methods in computational group theory

J Neubüser - Groups-St. Andrews, 1981 - books.google.com
1 11.; in fact the method can be reduced to a purely mechanical process, which becomes a
useful tool with a wide range of application. we venture to predict that our.... method will …

Some results on quotients of triangle groups

MDE Conder - Bulletin of the Australian Mathematical Society, 1984 - cambridge.org
Given positive integers k, l, m, the (k, l, m) triangle group has presentation δ (k, l, m)=< X, Y,
Z| Xk= Yl= Zm= XYZ= 1>. This paper considers finite permutation representations of such …

Some group-theoretic algorithms

CC Sims - Topics in Algebra: Proceedings, 18th Summer …, 1978 - Springer
Group theorists have been attempting to construct algorithms for working with groups, both
finite and infinite, for many years. It turns out that in order to solve a problem about a given …

Applications and adaptations of the low index subgroups procedure

M Conder, P Dobcsányi - Mathematics of computation, 2005 - ams.org
The low-index subgroups procedure is an algorithm for finding all subgroups of up to a given
index in a finitely presented group $ G $ and hence for determining all transitive permutation …

[HTML][HTML] Small volume 3-manifolds constructible from string Coxeter groups of rank 4

M Conder, G Liversidge - Journal of Algebra, 2023 - Elsevier
It is well known that various compact 3-manifolds of small volume can be constructed via the
determination of torsion-free subgroups of minimum possible index in certain rank 4 string …

Бесконечные группы

ГА Носков, ВН Ремесленников… - Итоги науки и техники …, 1979 - mathnet.ru
Дается обзор работ по следующим темам: комбинаторная теория групп, многообразия
групп, периодические группы, разрешимые группы, финитно-аппроксимируемые группы …