Related papers: A method for building permutation representations …

A minimal permutation representation of a finite group G is a faithful G-set with the smallest possible size. We study the structure of such representations and show that for certain groups they may be obtained by a greedy construction. In…

In this note we present an algorithm for the construction of the unit group of the Burnside ring $\Omega(G)$ of a finite group $G$ from a list of representatives of the conjugacy classes of subgroups of G.

Using the diagrammatic approach to integrals over Gaussian random matrices, we find a representation for polynomial Lie group integrals as infinite sums over certain maps on surfaces. The maps involved satisfy a specific condition: they…

For given linear action of a finite group on a lattice and a positive integer q, we prove that the mod q permutation representation is a quasi-polynomial in q. Additionally, we establish several results that can be considered as mod…

We introduce a generalized version of a q-Schur algebra (of parabolic type) for arbitrary Hecke algebras over extended Weyl groups. We describe how the decomposition matrix of a finite group with split BN-pair, with respect to a…

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$ and let $G$ be a finite group. Then $G$ is said to be $\sigma $-full if $G$ has a Hall $\sigma _{i}$-subgroup for all $i$. A subgroup $A$ of $G$ is…

A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve…

In this paper we have found irreducible representations (irreps) of the algebra of partially transposed permutation operators on last subsystem. We give here direct method of irreps construction for an arbitrary number of subsystems n and…

A priori, the set of birational transformations of an algebraic variety is just a group. We survey the possible algebraic structures that we may add to it, using in particular parametrised family of birational transformations.

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

In this paper, we revisit the diffusive representations of fractional integrals established in \cite{diethelm2023diffusive} to explore novel variants of such representations which provide highly efficient numerical algorithms for the…

Partition of unity methods (PUMs) on graphs represent straightforward and remarkably adaptable auxiliary techniques for graph signal processing. By relying solely on the intrinsic graph structure, we propose the generation of a partition of…

Semi-direct products of finite groups have permutation representations that are constructed from the permutation representations of their constituents. One can envision these in a metaphoric sense in which a rope is made from a bundle of…

Let G be a finite group and \rho: G--> End(E) be a group representation of G on a coherent sheaf over an integral scheme. The purpose of this paper shall give a decomposition theorem of such representations in non-splitting components and…

We present the ideas behind an algorithm to compute normalizers of primitive groups with non-regular socle in polynomial time. We highlight a concept we developed called permutation morphisms and present timings for a partial implementation…

We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite inverse semigroup to reduce the problem of computing its…

We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…

The study of $G$-equivariant operators is of great interest to explain and understand the architecture of neural networks. In this paper we show that each linear $G$-equivariant operator can be produced by a suitable permutant measure,…

A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…

This article presents a methodology that automatically derives a combinatorial specification for a permutation class C, given its basis B of excluded patterns and the set of simple permutations in C, when these sets are both finite. This is…