English
Related papers

Related papers: Character Polynomials and the Restriction Problem

200 papers

In this paper, we will compute the characteristic polynomials for finite dimensional representations of classical complex Lie algebras and the exceptional Lie algebra of type G2, which can be obtained through the orbits of integral weights…

Representation Theory · Mathematics 2024-10-28 Chenyue Feng , Shoumin Liu , Xumin Wang

We construct the polynomial induction functor, which is the right adjoint to the restriction functor from the category of polynomial representations of a general linear group to the category of representations of its Weyl group. This…

Representation Theory · Mathematics 2021-12-17 Sridhar P. Narayanan , Digjoy Paul , Amritanshu Prasad , Shraddha Srivastava

Polynomial invariants are fundamental objects in analysis on Lie groups and symmetric spaces. Invariant differential operators on symmetric spaces are described by Weyl group invariant polynomial. In this article we give a simple criterion…

Representation Theory · Mathematics 2010-12-06 Gestur Olafsson , Joseph A. Wolf

Polynomial invariants are fundamental objects in analysis on Lie groups and symmetric spaces. Invariant differential operators on symmetric spaces are described by Weyl group invariant polynomial. In this article we give a simple criterion…

Representation Theory · Mathematics 2009-10-24 Gestur Olafsson , Joseph A. Wolf

Schur-Weyl duality is a fundamental framework in combinatorial representation theory. It intimately relates the irreducible representations of a group to the irreducible representations of its centralizer algebra. We investigate the analog…

Representation Theory · Mathematics 2018-10-30 Megan Ly

In this paper we study the characters of sequences of representations of any of the three families of classical Weyl groups W_n: the symmetric groups, the signed permutation groups (hyperoctahedral groups), or the even-signed permutation…

Representation Theory · Mathematics 2015-03-31 Jennifer C. H. Wilson

By using combinatorics, we give a new proof for the recurrence relations of the characteristic polynomial coefficients, and then we obtain an explicit expression for the generic term of the coefficient sequence, which yields the trace…

High Energy Physics - Theory · Physics 2008-11-26 Hong-Hao Zhang , Wen-Bin Yan , Xue-Song Li

We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…

Representation Theory · Mathematics 2011-05-23 Jérémy Le Borgne

We find a simple product formula for the characteristic polynomial of the permutations with a fixed descent set under the weak order. As a corollary we obtain a simple product formula for the characteristic polynomial of alternating…

Combinatorics · Mathematics 2022-04-05 Jang Soo Kim , Sun-mi Yun

We compute correlation functions of inverse powers and ratios of characteristic polynomials for random matrix models with complex eigenvalues. Compact expressions are given in terms of orthogonal polynomials in the complex plane as well as…

Mathematical Physics · Physics 2011-07-19 G. Akemann , A. Pottier

We study correlation functions of the characteristic polynomials in coupled matrix models based on the Schur polynomial expansion, which manifests their determinantal structure.

Mathematical Physics · Physics 2022-05-06 Nicolas Babinet , Taro Kimura

In a previous paper (joint with Hausel and Rodriguez-Villegas) we gave a conjectural formula for the mixed Hodge polynomials of character varieties with generic semisimple conjugacy classes at punctures and we prove a formula for the…

Algebraic Geometry · Mathematics 2014-07-30 Emmanuel Letellier

We establish several results concerning tensor products, q-characters, and the block decomposition of the category of finite-dimensional representations of quantum affine algebras in the root of unity setting. In the generic case, a Weyl…

Quantum Algebra · Mathematics 2012-01-04 Dijana Jakelic , Adriano Moura

We study the characteristic polynomial of random permutation matrices following some measures which are invariant by conjugation, including Ewens' measures which are one-parameter deformations of the uniform distribution on the permutation…

Probability · Mathematics 2018-09-17 Valentin Bahier

Polynomial threshold gates are basic processing units of an artificial neural network. When the input vectors are binary vectors, these gates correspond to Boolean functions and can be analyzed via their polynomial representations. In…

Computational Complexity · Computer Science 2013-07-05 Yi Ming Zou

Let A be a subspace arrangement and let chi(A,t) be the characteristic polynomial of its intersection lattice L(A). We show that if the subspaces in A are taken from L(B_n), where B_n is the type B Weyl arrangement, then chi(A,t) counts a…

Combinatorics · Mathematics 2007-05-23 Andreas Blass , Bruce E. Sagan

We use character polynomials to obtain a positive combinatorial interpretation of the multiplicity of the sign representation in irreducible polynomial representations of $GL_n(\mathbb{C})$ indexed by two-column and hook partitions. Our…

Representation Theory · Mathematics 2022-11-29 Sridhar P. Narayanan , Digjoy Paul , Amritanshu Prasad , Shraddha Srivastava

Let B be a reductive Lie subalgebra of a semi-simple Lie algebra of the same rank both over the complex numbers. To each finite dimensional irreducible representation $V_\lambda$ of F we assign a multiplet of irreducible representations of…

Representation Theory · Mathematics 2009-10-31 B. Gross , B. Kostant , P. Ramond , S. Sternberg

This paper addresses the topic of equidistribution and recurrence for polynomial sequences over function fields. The main focus is to note and correct two small errors in [V. Bergelson and A. Leibman, A Weyl-type equidistribution theorem in…

Number Theory · Mathematics 2026-03-24 Ethan Ackelsberg , Vitaly Bergelson

We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…

Computational Complexity · Computer Science 2022-12-02 Edinah K. Gnang , Rongyu Xu
‹ Prev 1 2 3 10 Next ›