Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOrthogonal polynomials associated with root systems
154
0
0.0
(
0
)
Authors
Ian G. Macdonald
Ask ChatGPT about the research
No Arabic abstract
Let R and S be two irreducible root systems spanning the same vector space and having the same Weyl group W, such that S (but not necessarily R) is reduced. For each such pair (R,S) we construct a family of W-invariant orthogonal polynomials in several variables, whose coefficients are rational functions of parameters $q,t_1,t_2,...,t_r$, where r (=1,2 or 3) is the number of W-orbits in R. For particular values of these parameters, these polynomials give the values of zonal spherical functions on real and p-adic symmetric spaces. Also when R=S is of type $A_n$, they conincide with the symmetric polynomials described in I. G. Macdonald, Symmetric Functions and Hall Polynomials, 2nd edition, Oxford University Press (1995), Chapter VI.
rate research
Read More
Polynomials in this paper are defined starting from a compact semisimple Lie group. A known classification of maximal, semisimple subgroups of simple Lie groups is used to select the cases to be considered here. A general method is presented and all the cases of rank not greater then 3 are explicitly studied. We derive the polynomials of simple Lie groups B_3 and C_3 as they are not available elsewhere. The results point to far reaching Lie theoretical connections to the theory of multivariable orthogonal polynomials.
Recursive algebraic construction of two infinite families of polynomials in $n$ variables is proposed as a uniform method applicable to every semisimple Lie group of rank $n$. Its result recognizes Chebyshev polynomials of the first and second kind as the special case of the simple group of type $A_1$. The obtained not Laurent-type polynomials are proved to be equivalent to the partial cases of the Macdonald symmetric polynomials. Basic relation between the polynomials and their properties follow from the corresponding properties of the orbit functions, namely the orthogonality and discretization. Recurrence relations are shown for the Lie groups of types $A_1$, $A_2$, $A_3$, $C_2$, $C_3$, $G_2$, and $B_3$ together with lowest polynomials.
Discrete spectral transformations of skew orthogonal polynomials are presented. From these spectral transformations, it is shown that the corresponding discrete integrable systems are derived both in 1+1 dimension and in 2+1 dimension. Especially in the (2+1)-dimensional case, the corresponding system can be extended to 2x2 matrix form. The factorization theorem of the Christoffel kernel for skew orthogonal polynomials in random matrix theory is presented as a by-product of these transformations.
Let $R$ be a finite ring and define the hyperbola $H={(x,y) in R times R: xy=1 }$. Suppose that for a sequence of finite odd order rings of size tending to infinity, the following square root law bound holds with a constant $C>0$ for all non-trivial characters $chi$ on $R^2$: [ left| sum_{(x,y)in H}chi(x,y)right|leq Csqrt{|H|}. ] Then, with a finite number of exceptions, those rings are fields. For rings of even order we show that there are other infinite families given by Boolean rings and Boolean twists which satisfy this square-root law behavior. We classify the extremal rings, those for which the left hand side of the expression above satisfies the worst possible estimate. We also describe applications of our results to problems in graph theory and geometric combinatorics. These results provide a quantitative connection between the square root law in number theory, Salem sets, Kloosterman sums, geometric combinatorics, and the arithmetic structure of the underlying rings.
The root systems appearing in the theory of Lie superalgebras and Nichols algebras admit a large symmetry extending properly the one coming from the Weyl group. Based on this observation we set up a general framework in which the symmetry object is a groupoid. We prove that in our context the groupoid is generated by reflections and Coxeter relations. This answers a question of Serganova. Our weak version of the exchange condition allows us to prove Matsumotos theorem. Therefore the word problem is solved for the groupoid.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
