Search arXiv⌕ Search

arXiv · 2503.14417

Matrix symmetric and quasi-symmetric functions and noncommutative representation theory

Abstract

A fundamental result by L. Solomon in algebraic combinatorics and representation theory states that Mackey formulas for products of characters of a symmetric group, or equivalently the computation of tensor products of representations thereof, can be lifted to the corresponding Solomon's descent algebra, a subalgebra of the group algebra with a very rich structure. Motivated by the structure of the product formula in these algebras and by other results and ideas in the field, we introduce and investigate in the present article a two dimensional analogue of descent algebras based on packed integer matrices that inherits most of their fundamental properties. One of the various bialgebra structures we introduce on packed integer matrices identifies with a bialgebra recently introduced by J. Diehl and L. Schmitz to define a two dimensional generalisation of Chen's iterated integrals signatures.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Loïc Foissy, Claudia Malvenuto, Frédéric Patras. 2025-03-18. Matrix symmetric and quasi-symmetric functions and noncommutative representation theory. https://arxiv.org/abs/2503.14417

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗