相关论文: On the generation of linear groups by combinatoric…

The theory of permutation orbifolds is reviewed and applied to the study of symmetric product orbifolds and the congruence subgroup problem. The issue of discrete torsion, the combinatorics of symmetric products, the Galois action and…

There is a connection between permutation groups and permutation patterns: for any subgroup $G$ of the symmetric group $S_\ell$ and for any $n \geq \ell$, the set of $n$-permutations involving only members of $G$ as $\ell$-patterns is a…

We investigate the rate of growth of the function of n which counts the number of complex irreducible representations of a fixed group of degree less than or equal to n. The emphasis is on linear groups, especially compact real and p-adic…

We introduce the notion of $GL(n)$-dependence of matrices, which is a generalization of linear dependence taking into account the matrix structure. Then we prove a theorem, which generalizes, on the one hand, the fact that $n+1$ vectors in…

Young diagrams are ubiquitous in combinatorics and representation theory. Here we explain these diagrams, focusing on how they are used to classify representations of the symmetric groups $S_n$ and various "classical groups": famous groups…

Preface (A.Vershik) - about these texts (3.); I.Interpolation between inductive and projective limits of finite groups with applicatons to linear groups over finite fields; II.The characters of the groups of almost triangle matrices over…

We describe several families of permutation polynomials obtained using functions with linear translators.

An extension of the Lorentz group to include generators $\Gamma^\mu$ carrying a space-time index is demonstrated to explicitly construct the Minkowski metric within the internal group space as a consequence of the non-vanishing commutation…

In this work we present a general and versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as permutations. This approach provides a unified view on many…

In this short review we introduce group field theory, a particular class of random tensor models, which represents nowadays one of the candidates for a fundamental theory of quantum gravity. We insist on the combinatorial richness of…

The column group is a subgroup of the symmetric group on the elements of a finite blackboard birack generated by the column permutations in the birack matrix. We use subgroups of the column group associated to birack homomorphisms to define…

In Grayson's combinatorial description of higher K-groups, the generators are bounded acyclic binary multi-complexes of arbitrary size. Generalising work by Kasprowski, Winges and the author, we show in this paper that multi-complexes of…

The main purpose of this paper is to describe some published results and outline corresponding approaches which when applied to automorphism groups of algebras or groups establish that these groups are linear or non-linear.

This is an introduction to the finite groups, with focus on the groups of permutations and reflections, and more generally, on the finite groups of unitary matrices. We first discuss the basics of group theory, featuring the cyclic,…

In previous work, the authors confirmed the speculation of J. G. Thompson that certain multiquadratic fields are generated by specified character values of sufficiently large alternating groups $A_n$. Here we address the natural…

Connections between longest increasing subsequences in random permutations and eigenvalues of random matrices with complex entries have been intensely studied. This note applies properties of random elements of the finite general linear…

This article explains basic constructions and results on group algebras and their cohomology, starting from the point of view of commutative algebra. It provides the background necessary for a novice in this subject to begin reading Dave…

In this paper we indicate one method of construction of linear representations of groups and algebras with translation invariant (except, maybe , finite number) defining relationships. As an illustration of this method, we give one approach…

We study branching multiplicity spaces of complex classical groups in terms of GL(2) representations. In particular, we show how combinatorics of GL(2) representations are intertwined to make branching rules under the restriction of GL(n)…

In this article we look into characterizing primitive groups in the following way. Given a primitive group we single out a subset of its generators such that these generators alone (the so-called primitive generators) imply the group is…