Results 81 to 90 of about 775 (197)

On the fixed‐point proportion of self‐similar groups

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.
Abstract We prove that super strongly fractal groups acting on regular rooted trees have null fixed‐point proportion. In particular, we show that the fixed‐point proportion of an infinite family of iterated monodromy groups of exceptional complex polynomials has the same property.
Jorge Fariña‐Asategui, Santiago Radi
wiley   +1 more source

Upper bounds of orders of automorphism groups of leafless metric graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
We prove a tropical analogue of the theorem of Hurwitz: A leafless metric graph of genus [Formula: see text] has at most 12 automorphisms when g = 2 and [Formula: see text] automorphisms when [Formula: see text].
Yusuke Nakamura, JuAe Song
doaj   +1 more source

Automorphism Properties and Classification of Adinkras

open access: yesAdvances in Mathematical Physics, 2015
Adinkras are graphical tools for studying off-shell representations of supersymmetry. In this paper we efficiently classify the automorphism groups of Adinkras relative to a set of local parameters.
B. L. Douglas   +3 more
doaj   +1 more source

Sylow subgroups and the number of irreducible characters of degrees divisible by a prime p$p$

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.
Abstract Let G$G$ be a finite group and p$p$ be a prime. We establish an upper bound for the derived length of a Sylow p$p$‐subgroup of G$G$ in terms of the number of irreducible characters of G$G$ whose degrees are divisible by p$p$. We also prove that if B$B$ is a p$p$‐block of a finite p$p$‐solvable group G$G$ with defect group D$D$, then the ...
James P. Cossey   +3 more
wiley   +1 more source

The Automorphism Group of a Hypercube

open access: yesJ. Univers. Comput. Sci., 2000
JUCS - Journal of Universal Computer Science Volume Nr.
openaire   +3 more sources

Automorphisms in Varieties of Groups

open access: yesJournal of Algebra, 1995
If \(N\) is a characteristic subgroup of the group \(G\), then each automorphism of \(G\) induces an automorphism on \(G/N\) and so there is a homomorphism \(\pi:\text{Aut}(G)\to\text{Aut}(G/N)\). Thus if \(V\) is a variety of groups, \(V(F_n)\) the verbal subgroup corresponding to \(V\) and \(F_n(V)\cong F_n/V(F)\) the relatively free group of \(V ...
Bryant, R. M., Papistas, A. I.
openaire   +3 more sources

On the theories classified by an étendue

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.
Abstract We give a model‐theoretic characterisation of the geometric theories classified by étendues—the ‘locally localic’ topoi. They are the theories where each model is determined, syntactically and semantically, by any witness of a fixed collection of formulae.
Joshua L. Wrigley
wiley   +1 more source

Topological rigidity of automorphism systems

open access: yesNantong Daxue xuebao. Ziran kexue ban
This paper studies the automorphism actions of countable discrete groups on the étale equivalence relations on compact metric spaces. First, the notion of continuous strong orbit equivalence for automorphism systems is introduced and it is proved that ...
QIANG Xiangqi
doaj   +1 more source

Central Automorphisms of Zappa–Szép Products [PDF]

open access: yesAdvances in Group Theory and Applications
In this paper, the central automorphism group of the Zappa-Szép product of two groups is obtained.
Ratan Lal, Vipul Kakkar
doaj   +1 more source

An elegant model of the geodesic flow on the modular surface

open access: yesJournal of the London Mathematical Society, Volume 114, Issue 1, July 2026.
Abstract Caroline Series' [The modular surface and continued fractions, J. Lond. Math. Soc. (2), 31, no. 1, (1985), 69–80] gives a clear framework linking, in a deceptively simple way, the dynamics of the geodesic flow on the modular surface with the dynamics of the regular continued fraction, through a well‐chosen symbolic coding.
Pierre Arnoux, Thomas A. Schmidt
wiley   +1 more source

Home - About - Disclaimer - Privacy