arXiv math/06092482006-09-08math.CO

A note on exponents vs root heights for complex simple Lie algebras

Sankaran Viswanath

备注：: 5 pages

英文摘要：

We give an elementary combinatorial proof of a special case of a result due to Bazlov and Ion concerning the Fourier coefficients of the Cherednik kernel. This can be used to give yet another proof of the classical fact that for a complex simple Lie algebra, the partition formed by its exponents is dual to that formed by the numbers of positive roots at each height.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

The height distribution in root systems

We prove several formulas for the distribution of positive roots.

2017-12-29math.CO

A statistic on the roots of a finite reflection group and a correspondence between the height function and Bruhat order

The action of a finite reflection group (type A) on its set of roots is understood as a permutation representation or group action. We show that this representation is an induced representation from a certain kind of parabolic subgroup. Furthermore, we use this representation to define a statistic (derived from the length function) on the set of roots. A possible application to Costas Arrays is hinted at in a proposition.

2008-03-12math.COmath.GR

Combinatorial differential operators in: Faà di Bruno formula, enumeration of ballot paths, enriched rooted trees and increasing rooted trees

We obtain a differential equation for the enumeration of the path length of general increasing trees. By using differential operators and their combinatorial interpretation we give a bijective proof of a version of Faà di Bruno formula, and model the generation of ballot and Dyck paths. We get formulas for its enumeration according with the height of their lattice points. Recursive formulas for the enumeration of enriched increasing trees and forests with respect to the height of their internal and external vertices are also obtained. Finally we present a generalized form of all those results …

2016-10-12math.CO

The largest coefficient of the highest root and the second smallest exponent

There are many different ways that the exponents of Weyl groups of irreducible root systems have been defined and put into practice. One of the most classical and algebraic definitions of the exponents is related to the eigenvalues of Coxeter elements. While the coefficients of the height root when expressed as a linear combination of simple roots are combinatorial objects in nature, there are several results asserting relations between these exponents and coefficients. This study was conducted to give a uniform and fairly elementary proof of the fact that the second smallest exponent of the W…

2018-12-29math.CO

Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and Applications

In this paper, we redesign and simplify an algorithm due to Remy et al. for the generation of rooted planar trees that satisfies a given partition of degrees. This new version is now optimal in terms of random bit complexity, up to a multiplicative constant. We then apply a natural process "simulate-guess-and-proof" to analyze the height of a random Motzkin in function of its frequency of unary nodes. When the number of unary nodes dominates, we prove some unconventional height phenomenon (i.e. outside the universal square root behaviour.)

2014-01-19cs.DMmath.CO

A bijection of plane increasing trees with relaxed binary trees of right height at most one

Plane increasing trees are rooted labeled trees embedded into the plane such that the sequence of labels is increasing on any branch starting at the root. Relaxed binary trees are a subclass of unlabeled directed acyclic graphs. We construct a bijection between these two combinatorial objects and study the therefrom arising connections of certain parameters. Furthermore, we show central limit theorems for two statistics on leaves. We end the study by considering more than 20 subclasses and their bijective counterparts. Many of these subclasses are enumerated by known counting sequences, and th…

2018-07-11cs.DMmath.CO

更多相关论文收起更多论文

Moving between weights of weight modules

In Lie theory the partial sum property (PSP) says that for a root system in any Kac-Moody algebra, every positive root is an ordered sum of simple roots whose partial sums are all roots. In this paper, we present two generalizations: 1) "Parabolic generalization": if $I$ is a subset of simple roots, every root with positive $I$-height is an ordered sum of roots of $I$-height 1, whose partial sums are all roots. In fact we show this on the Lie algebra level, by showing that every root space is spanned by the Lie words formed from root vectors of $I$-height 1. As an application, we provide a "mi…

2021-02-09math.COmath.RT

Ferrers-胞腔偏序集的 q-Zeta 分子的正公式

$q$-Zeta positivity for root and Ferrers-cell posets

Peking University（北京大学）；Tsinghua University（清华大学）

本文为Ferrers-胞腔偏序集的q-Zeta分子给出显式正公式，通过带符号EL-标号和转移矩阵递推计算下降集多项式，并推广到正根偏序集，获得零点、交错性及增长率等结果。

2026-10-19math.CO

The Cherednik kernel and generalized exponents

We show how the knowledge of the Fourier coefficients of the Cherednik kernel leads to combinatorial formulas for generalized exponents. We recover known formulas for generalized exponents of irreducible representations parameterized by dominant roots, and obtain new formulas for the generalized exponents for irreducible representations parameterized by the dominant elements of the root lattice which are sums of two orthogonal short roots.

2003-11-17math.COmath.RT

Percolation probability and critical exponents for site percolation on the UIPT

We derive three critical exponents for Bernoulli site percolation on the on the Uniform Infinite Planar Triangulation (UIPT). First we compute explicitly the probability that the root cluster is infinite. As a consequence, we show that the off-critical exponent for site percolation on the UIPT is $β= 1/2$. Then we establish an integral formula for the generating function of the number of vertices in the root cluster. We use this formula to prove that, at criticality, the probability that the root cluster has at least $n$ vertices decays like $n^{-1/7}$. Finally, we also derive an expression fo…

2022-01-28math-phmath.COmath.MP