Related papers: Uniformly semi-rational groups
We determine the rationality properties of unipotent characters of finite reductive groups arising as fixed points of disconnected reductive groups under a Frobenius map. In the proof we use realisations of characters in $\ell$-adic…
We produce an infinite family of transcendental numbers which, when raised to their own power, become rational. We extend the method, to investigate positive rational solutions to the equation $x^x = \alpha$, where $\alpha$ is a fixed…
We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…
We generalize the character formulas for multiplicities of irreducible constituents from group theory to semigroup theory using Rota's theory of M\"obius inversion. The technique works for a large class of semigroups including: inverse…
The idempotent problem of a finitely generated inverse semigroup is the formal language of all words over the generators representing idempotent elements. This note proves that a finitely generated inverse semigroup with regular idempotent…
An element $g$ of a group is called {\em reversible} if it is conjugate in the group to its inverse. This paper is about reversibles in the group $G$ of formally-invertible pairs of formal power series in two variables, with complex…
Let $k$ be a finitely generated field, let $X$ be an algebraic variety and $G$ a linear algebraic group, both defined over $k$. Suppose $G$ acts on $X$ and every element of a Zariski-dense semigroup $\Gamma \subset G(k)$ has a rational…
In this paper, we study definably compact semigroups in o-minimal structures, aiming to extend the theory of definable groups to a broader algebraic setting. We show that any definably compact semigroup contains idempotents and admits a…
Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…
We extend the family of classical Schur algebras in type A, which determine the polynomial representation theory of general linear groups over an infinite field, to a larger family, the rational Schur algebras, which determine the rational…
Let $p$ be a prime and $G$ a finite group. A complex character of $G$ is called almost $p$-rational if its values belong to a cyclotomic field $\mathbb{Q}(e^{2\pi i/n})$ for some $n\in \mathbb{Z}^+$ prime to $p$ or precisely divisible by…
Identities of complex irreducible representations of finite groups can be explicitly constructed from character value sets. Among other things, these identities determine representations up to Gassmann equivalency. Some examples of…
Several recent problems in the representation theory of finite groups require determining whether certain characters of almost simple groups belong to the principal block. Since the values of these characters are not yet known, we employ…
In this article we give an algorithm for determining the generators and relations for the rings of semi-invariant functions on irreducible components of representation spaces for gentle string algebras. These rings of semi-invariants turn…
Suppose that $G$ is a finite group and $H$ is a nilpotent subgroup of $G$. If a character of $H$ induces an irreducible character of $G$, then the generalized Fitting subgroup of $G$ is nilpotent.
Numerical semigroups have been extensively studied throughout the literature, and many of their invariants have been characterized. In this work, we generalize some of the most important results about symmetry, pseudo-symmetry, or…
Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…
We study finite semigroups of $n \times n$ matrices with rational entries. Such semigroups provide a rich generalization of transition monoids of unambiguous (and, in particular, deterministic) finite automata. In this paper we determine…
We study dynamical semigroups of positive, but not completely positive maps on finite-dimensional bipartite systems and analyze properties of their generators in relation to non-decomposability and bound-entanglement. An example of…
The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…