Related papers: Computations in Classical Groups

The cohomology ring of a finite group, with coefficients in a finite field, can be computed by a machine, as Carlson has showed. Here "compute" means to find a presentation in terms of generators and relations, and involves only the…

We present the (Lascar) Galois group of any countable theory as a quotient of a compact Polish group by an $F_\sigma$ normal subgroup: in general, as a topological group, and under NIP, also in terms of Borel cardinality. This allows us to…

We study the statistical estimation problem of orthogonal group synchronization and rotation group synchronization. The model is $Y_{ij} = Z_i^* Z_j^{*T} + \sigma W_{ij}\in\mathbb{R}^{d\times d}$ where $W_{ij}$ is a Gaussian random matrix…

We apply Voronoi's algorithm to compute representatives of the conjugacy classes of maximal finite subgroups of the unit group of a maximal order in some simple $\QQ $-algebra. This may be used to show in small cases that non-conjugate…

In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…

In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…

The aim of this paper is twofold. First, we introduce a new method for evaluating the multiplicity of a given discrete series in the space of level $1$ automorphic forms of a split classical group $G$ over $\mathbb{Z}$, and provide…

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…

For every finite field F and every positive integer r, there exists a finite extension F' of F such that either SO(2r+1,F') or its simple derived group can be realized as a Galois group over Q. If the characteristic of F is 3 or 5 (mod 8),…

While efficient algorithms are known for solving many important problems related to groups, no efficient algorithm is known for determining whether two arbitrary groups are isomorphic. The particular case of 2-nilpotent groups, a special…

A field $K$ is quasi-classical $d$-local if there exist fields $K=k_d,\dots,k_0$ with $k_{i+1}$ Henselian admissible discretely valued with residue field $k_i$, and $k_0$ quasi-finite. We prove a duality theorem for the Galois cohomology of…

Let $k$ be an arbitrary field. We classify the maximal reductive subgroups of maximal rank in any classical simple algebraic $k$-group in terms of combinatorial data associated to their indices. This result complements [S, 2022], which does…

We study natural linear representations of self-similar groups over finite fields. In particular, we show that if the group is generated by a finite automaton, then obtained matrices are automatic. This shows a new relation between two…

We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…

We prove that the 2D Ising model is complete in the sense that the partition function of any classical q-state spin model (on an arbitrary graph) can be expressed as a special instance of the partition function of a 2D Ising model with…

This article is a survey of conjectures and results on reductive algebraic groups having good reduction at a suitable set of discrete valuations of the base field. Until recently, this subject has received relatively little attention, but…

We identify a class of symmetric algebras over a complete discrete valuation ring $\mathcal O$ of characteristic zero to which the characterisation of Kn\"orr lattices in terms of stable endomorphism rings in the case of finite group…

We will explore the nature of when certain finite groups have an equal covering, and when finite groups do not. Not to be confused with the concept of a cover group, a covering of a group is a collection of proper subgroups whose…

In this note, we provide a unifying framework to investigate the computational complexity of classical spin models and give the full classification on spin models in terms of system dimensions, randomness, external magnetic fields and types…

In this paper we give a survey of recent methods for the asymptotic and exact enumeration of number fields with given Galois group of the Galois closure. In particular, the case of fields of degree up to 4 is now almost completely solved,…