English
Related papers

Related papers: Algebraic metacomplexity and representation theory

200 papers

The Weyl-Kac character formula gives a beautiful closed-form expression for the characters of integrable highest-weight modules of Kac-Moody algebras. It is not, however, a formula that is combinatorial in nature, obscuring positivity. In…

Combinatorics · Mathematics 2021-05-19 Nick Bartlett , S. Ole Warnaar

We give a new representation-theoretic proof of the branching rule for Macdonald polynomials using the Etingof-Kirillov Jr. expression for Macdonald polynomials as traces of intertwiners of U_q(gl_n). In the Gelfand-Tsetlin basis, we show…

Representation Theory · Mathematics 2016-07-13 Yi Sun

Some introductory concepts and basic definitions of the Lie superalgebras and their quantum deformations are exposed. Especially the induced representation methods in both cases are described. Based on the Kac representation theory we have…

Quantum Algebra · Mathematics 2007-05-23 Nguyen Anh Ky

A proof of Poincar\'e-Birkhoff-Witt theorem is given for a class of generalized Lie algebras closely related to the Gurevich S-Lie algebras. As concrete examples, we construct the positive (negative) parts of the quantized universal…

q-alg · Mathematics 2009-10-30 Cesar Bautista

In this paper, we revisit the problem of classifying real algebraic and semialgebraic sets by their topological types, focusing on establishing the effectiveness of bounds rather than deriving new quantitative estimates. Building on Hardt's…

Algebraic Geometry · Mathematics 2024-12-24 Kartoue Mady Demdah , Ibrahim Nonkane

We show that the category of graded modules over a finite-dimensional graded algebra admitting a triangular decomposition can be endowed with the structure of a highest weight category. When the algebra is self-injective, we show…

Representation Theory · Mathematics 2026-02-11 Gwyn Bellamy , Ulrich Thiel

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…

Numerical Analysis · Mathematics 2025-01-22 Leokadia Bialas-Ciez , Agnieszka Kowalska , Alvise Sommariva

We study Demazure modules which occur in a level $\ell$ irreducible integrable representation of an affine Lie algebra. We also assume that they are stable under the action of the standard maximal parabolic subalgebra of the affine Lie…

Representation Theory · Mathematics 2014-08-19 Vyjayanthi Chari , Peri Shereen , R. Venkatesh , Jeffrey Wand

We introduce a path-theoretic framework for understanding the representation theory of (quantum) symmetric and general linear groups and their higher level generalisations over fields of arbitrary characteristic. Our first main result is a…

Representation Theory · Mathematics 2018-05-04 C. Bowman , A. G. Cox

The coefficient algebra of a finite-dimensional Lie algebra on a finite-dimensional representation is defined as the subalgebra generated by all coefficients of the corresponding characteristic polynomial. We explore connections between…

Commutative Algebra · Mathematics 2025-11-14 Yin Chen , Runxuan Zhang

Kim, K\"uhn, Osthus and Tyomkyn (Trans. Amer. Math. Soc. 371 (2019), 4655--4742) greatly extended the well-known blow-up lemma of Koml\'os, S\'ark\"ozy and Szemer\'edi by proving a `blow-up lemma for approximate decompositions' which states…

Combinatorics · Mathematics 2020-01-13 Stefan Ehard , Felix Joos

We use Reznick's Theorem for positive homogeneous polynomials to prove an elliptic regularity result for representations of enveloping algebras of Lie algebras. This allows us to relax a technical condition for a sum of squares…

Operator Algebras · Mathematics 2011-12-02 J. Nahas

We prove that every automorphism of the restricted root system of a real semisimple Lie algebra -- when defined properly -- can be lifted to an automorphism of that Lie algebra. In particular, this can be applied to automorphisms of the…

Differential Geometry · Mathematics 2022-08-22 Ivan Solonenko

The representation of polynomials by arithmetic circuits evaluating them is an alternative data structure which allowed considerable progress in polynomial equation solving in the last fifteen years. We present a circuit based computation…

Computational Complexity · Computer Science 2012-04-26 Joos Heintz , Bart Kuijpers , Andres Rojas Paredes

An irreducible representation of a reductive Lie algebra, when restricted to a Cartan subalgebra, decomposes into weights with multiplicity. The first part of this paper outlines a procedure to compute symmetric polynomials (e.g., power…

Representation Theory · Mathematics 2026-02-03 Rohit Joshi , Steven Spallone

For various series of complex semi-simple Lie algebras $\fg (t)$ equipped with irreducible representations $V(t)$, we decompose the tensor powers of $V(t)$ into irreducible factors in a uniform manner, using a tool we call {\it diagram…

Algebraic Geometry · Mathematics 2007-05-23 J. M. Landsberg , L. Manivel

We describe the structure of the Whittaker or Gelfand-Graev module on a $n$-fold metaplectic cover of a $p$-adic group $G$ at both the Iwahori and spherical level. We express our answer in terms of the representation theory of a quantum…

Representation Theory · Mathematics 2022-11-08 Valentin Buciumas , Manish M. Patnaik

In the article at hand, we sketch how, by utilizing nilpotency to its fullest extent (Engel, Super Engel) while using methods from the theory of universal enveloping algebras, a complete description of the indecomposable representations may…

Representation Theory · Mathematics 2012-10-09 Hans Plesner Jakobsen

Counterparts of several classical results of number theory are proven for the ring of polynomials with coefficients in a number field. A theorem of Milnor that determines the Witt ring of a function field is applied to prove an analogue of…

Number Theory · Mathematics 2024-07-09 William Duke

Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…

Symbolic Computation · Computer Science 2016-10-03 Matthew England , James H. Davenport