English
Related papers

Related papers: General runner removal and the Mullineux map

200 papers

We consider the representation theory of the Ariki-Koike algebra, a $q$-deformation of the group algebra of the complex reflection group $C_r \wr S_n$. We define the addition of a runner full of beads for the abacus display of a…

Representation Theory · Mathematics 2024-07-31 Alice Dell'Arciprete

For the Iwahori-Hecke algebras of type $A$, James and Mathas proved a theorem which relates $v$-decomposition numbers for different values of $e$, by adding empty runners to the James' abacus display. This result is often referred to as the…

Representation Theory · Mathematics 2026-04-09 Alice Dell'Arciprete , Lorenzo Putignano

We develop a combinatorial framework for the subdivision map -- introduced by Maksimau, Mathas and Tubbenhauer -- between the KLR(W) algebras of type $A^{(1)}_{e-1}$ and type $A^{(1)}_{e}$, which provides a partial categorification of the…

Representation Theory · Mathematics 2026-02-27 Tao Qin

Let $1<d<e$ be two coprime integers and let $m_e$ denote the Mullineux map, which for $e$ prime describes tensor products of the irreducible modules of symmetric groups with the sign in characteristic $e$. We prove that if $\lambda$ is an…

Combinatorics · Mathematics 2025-04-08 Pavel Turek

If $R$ is a rational map, the Main Result is a uniformization Theorem for the space of decompositions of the iterates of $R$. Secondly, we show that Fatou conjecture holds for decomposable rational maps.

Dynamical Systems · Mathematics 2011-07-01 Carlos Cabrera , Peter Makienko

We prove an analogue of James-Donkin row removal theorems for arbitrary diagrammatic Cherednik algebras. This is one of the first results concerning the (graded) decomposition numbers of these algebras over fields of arbitrary…

Representation Theory · Mathematics 2019-11-20 Chris Bowman , Liron Speyer

We study the decomposition matrices for the unipotent $\ell$-blocks of finite special unitary groups SU$_n(q)$ for unitary primes $\ell$ larger than $n$. Up to very few unknown entries, we give a complete solution for $n=2,\ldots,10$. We…

Representation Theory · Mathematics 2015-06-12 Olivier Dudas , Gunter Malle

By a re-examination of MacMahon's original proof of his celebrated theorem on the distribution of the major indices over permutations, we give a reformulation of his argument in terms of the structure of labeled partitions. In this…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Deheng Xu

For any finite field ${\mathbb F}_q$ with $q$ elements, we study the set ${\mathcal F}_{(q,m)}$ of functions from ${\mathbb F}_q^m$ into ${\mathbb F}^q$. We introduce a transformation that allows us to determine a linear system of $q^{m+1}$…

Information Theory · Computer Science 2015-12-16 Miriam Abdon , Robert Rolland

The theory of q-analogs develops many combinatorial formulas for finite vector spaces over a finite field with q elements--all in analogy with formulas for finite sets (which are the special case of q=1). A direct-sum decomposition of a…

Combinatorics · Mathematics 2016-03-25 David Ellerman

The q-deformed Fock spaces of higher levels were introduced by Jimbo-Misra-Miwa-Okado. The q-decomposition matrix is a transition matrix from the standard basis to the canonical basis defined by Uglov in the q-deformed Fock space. In this…

Representation Theory · Mathematics 2011-03-01 Kazuto Iijima

The Mullineux involution is an important map on $p$-regular partitions that originates from the modular representation theory of $\mathcal{S}_n$. In this paper we study the Mullineux transpose map and the generalized column regularization…

Combinatorics · Mathematics 2020-07-30 Allen Wang , Guangyi Yue

Marginal MAP inference involves making MAP predictions in systems defined with latent variables or missing information. It is significantly more difficult than pure marginalization and MAP tasks, for which a large class of efficient and…

Machine Learning · Computer Science 2015-11-10 Wei Ping , Qiang Liu , Alexander Ihler

A generalization of a beautiful $q$-series identity found in the unorganized portion of Ramanujan's second and third notebooks is obtained. As a consequence, we derive a new three-parameter identity which is a rich source of…

Combinatorics · Mathematics 2018-06-15 Atul Dixit , Bibekananda Maji

In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful…

Information Theory · Computer Science 2017-04-07 Pierre Comon , Yang Qi , Konstantin Usevich

We generalize the classical de Rham decomposition theorem for Riemannian manifolds to the setting of geodesic metric spaces of finite dimension.

Metric Geometry · Mathematics 2007-05-23 Thomas Foertsch , Alexander Lytchak

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

Optimization and Control · Mathematics 2023-10-02 Levent Tunçel , Stephen A. Vavasis , Jingye Xu

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…

Data Structures and Algorithms · Computer Science 2007-05-23 Kevin K. H. Cheung , Michele Mosca

Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rational functions. In our approach, numerators play a significant…

Symbolic Computation · Computer Science 2015-04-08 Graham H. Norton

We give a new proof of a determinant evaluation due to Andrews, which has been used to enumerate cyclically symmetric and descending plane partitions. We also prove some related results, including a q-analogue of Andrews's determinant.

Combinatorics · Mathematics 2012-10-29 Hjalmar Rosengren
‹ Prev 1 2 3 10 Next ›