Related papers: Finite group characters on free resolutions
We give extensions of results on nonnegative matrix semigroups which deduce finiteness or boundedness of such semigroups from the corresponding local properties, e.g., from finiteness or boundedness of values of certain linear functionals…
Let $M$ be a finitely generated module over a local ring $(R,\mathfrak{m})$. By $\mathcal{S}_j(M)$, we denote the $j$th symmetric power of $M$ ($j$th graded component of the symmetric algebra $\mathcal{S}_R(M)$). The purpose of this paper…
It is well-known that characters classify linear representations of finite groups, that is if characters of two representations of a finite group are the same, these representations are equivalent. It is also well-known that, in general,…
We study the codegree isomorphism problem for finite simple groups. In particular, we show that such a group is determined by the codegrees (counting multiplicity) of its irreducible characters. The proof is uniform for all simple groups…
We establish the existence and uniqueness of finite free resolutions - and their attendant Betti numbers - for graded commuting d-tuples of Hilbert space operators. Our approach is based on the notion of free cover of a (perhaps…
Given a sequence of related modules $M_n$ over a sequence of related Noetherian polynomial rings, where each $M_n$ is a representation of the symmetric group on $n$ letters, one may ask how to simultaneously compute an equivariant free…
We complete the description of group gradings on finite-dimensional incidence algebras. Moreover, we classify the finite-dimensional graded algebras that can be realized as incidence algebras endowed with a group grading.
In this thesis we investigate certain types of monomial ideals of polynomial rings over fields. We are interested in minimal free resolutions of these ideals (or equivalently the quotients of the polynomial ring by the ideals) considered as…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…
We investigate the question which Q-valued characters and characters of Q-representations of finite groups are Z-linear combinations of permutation characters. This question is known to reduce to that for quasi-elementary groups, and we…
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank free group. We give the first fully polynomial algorithm to…
These notes are our contribution to the Proceedings of the ICM 2026. We discuss some results we have obtained (in part jointly with coauthors) regarding the representation theory of reductive algebraic groups over algebraically closed…
We study the automorphism groups attached to a free algebra with multiple, possibly infinitely many, composition laws. As an application, we prove that the automorphism group of finitely generated vertex algebras over noetherian rings are…
We prove that a finite group is rational if and only if it has a set of permutation characters which separate conjugacy classes. It follows from this that a finite group is rational if and only if it has a representation as a permutation…
The main goal of this paper is to apply the arithmetic method developed in our previous paper \cite{13} to determine the number of some types of subgroups of finite abelian groups.
Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. In a previous article, we gave a necessary and sufficient condition for X to be free of given rank d…
We organize fundamental properties of quasi-Hamiltonian spaces on which a finite group acts, and we apply them to the theory of moduli spaces of flat connections on an oriented compact surface with boundary.
We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group $G$, compute a finite graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group $G$. Our…
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…