Polynomials from Combinatorial -theory

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorial theory of Macdonald polynomials I: proof of Haglund's formula.

Haglund recently proposed a combinatorial interpretation of the modified Macdonald polynomials H(mu). We give a combinatorial proof of this conjecture, which establishes the existence and integrality of H(mu). As corollaries, we obtain the cocharge formula of Lascoux and Schutzenberger for Hall-Littlewood polynomials, a formula of Sahi and Knop for Jack's symmetric functions, a generalization o...

متن کامل

Combinatorial Rigidity for Unicritical Polynomials

We prove that any unicritical polynomial fc : z 7→ z+c which is at most finitely renormalizable and has only repelling periodic points is combinatorially rigid. It implies that the connectedness locus (the “Multibrot set”) is locally connected at the corresponding parameter values. It generalizes Yoccoz’s Theorem for quadratics to the higher degree case. Stony Brook IMS Preprint #2005/05 July 2005

متن کامل

Combinatorial Trigonometry with Chebyshev Polynomials

The Chebyshev polynomials have many beautiful properties and countless applications, arising in a variety of continuous settings. They are a sequence of orthogonal polynomials appearing in approximation theory, numerical integration, and differential equations. In this paper we approach them instead as discrete objects, counting the sum of weighted tilings. Using this combinatorial approach, on...

متن کامل

certain combinatorial topics in group theory

this article is intended to be a survey on some combinatorial topics in group theory. the bibliography at the end is neither claimed to be exhaustive, nor is it necessarily connected with a reference in the text. i include it as i see it revolves around the concepts which are discussed in the text.

متن کامل

A Combinatorial Identity Arising from Cobordism Theory

Let α = (α1, α2, · · · , αm) ∈ R>0. Let αi,j be the vector obtained from α by deleting the entries αi and αj . Besser and Moree [1] introduced some invariants and near invariants related to the solutions ∈ {±1}m−2 of the linear inequality |αi −αj | < 〈 , αi,j〉 < αi +αj , where 〈, 〉 denotes the usual inner product and αi,j the vector obtained from α by deleting αi and αj . The main result of Bes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Canadian Journal of Mathematics

سال: 2019

ISSN: 0008-414X,1496-4279

DOI: 10.4153/s0008414x19000464