Results 71 to 80 of about 94 (91)

Combinatorial parameters in bargraphs

open access: yesQuaestiones Mathematicae, 2016
Bargraphs are non-intersecting lattice paths in N2 0 with 3 allowed types of steps; up (0, 1), down (0,−1) and horizontal (1, 0). They start at the origin with an up step and terminate immediately upon return to the x-axis.
Charlotte Brennan   +2 more
exaly   +1 more source
Some of the next articles are maybe not open access.

Related searches:

Guessing about Guessing: Practical Strategies for Card Guessing with Feedback

American Mathematical Monthly, 2022
Sam Spiro, Ronald Graham
exaly  

Algebraic aspects of increasing subsequences

Duke Mathematical Journal, 2001
Jinho Baik, Eric M Rains
exaly  

Maximally Nontransitive Dice

American Mathematical Monthly, 2018
Ronald Graham
exaly  

Bootstrap percolation in three dimensions

Annals of Probability, 2009
Robert Morris, József Balogh
exaly  

Random Graph-Homomorphisms and Logarithmic Degree

Electronic Journal of Probability, 2007
Amir Yehudayoff, Ariel Yadin
exaly  

q-exchangeability via quasi-invariance

Annals of Probability, 2010
Grigori Olshanski, Alexander Gnedin
exaly  

Limits of local algorithms over sparse random graphs

Annals of Probability, 2017
David Gamarnik
exaly  

The Brownian limit of separable permutations

Annals of Probability, 2018
Valentin Feray   +2 more
exaly  

Home - About - Disclaimer - Privacy