scholarly journals A Combinatorial Proof of a Symmetric $q$-Pfaff-Saalschütz Identity

10.37236/1969 ◽  
2005 ◽  
Vol 12 (1) ◽  
Author(s):  
Victor J. W. Guo ◽  
Jiang Zeng
Keyword(s):  
Elementary Proof ◽  
Combinatorial Proof ◽  
Bijective Proof

We give a bijective proof of a symmetric $q$-identity on $_4\phi_3$ series, which is a symmetric generalization of the famous $q$-Pfaff-Saalschütz identity. An elementary proof of this identity is also given.

scholarly journals Linear coefficients of Kerov's polynomials: bijective proof and refinement of Zagier's result

2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Valentin Féray ◽  
Ekaterina A. Vassilieva
Keyword(s):  
Stirling Numbers ◽  
Algebraic Methods ◽  
Combinatorial Proof ◽  
Nous Obtenons ◽  
Long Cycle ◽  
Bijective Proof ◽  
International Audience

International audience We look at the number of permutations $\beta$ of $[N]$ with $m$ cycles such that $(1 2 \ldots N) \beta^{-1}$ is a long cycle. These numbers appear as coefficients of linear monomials in Kerov's and Stanley's character polynomials. D. Zagier, using algebraic methods, found an unexpected connection with Stirling numbers of size $N+1$. We present the first combinatorial proof of his result, introducing a new bijection between partitioned maps and thorn trees. Moreover, we obtain a finer result, which takes the type of the permutations into account. Nous étudions le nombre de permutations $\beta$ de $[N]$ avec $m$ cycles telles que $(1 2 \ldots N) \beta^{-1}$ a un seul cycle. Ces nombres apparaissent en tant que coefficients des monômes linéaires des polynômes de Kerov et de Stanley. À l'aide de méthodes algébriques, D. Zagier a trouvé une connexion inattendue avec les nombres de Stirling de taille $N+1$. Nous présentons ici la première preuve combinatoire de son résultat, en introduisant une nouvelle bijection entre des cartes partitionnées et des arbres épineux. De plus, nous obtenons un résultat plus fin, prenant en compte le type des permutations.

scholarly journals Self-Dual Interval Orders and Row-Fishburn Matrices

10.37236/2201 ◽  
2012 ◽  
Vol 19 (2) ◽  
Author(s):  
Sherry H. F. Yan ◽  
Yuexiao Xu
Keyword(s):  
Generating Functions ◽  
Combinatorial Proof ◽  
Interval Orders ◽  
Triangular Matrices ◽  
Upper Triangular Matrices ◽  
Bijective Proof

Recently, Jelínek derived  that the number of self-dual interval orders of reduced size $n$ is twice the number of row-Fishburn matrices of size $n$ by using generating functions. In this paper, we present a bijective proof of this relation by establishing a bijection between two variations of upper-triangular matrices of nonnegative integers. Using the bijection, we provide a combinatorial proof  of the refined relations between self-dual Fishburn matrices and row-Fishburn matrices in answer to a problem proposed by Jelínek.

scholarly journals A Bijective Proof of the Alladi-Andrews-Gordon Partition Theorem

10.37236/4561 ◽  
2015 ◽  
Vol 22 (1) ◽  
Author(s):  
James J.Y. Zhao
Keyword(s):  
Combinatorial Proof ◽  
Partition Theorem ◽  
Bijective Proof

Based on the combinatorial proof of Schur's partition theorem given by Bressoud, and the combinatorial proof of Alladi's partition theorem given by Padmavathamma, Raghavendra and Chandrashekara, we obtain a bijective proof of a partition theorem of Alladi, Andrews and Gordon.

AN ELEMENTARY PROOF OF A THEOREM OF LEE

1991 ◽  
Vol 11 (3) ◽  
pp. 356-360 ◽  
Author(s):  
Jia'an Yan
Keyword(s):  
Elementary Proof

scholarly journals A new elementary proof of a theorem of Minkowski

1926 ◽  
Vol 2 (3) ◽  
pp. 97-99
Author(s):  
Matsusaburô Fujiwara
Keyword(s):  
Elementary Proof

scholarly journals Antisymmetry of the Stochastical Order on all Ordered Topological Spaces

2019 ◽  
Vol 7 (1) ◽  
pp. 250-252 ◽  
Author(s):  
Tobias Fritz
Keyword(s):  
Topological Space ◽  
General Result ◽  
Elementary Proof ◽  
Short Note ◽  
Stochastic Order ◽  
Topological Spaces ◽  
Probability Measures ◽  
Ordered Topological Space ◽  
Special Cases

Abstract In this short note, we prove that the stochastic order of Radon probability measures on any ordered topological space is antisymmetric. This has been known before in various special cases. We give a simple and elementary proof of the general result.

On random divisions of a convex set

1978 ◽  
Vol 15 (3) ◽  
pp. 645-649 ◽  
Author(s):  
Svante Janson
Keyword(s):  
Elementary Proof ◽  
Convex Set ◽  
Limiting Distribution ◽  
Independent Identically Distributed ◽  
Normally Distributed

This paper gives an elementary proof that, under some general assumptions, the number of parts a convex set in Rd is divided into by a set of independent identically distributed hyperplanes is asymptotically normally distributed. An example is given where the distribution of hyperplanes is ‘too singular' to satisfy the assumptions, and where a different limiting distribution appears.

Sign in / Sign up

Export Citation Format

Share Document