English
Related papers

Related papers: Macdonald polynomials as characters of Cherednik a…

200 papers

Let $G$ be a finite nilpotent group, $\chi$ and $\psi$ be irreducible complex characters of $G$ of prime degree. Assume that $\chi(1)=p$. Then either the product $\chi\psi$ is a multiple of an irreducible character or $\chi\psi$ is the…

Group Theory · Mathematics 2008-03-25 Edith Adan-Bante

In this paper we prove the abelian localization theorem for modules over cyclotomic Rational Cherednik algebras.

Representation Theory · Mathematics 2014-02-04 Ivan Losev

We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.

Number Theory · Mathematics 2015-08-13 Samuel H. Dalalyan

Basic modules of McLain groups $M=M(\Lambda,\leq, R)$ are defined and investigated. These are (possibly infinite dimensional) analogues of Andr\'e's supercharacters of $U_n(q)$. The ring $R$ need not be finite or commutative and the field…

Representation Theory · Mathematics 2016-11-01 Fernando Szechtman , Allen Herman , Mohammad Izadi

We prove a generalisation to any characteristic of a result of Macdonald that describes strict polynomial functors in characteristic zero in terms of representations of the groupoid of finite sets and bijections. Our result will give an…

Representation Theory · Mathematics 2007-05-23 Torsten Ekedahl , Pelle Salomonsson

Singular nonsymmetric Macdonald polynomials are constructed by use of the representation theory of the Hecke algebras of the symmetric groups. These polynomials are labeled by quasistaircase partitions and are associated to special…

Representation Theory · Mathematics 2020-02-28 Laura Colmenarejo , Charles F. Dunkl

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we enumerate self-reciprocal irreducible monic polynomials over a finite field with prescribed leading coefficients.…

Combinatorics · Mathematics 2021-10-14 Zhicheng Gao

Consider a finite-dimensional algebra $A$ and any of its moduli spaces $\mathcal{M}(A,\mathbf{d})^{ss}_{\theta}$ of representations. We prove a decomposition theorem which relates any irreducible component of…

Representation Theory · Mathematics 2018-09-25 Calin Chindris , Ryan Kinser

H. Lenstra has pointed out that a cubic polynomial of the form (x-a)(x-b)(x-c) + r(x-d)(x-e), where {a,b,c,d,e} is some permutation of {0,1,2,3,4}, is irreducible modulo 5 because every possible linear factor divides one summand but not the…

Number Theory · Mathematics 2022-09-22 Evan M. O'Dorney

We construct a novel family of difference-permutation operators and prove that they are diagonalized by the wreath Macdonald $P$-polynomials; the eigenvalues are written in terms of elementary symmetric polynomials of arbitrary degree. Our…

Quantum Algebra · Mathematics 2025-09-16 Daniel Orr , Mark Shimozono , Joshua Jeishing Wen

Demazure characters of type A, which are equivalent to key polynomials, have been decomposed by Lascoux and Sch\"{u}tzenberger into standard bases. We prove that the resulting polynomials, which we call Demazure atoms, can be obtained from…

Combinatorics · Mathematics 2009-04-02 Sarah Mason

We present several new and compact formulas for the modified and integral form of the Macdonald polynomials, building on the compact "multiline queue" formula for Macdonald polynomials due to Corteel, Mandelshtam and Williams. We also…

Combinatorics · Mathematics 2019-12-10 Sylvie Corteel , Jim Haglund , Olya Mandelshtam , Sarah Mason , Lauren Williams

Let $q$ be an odd prime power and $D$ be the set of monic irreducible polynomials in $\mathbb F_q[x]$ which can be written as a composition of monic degree two polynomials. In this paper we prove that $D$ has a natural regular structure by…

Number Theory · Mathematics 2019-02-13 Andrea Ferraguti , Giacomo Micheli , Reto Schnyder

A multivariable hypergeometric-type formula for raising operators of the Macdonald polynomials is conjectured. It is proved that this agrees with Jing and Jozefiak's expression for the two-row Macdonald polynomials, and also with Lassalle…

Quantum Algebra · Mathematics 2009-11-11 Jun'ichi Shiraishi

We prove that arithmetic is interpretable in any indecomposable polynomial ring (in any set of variables), and in addition we provide an alternative uniform proof of undecidability for all members in this class of rings.

Logic · Mathematics 2023-09-28 Marco Barone , Nicolás Caro-Montoya , Eudes Naziazeno

We establish a character formula for indecomposable tilting modules for connected reductive groups in characteristic p in terms of p-Kazhdan-Lusztig polynomials, for p>h the Coxeter number. Using results of Andersen, one may deduce a…

Representation Theory · Mathematics 2017-06-02 Pramod Achar , Shotaro Makisumi , Simon Riche , Geordie Williamson

We show that the action of classical operators associated to the Macdonald polynomials on the basis of Schur functions, S_{\lambda}[X(t-1)/(q-1)], can be reduced to addition in \lambda-rings. This provides explicit formulas for the…

Combinatorics · Mathematics 2007-05-23 L. Lapointe , A. Lascoux , J. Morse

We prove that supports of non-symmetric Macdonald polynomials are $M$-convex. As a consequence, we resolve a 2019 conjecture of Monical, Tokcan, and Yong that they have the saturated Newton polytope property. As a corollary we show that…

Combinatorics · Mathematics 2026-03-24 Milo Bechtloff Weising , Alexander E. Black

In this paper, we consider a one-parameter family of degree $d\ge 2$ rational maps with an automorphism group containing the cyclic group of order $d$. We construct a polynomial whose roots correspond to parameter values for which the…

Number Theory · Mathematics 2021-01-26 Minsik Han

Exploiting the fact that the $q$-Whittaker polynomials arise as a specialization of the (modified) Macdonald polynomials, we derive some of their basic properties, and explore interesting identities that they satisfy. We also show how they…

Combinatorics · Mathematics 2020-06-24 F. Bergeron