A common generalization of some identities.
Zhang, Zhizheng, Wang, Jun (2005)
Integers
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Flattening antichains with respect to the volume.”
A common generalization of some identities.
Full subsets of .
Naranjani, Lila, Mirzavaziri, Madjid (2011)
Journal of Integer Sequences [electronic only]
Similarity:
A curious identity involving binomial coefficients.
Sun, Zhiwei (2002)
Integers
Similarity:
On variants of Conway and Conolly's meta-Fibonacci recursions.
Isgur, Abraham, Rahman, Mustazee (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Splitting numbers of grids.
Duffus, Dwight, Sands, Bill (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Characterizing Frobenius semigroups by filtration.
Johnson, Inga, Powers, Sean, Starr, Colin, Trevelyan, Charles, Webster, Craig (2009)
Journal of Integer Sequences [electronic only]
Similarity:
On a linear Diophantine problem of Frobenius.
Tripathi, Amitabha (2006)
Integers
Similarity:
A simple proof of the geometric-arithmetic mean inequality.
Uchida, Yasuharu (2008)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Similarity:
Graph-based upper bounds for the probability of the union of events.
Veneziani, Pierangela (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Two coefficients of the Dyson product.
Lv, Lun, Xin, Guoce, Zhou, Yue (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Some local asymptotic laws for the Cauchy process on the line.
Okoroafor, A.Chukwuemeka (2007)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
A Grüss-type inequality and its applications.
Izumino, Saichi, Pečarić, Josip E., Tepeš, Božidar (2005)
Journal of Inequalities and Applications [electronic only]
Similarity:
The visibility parameter for words and permutations
Ligia Cristea, Helmut Prodinger (2013)
Open Mathematics
Similarity:
We investigate the visibility parameter, i.e., the number of visible pairs, first for words over a finite alphabet, then for permutations of the finite set {1, 2, …, n}, and finally for words over an infinite alphabet whose letters occur with geometric probabilities. The results obtained for permutations correct the formula for the expectation obtained in a recent paper by Gutin et al. [Gutin G., Mansour T., Severini S., A characterization of horizontal visibility graphs and combinatorics...