Results 81 to 90 of about 20,494 (188)

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, Tengren Zhang, Andrew Zimmer   +2 more
wiley   +1 more source

Automorphisms of Cayley graphs on generalised dicyclic groups

, 2013
A graph is called a GRR if its automorphism group acts regularly on its vertex-set. Such a graph is necessarily a Cayley graph. Godsil has shown that there are only two infinite families of finite groups that do not admit GRRs : abelian groups and ...
Morris, Joy, Spiga, Pablo, Verret, Gabriel   +2 more
core  

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, Erik Duse, István Prause, Xiao Zhong   +3 more
wiley   +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, Vu Tuan Hai, Le Bin Ho   +2 more
wiley   +1 more source

L(2, 1)-Labeling of Circulant Graphs

Discussiones Mathematicae Graph Theory, 2019
An L(2, 1)-labeling of a graph Γ is an assignment of non-negative integers to the vertices such that adjacent vertices receive labels that differ by at least 2, and those at a distance of two receive labels that differ by at least one.
Mitra Sarbari, Bhoumik Soumya
doaj   +1 more source

Genus of total graphs from rings: A survey

AKCE International Journal of Graphs and Combinatorics, 2018
Let R be a commutative ring. The total graph T Γ ( R ) of R is the undirected graph with vertex set R and two distinct vertices x and y are adjacent if x + y is a zero divisor in R . In this paper, we present a survey of results on the genus of T Γ ( R )
T. Tamizh Chelvam, T. Asir
doaj   +1 more source

Absorption cayley graph

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, Sean Dewar, Daniel Green Tripp, James Maxwell, Anthony Nixon, Yue Ren, Ben Smith   +6 more
wiley   +1 more source

Simulations of Cayley graphs of dihedral group [PDF]

ITM Web of Conferences
Let Γ be a finite group with identity element e and let S ⊆ Γ − {e} which is inverse-closed, i.e., S = S−1 := {s−1 : s ∈ S}. An undirected Cayley graph on a group Γ with connection set S, denoted by Cay(Γ, S), is a graph with vertex set Γ and edges xy ...
Farhan Mohammad, John Peter, Silaban Denny Riama   +2 more
doaj   +1 more source