Results 81 to 90 of about 18,175 (189)
On the ET0L subgroup membership problem in bounded automata groups
Journal of the London Mathematical Society, Volume 113, Issue 4, April 2026.Abstract We are interested in the subgroup membership problem in groups acting on rooted d$d$‐regular trees and a natural class of subgroups, the stabilisers of infinite rays emanating from the root. These rays, which can also be viewed as infinite words in the alphabet with d$d$ letters, form the boundary of the tree.
Alex Bishop +5 more
wiley +1 more source
Complete Rotations in Cayley Graphs
European Journal of Combinatorics, 2001 Consider a Cayley graph \(\text{Cay}(G,S)\) of a finite group \(G\) generated by a set \(S=S^{-1}=\{s_0,\ldots,s_{|S|-1}\}\) where \(1\notin S\). A bijection \(\omega:G\to G\) is called a complete rotation of the graph if \(\omega(1)=1\) and \(\omega(xs_i)=\omega(x)s_{i+1}\) for all \(x\in G\) and all \(i\in{\mathbb{Z}}_{|S|}\).
Heydemann, Marie-Claude +2 more
openaire +1 more source
Entropy rigidity for cusped Hitchin representations
Journal of Topology, Volume 19, Issue 1, March 2026.Abstract We establish an entropy rigidity theorem for Hitchin representations of geometrically finite Fuchsian groups which generalizes a theorem of Potrie and Sambarino for Hitchin representations of closed surface groups. In the process, we introduce the class of (1,1,2)‐hypertransverse groups and show for such a group that the Hausdorff dimension of
Richard Canary +2 more
wiley +1 more source
Isomorphisms of generalized Cayley graphs
Ars Mathematica Contemporanea, 2018 Summary: In this paper, we investigate the isomorphism problems of the generalized Cayley graphs, which are generalizations of the traditional Cayley graphs. We find that there are two types of natural isomorphisms for the generalized Cayley graphs. We also study the GCI-groups among the generalized Cayley graphs, and the Cayley regressions of some ...
Feng, Lihua, Liu, Weijun, Yang, Xu
openaire +4 more sources
Dimer models and conformal structures
Communications on Pure and Applied Mathematics, Volume 79, Issue 2, Page 340-446, February 2026.Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala +3 more
wiley +1 more source
Barycentric Subdivision of Cayley Graphs With Constant Edge Metric Dimension
IEEE Access, 2020 A motion of a robot in space is represented by a graph. A robot change its position from point to point and its position can be determined itself by distinct labelled landmarks points.
Ali N. A. Koam, Ali Ahmad
doaj +1 more source
Advancing Quantum Process Tomography Through Quantum Compilation
Advanced Quantum Technologies, Volume 9, Issue 2, February 2026.A compilation‐based quantum process tomography (CQPT) framework is introduced for efficient characterization of noisy quantum dynamics. The method reconstructs quantum processes using single‐shot measurements and trainable process representations, avoiding full POVM tomography.
Huynh Le Dan Linh +2 more
wiley +1 more source
Electronic Notes in Discrete Mathematics, 2016 Abstract Let R be a commutative ring with two binary operators addition (+) and multiplication (.). Then Z n is a ring of integers modulo n, where n is a positive integer. A Absorption Cayley graph denoted by Ω ( Z n ) is a graph whose vertex set is Z n , the integer modulo n and edge set E = { a b ...
null Deepa Sinha, null Deepakshi Sharma
openaire +1 more source
A tropical approach to rigidity: Counting realisations of frameworks
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract A realisation of a graph in the plane as a bar‐joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these finitely many realisations can be seen as a solution to a system of quadratic equations prescribing the distances between pairs of points.
Oliver Clarke +6 more
wiley +1 more source
ON (3,6) AND (4,6) - FULLERENE CAYLEY GRAPHS
Studia Universitatis Babes-Bolyai Chemia, 2016 An (r, s)-fullerene graph is a planar 3-regular graph with only Cr and Cs faces, where Cn denotes a cycle of length n. In this paper, the (3,6)-fullerene Cayley graphs constructed from finite groups are classified.
Ali Reza ASHRAFI +2 more
doaj