Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"bijective combinatorics"”.

  1. Deterministic and Probabilistic Bijective Combinatorics for Macdonald Polynomials

    Permuted-basement Macdonald polynomials 𝐸^𝜎_𝛼(𝐱; 𝑞, 𝑡) are nonsymmetric generalizations of symmetric Macdonald polynomials indexed by a composition 𝛼 and a permutation 𝜎. They form a basis for the polynomial ring ℚ(𝑞, 𝑡)[𝐱] for each fixed permutation 𝜎. They can be described combinatorially as …

    waterloo Repository record for Deterministic and Probabilistic Bijective Combinatorics for Macdonald Polynomials (opens in a new tab)