Results 71 to 80 of about 18,175 (189)
ABSTRACT In this paper, we continue the development of the Cartan neural networks programme, launched with three previous publications, by focusing on some mathematical foundational aspects that we deem necessary for our next steps forward. The mathematical and conceptual results are diverse and span various mathematical fields, but the inspiring ...
Pietro Fré +4 more
wiley +1 more source
Pentavalent arc-transitive Cayley graphs on Frobenius groups with soluble vertex stabilizer
A Cayley graph Γ is said to be arc-transitive if its full automorphism group AutΓ is transitive on the arc set of Γ. In this paper we give a characterization of pentavalent arc-transitive Cayley graphs on a class of Frobenius groups with soluble vertex ...
Liu Hailin
doaj +1 more source
Certifying Anosov representations
Abstract By providing new finite criteria which certify that a finitely generated subgroup of SL(d,R)$\operatorname{SL}(d,\operatorname{\mathbb {R}})$ or SL(d,C)$\operatorname{SL}(d,\mathbb {C})$ is projective Anosov, we obtain a practical algorithm to verify the Anosov condition.
J. Maxwell Riestenberg
wiley +1 more source
A Neumaier graph is a non-complete edge-regular graph with the property that it has a regular clique. In this paper, we study Neumaier Cayley graphs. We give a necessary and sufficient condition under which a Neumaier Cayley graph is a strongly regular Neumaier Cayley graph. We also characterize Neumaier Cayley graphs with small valency at most $10$.
openaire +2 more sources
Graphical small cancellation and hyperfiniteness of boundary actions
Abstract We study actions of (infinitely presented) graphical small cancellation groups on the Gromov boundaries of their coned‐off Cayley graphs. We show that a class of graphical small cancellation groups, including (infinitely presented) classical small cancellation groups, admit hyperfinite boundary actions, more precisely, the orbit equivalence ...
Chris Karpinski +2 more
wiley +1 more source
Abstract In this paper we investigate the class of Cayley partitionable graphs. This investigation is motivated by the Strong Perfect Graph Conjecture. Cayley partitionable graphs are Cayley Graphs which are closely related to near-factorizations of finite groups. We prove some structural properties of near-factorizations and give examples of Cayley
openaire +4 more sources
Perfect state transfer in unitary Cayley graphs over local rings [PDF]
In this work, using eigenvalues and eigenvectors of unitary Cayley graphs over finite local rings and elementary linear algebra, we characterize which local rings allowing PST occurring in its unitary Cayley graph.
Yotsanan Meemark , Songpon Sriwongsa
doaj
Edge-Transitivity of Cayley Graphs Generated by Transpositions
Let S be a set of transpositions generating the symmetric group Sn (n ≥ 5). The transposition graph of S is defined to be the graph with vertex set {1, . . . , n}, and with vertices i and j being adjacent in T(S) whenever (i, j) ∈ S. In the present note,
Ganesan Ashwin
doaj +1 more source
Uniform growth in small cancellation groups
Abstract An open question asks whether every group acting acylindrically on a hyperbolic space has uniform exponential growth. We prove that the class of groups of uniform uniform exponential growth acting acylindrically on a hyperbolic space is closed under taking certain geometric small cancellation quotients.
Xabier Legaspi, Markus Steenbock
wiley +1 more source
Color Energy Of A Unitary Cayley Graph
Let G be a vertex colored graph. The minimum number χ(G) of colors needed for coloring of a graph G is called the chromatic number. Recently, Adiga et al.
Adiga Chandrashekar +2 more
doaj +1 more source

