Related papers: The orbit method for unipotent groups over finite …
The article contents suggestions on how to perform the Fast Fourier Transform over Large Finite Fields. The technique is to use the fact that the multiplicative groups of specific prime fields are surprisingly composite.
An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…
The classification of the unitary irreducible representations of symmetry groups is a cornerstone of modern quantum physics, as it provides the fundamental building blocks for constructing the Hilbert spaces of theories admitting these…
We present an algorithm that decides whether a finitely generated linear group over an infinite field is solvable-by-finite: a computationally effective version of the Tits alternative. We also give algorithms to decide whether the group is…
In a previous article, an `invariant method' to calculate monomial integrals over the U(n) group was introduced. In this paper, we study the more traditional group-theoretical method, and compare its strengths and weaknesses with those of…
Approximate but reliable solutions of a quantum system with $N$ identical particles can be easily computed with the envelope theory, also known as the auxiliary field method. This technique has been developed for Hamiltonians with arbitrary…
We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble, or polycyclic, group by restricting attention to certain polycyclic presentations of the group.
We prove an avoidance principle for expanding translates of unipotent orbits for some semisimple homogeneous spaces. In addition, we prove a quantitative isolation result of closed orbits and give an upper bound on the number of closed…
The orbit method in its quantitative form due to Nelson and Venkatesh has played a central role in recent advances in the analytic theory of higher rank $L$-functions. The goal of this note is to explain how the method can be applied to the…
Let $n \in \NN$ and let $q=p^r$ be an odd prime power. Let $R$ be a finite commutative local principal ring of cardinality $q^{n}$ with $R/J(R) \simeq GF(q)$. We study the conjugation action of the group of all unipotent elements in the…
We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…
Let $G$ be the general linear group of the degree $n\geq 2$ over the field $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$. In this article, we give a description of orbit decomposition of the multiple projective space $G^m/P^m$ under the diagonal…
We give a method to determine relative periodic orbits in point vortex systems: it consists mainly into perform a symplectic reduction on a fixed point submanifold in order to obtain a two-dimensional reduced phase space. The method is…
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 study special unipotent representations attached to complex exceptional Richardson orbits. As a consequence, we verify a conjecture of Achar and Sommers for these orbits.
In this paper, we study multiplicative dependence of values of polynomials or rational functions over a number field. As an application, we obtain new results on multiplicative dependence in the orbits of a univariate polynomial dynamical…
These notes collect results about algebraic correspondences and adapt them to the setting of correspondences on projective lines. The focus lies on finite orbits of algebraic correspondences. The main result is a field theoretic…
We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.
In this paper, we give an accessible introduction to the theory of orbispaces via groupoids. We define a certain class of topological groupoids, which we call orbigroupoids. Each orbigroupoid represents an orbispace, but just as with…
We obtain the formula computing the number of isomorphic classes of element systems with characters over finite commutative group $G$.