Combinatorics of theq-Basis of Symmetric Functions
نویسندگان
چکیده
منابع مشابه
Combinatorics of theq-Basis of Symmetric Functions
A basis of symmetric functions, which we denote by q*(X; q, t), was introduced in the work of Ram and King and Wybourne in order to describe the irreducible characters of the Hecke algebras of type A. In this work we give combinatorial descriptions of the expansions of the functions q*(X; q, t) in terms of the classical bases of symmetric functions and apply these results in determining the det...
متن کاملCombinatorics, Symmetric Functions, and Hilbert Schemes
We survey the proof of a series of conjectures in combinatorics using new results on the geometry of Hilbert schemes. The combinatorial results include the positivity conjecture for Macdonald’s symmetric functions, and the “n!” and “(n + 1)n−1” conjectures relating Macdonald polynomials to the characters of doubly-graded Sn modules. To make the treatment self-contained, we include background ma...
متن کاملa contrastive study of rhetorical functions of citation in iranian and international elt scopus journals
writing an academic article requires the researchers to provide support for their works by learning how to cite the works of others. various studies regarding the analysis of citation in m.a theses have been done, while little work has been done on comparison of citations among elt scopus journal articles, and so the dearth of research in this area demands for further investigation into citatio...
study of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
Symmetric functions of qubits in an unknown basis
Consider an n qubit computational basis state corresponding to a bit string x, which has had an unknown local unitary applied to each qubit, and whose qubits have been reordered by an unknown permutation. We show that, given such a state with Hamming weight |x| ≤ bn/2c, it is possible to reconstruct |x| with success probability 1 − |x|/(n − |x| + 1), and thus to compute any symmetric function o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1996
ISSN: 0097-3165
DOI: 10.1006/jcta.1996.0103