Related papers: Computations in Classical Groups
We introduce affine Stanley symmetric functions for the special orthogonal groups, a class of symmetric functions that model the cohomology of the affine Grassmannian, continuing the work of Lam and Lam, Schilling, and Shimozono on the…
We discuss computational results on field extensions $K/{\mathbb Q}$ of degree $n\le11$ with Galois group of the Galois closure isomorphic to the full symmetric group ${\mathfrak S}_n$. More precisely, we present statistics on the number of…
We prove various results about the Local Converse Problem for split reductive groups $G$ over a non-archimedean local field~$F$ of characteristic $0$ and residual characteristic $p$. In particular, we prove that when $G$ is a symplectic or…
In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.
Let G=Aut_K (K(x)) be the Galois group of the transcendental degree one pure field extension K(x)/K. In this paper we describe polynomial time algorithms for computing the field Fix(H) fixed by a subgroup H < G and for computing the fixing…
We establish vanishing results for limits of characters in various discrete groups, most notably irreducible lattices in higher rank semisimple Lie groups. As an application, we show that any sequence of finite-dimensional representations…
Let $k(G)$ be the number of conjugacy classes of finite groups $G$ and $\pi_e(G)$ be the set of the orders of elements in $G$. Then there exists a non-negative integer $k$ such that $k(G)=|\pi_e(G)|+k$. We call such groups to be $co(k)$…
For every finite quasisimple group of Lie type $G$, every irreducible character $\chi$ of $G$, and every element $g$ of $G$, we give an exponential upper bound for the character ratio $|\chi(g)|/\chi(1)$ with exponent linear in $\log_{|G|}…
Let $G$ be a classical group defined over a finite field. We consider the following fundamental problems concerning conjugacy in $G$: 1. List a representative for each conjugacy class of $G$. 2. Given $x \in G$, describe the centralizer of…
We obtain a computational realization of the strong approximation theorem. That is, we develop algorithms to compute all congruence quotients modulo rational primes of a finitely generated Zariski dense group $H \leq \mathrm{SL}(n,…
In this paper we describe a parallel Gaussian elimination algorithm for matrices with entries in a finite field. Unlike previous approaches, our algorithm subdivides a very large input matrix into smaller submatrices by subdividing both…
We construct supercharacter theories of finite unipotent groups in the orthogonal, symplectic and unitary types. Our method utilizes group actions in a manner analogous to that of Diaconis and Isaacs in their construction of supercharacters…
We compute the stable homology of orthogonal and symplectic groups over a finite field k with coefficients coming from an usual endofunctor F of k-vector spaces (exterior, symmetric, divided powers...), that is, for all natural integer i,…
This is a study of algebras with involution that become isomorphic over a separable closure of the base field to a tensor product of two composition algebras. We classify these algebras, provide criteria for isomorphism and isotopy, and…
Let $R$ be a semilocal principal ideal domain. Two algebraic objects over $R$ in which scalar extension makes sense (e.g. quadratic spaces) are said to be of the same genus if they become isomorphic after extending scalars to all…
Given a field $K$ equipped with a set of discrete valuations $V$, we develop a general theory to relate reduction properties of skew-hermitian forms over a quaternion $K$-algebra $Q$ to quadratic forms over the function field $K(Q)$…
Here we initiate a program to study relationships between finite groups and arithmetic-geometric invariants in a systematic way. To do this we first introduce a notion of optimal module for a finite group in the setting of holomorphic mock…
In the first part of this paper, we develop a general framework that permits a comparison between explicit class field theories for a family of rational function fields $\mathbb{F}_s(t)$ over arbitrary constant fields $\mathbb{F}_s$ and…
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…
We apply numerical optimization and linear algebra algorithms for classical computers to the problem of automatically synthesizing algorithms for quantum computers. Using our framework, we apply several common techniques from these…