Researchain
Decentralized Journals
A
Archives
Welcome to Researchain!
Feedback Center
Decentralized Journals
A
Archives
Updated
Mathematics
Combinatorics
A combinatorial proof of the log-concavity of the numbers of permutations with k runs
Miklós Bóna
,
Richard Ehrenborg
Abstract
We combinatorially prove that the number R(n,k) of permutations of length n having k runs is a log-concave sequence in k , for all n . We also give a new combinatorial proof for the log-concavity of the Eulerian numbers.
Full PDF
Related Researches
Toric Codes from Order Polytopes
by
Mahir Bilen Can
More about Exact Slow k -Nim
by
Nikolay Chikin
Maximal distance spectral radius of 4-chromatic planar graphs
by
Aysel Erey
Spanning trees in dense directed graphs
by
Amarja Kathapurkar
Expected Value of Statistics on Type-B Permutation Tableaux
by
Ryan Althoff
On multichromatic numbers of widely colorable graphs
by
Anna Gujgiczer
Twin-width IV: low complexity matrices
by
?douard Bonnet
Length of a Full Steiner Tree as a Function of Terminal Coordinates
by
Alexei Yu. Uteshev
On the Signed Complete Graphs with Maximum Index
by
N. Kafai
Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
by
Mingqing Zhai
Hex implies Y
by
Tomasz Prytu?a
Twenty Vertex model and domino tilings of the Aztec triangle
by
Philippe Di Francesco
Factorizations of Complete Multipartite Hypergraphs
by
Amin Bahmanian
New upper bounds for the forgotten index among bicyclic graphs
by
A. Jahanbani
Tournaments with maximal decomposability
by
Cherifa Ben Salha
Sum-distinguishing number of sparse hypergraphs
by
Maria Axenovich
On list chromatic numbers of 2-colorable hypergraphs
by
Danila Cherkashin
Extending Edge-colorings of Complete Hypergraphs into Regular Colorings
by
Amin Bahmanian
There are only a finite number of excluded minors for the class of bicircular matroids
by
Matt DeVos
Tutte polynomials of fan-like graphs with applications in benzenoid systems
by
Tianlong Ma
Optimally reconnecting weighted graphs against an edge-destroying adversary
by
Daniel C. McDonald
On a metric property of perfect colorings
by
Anna A. Taranenko
Hamiltonicity of graphs perturbed by a random geometric graph
by
Alberto Espuny Díaz
A unified half-integral Erd?s-Pósa theorem for cycles in graphs labelled by multiple abelian groups
by
J. Pascal Gollin
Hypergraphs with many extremal configurations
by
Xizhi Liu
«
1
2
3
4
»
Submitted on 3 Feb 1999
Updated
arXiv.org
Original Source
NASA ADS
Google Scholar
Semantic Scholar