Related papers: Finite Affine Groups: Cycle Indices, Hall-Littlewo…
We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…
We classify localising subcategories of the stable module category of a finite group that are closed under tensor product with simple (or, equivalently all) modules. One application is a proof of the telescope conjecture in this context.…
If we treat the symmetric group $S_n$ as a probability measure space where each element has measure $1/n!$, then the number of cycles in a permutation becomes a random variable. The Cycle Length Lemma describes the expected values of…
By algebraic group theory, there is a map from the semisimple conjugacy classes of a finite group of Lie type to the conjugacy classes of the Weyl group. Picking a semisimple class uniformly at random yields a probability measure on…
We express the set of representations from a cyclic $p$-group to a connected $p$-compact group in terms of the associated reflection group and compute its cardinality for each exotic $p$-compact group.
We observe that, for each positive integer n > 2, each of the Artin groups of finite type A_n, B_n=C_n, and affine type \tilde A_{n-1} and \tilde C_{n-1} is a central extension of a finite index subgroup of the mapping class group of the…
The second author had previously obtained explicit generating functions for moments of characteristic polynomials of permutation matrices (n points). In this paper, we generalize many aspects of this situation. We introduce random shifts of…
Estimation of the number of components (or order) of a finite mixture model is a long standing and challenging problem in statistics. We propose the Group-Sort-Fuse (GSF) procedure -- a new penalized likelihood approach for simultaneous…
We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…
The classical Frobenius-Schur indicators for finite groups are character sums defined for any representation and any integer m greater or equal to 2. In the familiar case m=2, the Frobenius-Schur indicator partitions the irreducible…
In this paper, we study the class of affine semigroup generated by integral vectors, whose components are in generalised arithmetic progression and we observe that the defining ideal is determinantal. We also give a sufficient condition on…
Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…
Let $G$ be a free product of two groups with amalgamated subgroup, $\pi$ be either the set of all prime numbers or the one-element set \{$p$\} for some prime number $p$. Denote by $\Sigma$ the family of all cyclic subgroups of group $G$,…
Series representations consisting of spherical harmonics are obtained for characteristic exponents and probability density functions of multivariate stable distributions under various conditions. A esult potentially applicable in a…
Probabilistic circuits compute multilinear polynomials that represent multivariate probability distributions. They are tractable models that support efficient marginal inference. However, various polynomial semantics have been considered in…
The probability that a tuple of matrices together with all scalars generates a finite incidence ring is calculated. It is proved that all real and complex finite-dimensional incidence algebras are generated by two randomly chosen matrices.
Approximate group analysis technique, that is, the technique combining the methodology of group analysis and theory of small perturbations, is applied to finite-difference equations approximating ordinary differential equations.…
We provide structural criteria for some finite factorised groups $G = AB$ when the conjugacy class sizes in $G$ of certain $\pi$-elements in $A\cup B$ are either $\pi$-numbers or $\pi'$-numbers, for a set of primes $\pi$. In particular, we…
We present several new algorithms for computing factorization invariant values over affine semigroups. In particular, we give (i) the first known algorithm to compute the delta set of any affine semigroup, (ii) an improved method of…
A celebrated analogy between prime factorizations of integers and cycle decompositions of permutations is explored here. Asymptotic formulas characterizing semismooth numbers (possessing at most several large factors) carry over to random…