Related papers: Elements in finite classical groups whose powers h…

The cohomology of the degree-$n$ general linear group over a finite field of characteristic $p$, with coefficients also in characteristic $p$, remains poorly understood. For example, the lowest degree previously known to contain nontrivial…

We study the irreducible representations of simple algebraic groups in which some non-central semisimple element has at most one eigenvalue of multiplicity greater than 1. We bound the multiplicity of this eigenvalue in terms of the rank of…

The classical approximation may be applied to a number of problems in non-equilibrium field theory. The principles and limits of classical real-time lattice simulations are presented, with particular emphasis on the definition of particle…

In these notes we will survey recent results on various finitary approximation properties of infinite groups. We will discuss various restrictions on groups that are approximated for example by finite solvable groups or finite-dimensional…

This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…

Algebraic hyperstructures represent a natural extension of classical algebraic structures. In a classical algebraic structure, the composition of two elements is an element, while in an algebraic hyperstructure, the composition of two…

The strong isomorphism classes of extensions of finite groups are parametrized by orbits of a prescribed action on the second cohomology group. We study these orbits in the case of extensions of a finite abelian $p$-group by a cyclic factor…

A number of elements towards a classification of the quality of emergence in emergent collective systems are provided. By using those elements, several classes of emergent systems are exemplified, ranging from simple aggregations of simple…

Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $\alpha$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the…

In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…

This paper contains a complete description of classes of the unitary equivalence of the admissible representations of infinite-dimensional classic matrix groups paper.

Let $V$ be a $d$-dimensional vector space over a finite field $\mathbb{F}$ equipped with a non-degenerate hermitian, alternating, or quadratic form. Suppose $|\mathbb{F}|=q^2$ if $V$ is hermitian, and $|\mathbb{F}|=q$ otherwise. Given…

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…

We classify the automorphic representations (over number fields) and the irreducible admissible representations (over local fields) of unitary groups which are not quasi-split, under the assumption that the same is known for quasi-split…

Exploiting particular features of classical groups, simple constructions are given for the irreducible constituents of the tensor square of the adjoint modules and the leading terms in higher tensor powers. This provides an independent…

There are many situations in geometry and group theory where it is natural, convenient or necessary to explore infinite groups via their actions on finite objects, i.e. via the finite quotients of the group. But how much understanding can…

Computing conceptual structures, like formal concept lattices, is in the age of massive data sets a challenging task. There are various approaches to deal with this, e.g., random sampling, parallelization, or attribute extraction. A so far…

We revisit the long-standing question of the relation between image appreciation and its statistical properties. We generate two different sets of random images well distributed along three measures of entropic complexity. We run a…

Hyperspaces form a powerful tool in some branches of mathematics: lots of fractal and other geometric objects can be viewed as fixed points of some functions in suitable hyperspaces - as well as interesting classes of formal languages in…

We initiate a systematic study of the perfection of affine group schemes of finite type over fields of positive characteristic. The main result intrinsically characterises and classifies the perfections of reductive groups, and obtains a…