A Simple Combinatorial Proof of a Generalization of a Result of Polo
نویسنده
چکیده
We provide a simple combinatorial proof of, and generalize, a theorem of Polo which asserts that for any polynomial P ∈ N[q] such that P (0) = 1 there exist two permutations u and v in a suitable symmetric group such that P is equal to the Kazhdan-Lusztig polynomial P v u .
منابع مشابه
عدد تناوبی گرافها
In 2015, Alishahi and Hajiabolhassan introduced the altermatic number of graphs as a lower bound for the chromatic number of them. Their proof is based on the Tucker lemma, a combinatorial counterpart of the Borsuk-Ulam theorem, which is a well-known result in topological combinatorics. In this paper, we present a combinatorial proof for the Alishahi-Hajiabolhassan theorem.
متن کاملA four-parameter partition identity
where Par denotes the set of all partitions, |λ| denotes the size (sum of the parts) of λ, θ(λ) denotes the number of odd parts in the partition λ, and θ(λ′) denotes the number of odd parts in the conjugate of λ. In this paper, we generalize this result and provide a bijective proof of our generalization. This provides a simple combinatorial proof of Andrews’ result. Other combinatorial proofs ...
متن کاملA survey on the prevalence of heart murmurs in polo horses
Background: Cardiac murmur and subsequently cardiac failure is one of the poor-performance causes in athletic horses. Attention to murmur character is vital during heart examination. Polo is a sport which demands very high stress on horses, which may result in more stress on cardiovascular system. Objectives: In this study we assume that high pressure on polo horses makes them more susceptible ...
متن کاملA simple proof of Zariski's Lemma
Our aim in this very short note is to show that the proof of the following well-known fundamental lemma of Zariski follows from an argument similar to the proof of the fact that the rational field $mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.
متن کامل1 A ug 2 00 3 A Four - parameter Partition Identity
where Par denotes the set of all partitions, |λ| denotes the size (sum of the parts) of λ, θ(λ) denotes the number of odd parts in the partition λ, and θ(λ) denotes the number of odd parts in the conjugate of λ. A combinatorial proof of Andrews’ result was found by Sills in [2]. In this paper, we generalize this result and provide a combinatorial proof of our generalization. This gives a simple...
متن کامل