相关论文: Centralisers of Involutions in Black Box Groups

Neural networks have emerged as powerful tools across various applications, yet their decision-making process often remains opaque, leading to them being perceived as "black boxes." This opacity raises concerns about their interpretability…

In this PhD thesis we discuss methods of recognizing finite groups by the structure of normalizers of certain 3-subgroups. We explain a method for characterizing groups using character theoretic and block theoretic methods and we use these…

If a black box group is known to be isomorphic to an exceptional simple group of Lie type of (twisted) rank $>1$, other than any $^2F_4(q)$, over a field of known size, a Las Vegas algorithm is given to produce a constructive isomorphism.…

In [H. Duan and S. Liu, The isomorphism type of the centralizer of an element in a Lie group, Journal of algebra, 376(2013), 25-45], we have determined the isomorphism type of the centralizer of an element in a simpe Lie group. As a sequel…

This work explores the morphology and dynamical properties of cores within rich superclusters, highlighting their role as transitional structures in the large-scale structure of the Universe. Using projected and radial velocity…

We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…

We describe the rings of invariants for the finite orthogonal groups of plus type in odd characteristic acting on the defining representations. We also describe the invariants of the corresponding Sylow subgroups in the defining…

We give an explicit description of the category of central extensions of a group scheme by a sheaf of Abelian groups. Based on this, we describe a framework for computing with central extensions of finite commutative group schemes, torsors…

We study asymptotic behavior of the dimensions of the homology groups of subgroups of finite index in finitely generated subgroups of pro-$p$ extension of centralizers of free pro-$p$ groups. We also prove group theoretic structure…

We describe structure of locally finite groups of finite centraliser dimension.

Recently, sub-indices and sub-factors of groups with connections to number theory, additive combinatorics, and factorization of groups have been introduced and studied. Since all group subsets are considered in the theory and there are many…

The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order…

In this paper, we classify conjugacy classes of centralizers of irreducible subgroups in $PSL(n,\mathbb{C})$ using alternate modules a.k.a. finite abelian groups with an alternate bilinear form. When $n$ is squarefree, we prove that these…

In this work, we establish a relationship between the sum of irreducible character degrees and the number of twisted involutions associated with the automorphisms of a finite group. We develop algorithmic frameworks for evaluating these…

Meta-centralizers of non-locally compact group algebras are studied. Theorems about their representations with the help of families of generalized measures are proved. Isomorphisms of group algebras are investigated in relation with…

We combine results about Whitehead groups of finite groups with results about genetic bases of finite $p$-groups to compute the Whitehead groups of some metacyclic $p$-groups. Let $C_{p^n}$ denote a cyclic group of order $p^n$ for $p$ an…

We consider an arbitrary representation of the additive group over a field of characteristic zero and give an explicit description of a finite separating set in the corresponding ring of invariants.

We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a function to compute its matrix-vector product. The methods apply to…

Polynomial-time algorithms are given to find a central decomposition of maximum size for a finite p-group of class 2 and for a nilpotent Lie ring of class 2. The algorithms use Las Vegas probabilistic routines to compute the structure of…

A new conjecture on characters of finite groups, related to the McKay conjecture, was proposed recently by the first and third authors. In this paper, we prove it for $p$-solvable groups when $p$ is odd.