English
Related papers

Related papers: A Toeplitz property of ballot permutations and odd…

200 papers

Dokos et. al. studied the distribution of two statistics over permutations $\mathfrak{S}_n$ of $\{1,2,\dots, n\}$ that avoid one or more length three patterns. A permutation $\sigma\in\mathfrak{S}_n$ contains a pattern…

Combinatorics · Mathematics 2017-09-26 Samantha Dahlberg

We study the distribution of cycle lengths in models of nonuniform random permutations with cycle weights. We identify several regimes. Depending on the weights, the length of typical cycles grows like the total number $n$ of elements, or a…

Probability · Mathematics 2011-01-06 Volker Betz , Daniel Ueltschi , Yvan Velenik

Type A affine shuffles are compared with riffle shuffles followed by a cut. Although these probability measures on the symmetric group S_n are different, they both satisfy a convolution property. Strong evidence is given that when the…

Combinatorics · Mathematics 2007-05-23 Jason Fulman

A celebrated analogy between prime factorizations of integers and cycle decompositions of permutations is explored here. Asymptotic formulas characterizing semismooth numbers (possessing at most several large factors) carry over to random…

Combinatorics · Mathematics 2022-05-03 Steven Finch

We show that the Mallows measure on permutations of $1,\ldots,n$ arises as the law of the unique Gale-Shapley stable matching of the random bipartite graph conditioned to be perfect, where preferences arise from a total ordering of the…

Probability · Mathematics 2023-06-22 Omer Angel , Alexander E. Holroyd , Tom Hutchcroft , Avi Levy

The Springer numbers are defined in connection with the irreducible root systems of type $B_n$, which also arise as the generalized Euler and class numbers introduced by Shanks. Combinatorial interpretations of the Springer numbers have…

Combinatorics · Mathematics 2010-09-14 William Y. C. Chen , Neil J. Y. Fan , Jeffrey Y. T. Jia

Andr\'e proved that the number of alternating permutations on $\{1, 2, \dots, n\}$ is equal to the Euler number $E_n$. A refinement of Andr\'e's result was given by Entringer, who proved that counting alternating permutations according to…

Combinatorics · Mathematics 2022-03-22 Yoann Gelineau , Heesung Shin , Jiang Zeng

Descents in permutations or words are defined from the relative position of two consecutive letters. We investigate a statistic involving patterns of k consecutive letters, and show that it leads to Hopf algebras generalizing noncommutative…

Combinatorics · Mathematics 2013-02-12 J. -C. Novelli , C. Reutenauer , J. -Y. Thibon

A multipermutation with $k$ copies each of $1\ldots n$ is Carlitz if neighbours are different. We enumerate these objects for $k=2,3,4$ and derive recurrences. In particular, we prove and improve a conjectured recurrence for $k=3$, stated…

Combinatorics · Mathematics 2017-02-20 Henrik Eriksson , Alexis Martin

An open conjecture in pattern avoidance theory is that the distribution of the major index among 321-avoiding permutations is distributed unimodally. We construct a formula for this distribution, and in the case of 2 descents prove…

Combinatorics · Mathematics 2017-07-14 William J. Keith

We study a sorting procedure (run-sorting) on permutations, where runs are rearranged in lexicographic order. We describe a rather surprising bijection on permutations on length $n$, with the property that it sends the set of peak-values to…

Combinatorics · Mathematics 2021-06-29 Per Alexandersson , Olivia Nabawanda

Pilz's conjecture states that for any finite set $A=\{a_1,a_2,\dots,a_k\}$ of positive integers and positive integer $n$ in the union of the sets $\{a_1,2a_1,\dots,na_1\},\dots, \{a_k,2a_k,\dots,na_k\}$ (considered as a multiset) at least…

Combinatorics · Mathematics 2024-09-24 János Nagy , Péter Pál Pach

Let $E$ be an elliptic curve over $\mathbf{Q}$. We conjecture asymptotic estimates for the number of vanishings of $L(E,1,\chi)$ as $\chi$ varies over all primitive Dirichlet characters of orders 4 and 6, subject to a mild hypothesis on…

Number Theory · Mathematics 2023-01-24 Jennifer Berg , Nathan C. Ryan , Matthew P. Young

In this paper, we first present combinatorial proofs of a kind of expansions of the Eulerian polynomials of types A and B, and then we introduce Stirling permutations of the second kind. In particular, we count Stirling permutations of the…

Combinatorics · Mathematics 2016-07-07 Shi-Mei Ma , Yeong-Nan Yeh

In this paper, we confirm conjectures of Laborde-Zubieta on the enumeration of corners in tree-like tableaux and in symmetric tree-like tableaux. In the process, we also enumerate corners in (type $B$) permutation tableaux and (symmetric)…

Combinatorics · Mathematics 2023-06-22 Alice L. L. Gao , Emily X. L. Gao , Patxi Laborde-Zubieta , Brian Y. Sun

New upper bounds on the relative entropy are derived as a function of the total variation distance. One bound refines an inequality by Verd\'{u} for general probability measures. A second bound improves the tightness of an inequality by…

Information Theory · Computer Science 2015-04-14 Igal Sason

We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the…

Combinatorics · Mathematics 2020-07-10 Sanjay Ramassamy

We propose some new results on the comparison of the minimum or maximum order statistic from a random number of non-identical random variables. Under the non-identical set-up, with certain conditions, we prove that random minimum (maximum)…

Statistics Theory · Mathematics 2024-03-08 Amarjit Kundu , Shovan Chowdhury , Bidhan Modok

Consider an odd-sized jury, which determines a majority verdict between two equiprobable states of Nature. If each juror independently receives a binary signal identifying the correct state with identical probability $p$, then the…

Probability · Mathematics 2019-11-28 Steve Alpern , Bo Chen , Adam J. Ostaszewski

It is conjectured that for every pair $(\ell,m)$ of odd integers greater than 2 with $m \equiv 1\; \pmod{\ell}$, there exists a cyclic two-factorization of $K_{\ell m}$ having exactly $(m-1)/2$ factors of type $\ell^m$ and all the others of…

Combinatorics · Mathematics 2016-04-01 Francesca Merola , Tommaso Traetta