Results 81 to 90 of about 174,454,425 (228)
Various Bounds of Group of Autocentral Automorphisms [PDF]
In this paper, we find various bounds for the group of all autocentral automorphisms of a finite group $G$. We consider the cases, where the group of all autocentral automorphisms coincides with its upper bound, that is, the group of all central ...
Arora, Harsha
core
The Haagerup property is not invariant under quasi‐isometry
Abstract Using the work of Cornulier–Valette and Whyte (see Appendix A for the latter), we show that neither the Haagerup property nor weak amenability is invariant under quasi‐isometry of finitely generated groups. Appendix B shows, using the same examples, that the same holds for vanishing of the equivariant Lp$L^p$‐compression.
Mathieu Carette +4 more
wiley +1 more source
Automorphism groups of 2-groups
It is conjectured that \(|G|\mid|\Aut(G)|\) for every nonabelian \(p\)-group \(G\). In this paper the following results are proven. Theorem. For every \(s\in\mathbb{N}\) there exists \(o(r,s)\in\mathbb{N}\) such that \(2^s\mid|G|\mid|\Aut(G)|\) for all \(2\)-groups \(G\) of coclass \(r\) and order at least \(o(r,s)\). -- Corollary.
openaire +1 more source
Inertial automorphisms of an abelian group
An automorphisms $\gamma$ of a group is inertial if $X\cap X^\g$ has finite index in both $X$ and $X^\g$ for any subgroup $X$. We study inertial automorphisms of abelian groups and give characterization of them. In particular, if the group is periodic
S. Rinauro +3 more
core +1 more source
Syndrome spectrums of error orbits in RS-codes
This article is devoted to the research of the properties of syndromes of errors in Reed-Solomon codes. RS-codes are built on non-binary alphabets. So, unlike BCH-codes, RS-codes contain an extremely large variety of correctable errors.
V. A. Lipnitski, S. I. Semyonov
doaj +1 more source
A Coarse Geometric Approach to Graph Layout Problems
ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
Composite reductions for Kripke models
Kripke factor-model concept is investigated. It is shown, that every factor-model is representexl as a decomposition of several spexdal facctor-models, which groups of automorphisms are primes. Moreover, we show, that every finite group is isomorphic for
Y. A. Belov.
doaj
The group of automorphisms of a distributively generated near ring
S. D. Scott has shown that the group of automorphisms of the near ring generated by the automorphisms of a given group is isomorphic to the automorphism group of the given group if that group’s automorphism is complete.
J. J. Malone
core +1 more source
Non‐Geometric T‐Duality as Higher Groupoid Bundles With Connections
This paper describes T‐duality between geometric and non‐geometric backgrounds using spans of higher groupoid bundles with adjusted connections. This framework incorporates explicit metric formulas, scalar fields, and Q$Q$‐fluxes. The resulting model reproduces key literature examples while maintaining covariance under the full T‐duality group O(n,n;Z)$
Hyungrok Kim, Christian Saemann
wiley +1 more source
Representations of the space of n-theta functions [PDF]
Let X be a smooth complex projective curve with group of automorphisms G. In this thesis we apply the Holomorphic Lefschetz Theorem in certain cases to compute the decomposition of the space H (J(_x),O(_n)O)) into a sum of irreducible representations of ...
MejiÌa, Israel Moreno +1 more
core

