Results 41 to 50 of about 569 (73)

On the number of pancake stacks requiring four flips to be sorted [PDF]

Discrete Mathematics & Theoretical Computer Science, 2019
Using existing classification results for the 7- and 8-cycles in the pancake graph, we determine the number of permutations that require 4 pancake flips (prefix reversals) to be sorted.
Saúl A. Blanco, Charles Buehrle, Akshay Patidar   +2 more
doaj   +1 more source

Two-sided permutation statistics via symmetric functions

Forum of Mathematics, Sigma
Given a permutation statistic $\operatorname {\mathrm {st}}$ , define its inverse statistic $\operatorname {\mathrm {ist}}$ by . We give a general approach, based on the theory of symmetric functions, for finding the joint distribution of
Ira M. Gessel, Yan Zhuang
doaj   +1 more source

The expected number of inversions after n adjacent transpositions [PDF]

Discrete Mathematics & Theoretical Computer Science, 2009
We give a new expression for the expected number of inversions in the product of n random adjacent transpositions in the symmetric group S_{m+1}. We then derive from this expression the asymptotic behaviour of this number when n scales with m in various ...
Mireille Bousquet-Mélou
doaj   +1 more source

Interval and $\ell$-interval Rational Parking Functions [PDF]

Discrete Mathematics & Theoretical Computer Science
Interval parking functions are a generalization of parking functions in which cars have an interval preference for their parking. We generalize this definition to parking functions with $n$ cars and $m\geq n$ parking spots, which we call interval ...
Tomás Aguilar-Fraga, Jennifer Elder, Rebecca E. Garcia, Kimberly P. Hadaway, Pamela E. Harris, Kimberly J. Harry, Imhotep B. Hogan, Jakeyl Johnson, Jan Kretschmann, Kobe Lawson-Chavanu, J. Carlos Martínez Mori, Casandra D. Monroe, Daniel Quiñonez, Dirk Tolson III, Dwight Anderson Williams II   +14 more
doaj   +1 more source

On the problem of Molluzzo for the modulus 4

, 2012
We solve the currently smallest open case in the 1976 problem of Molluzzo on $\mathbb{Z}/m\mathbb{Z}$, namely the case $m=4$. This amounts to constructing, for all positive integer $n$ congruent to $0$ or $7 \bmod{8}$, a sequence of integers modulo $4 ...
Chappelon, Jonathan, Eliahou, Shalom
core   +3 more sources

Efficacy and Field Safety of Ilunocitinib for the Control of Allergic Dermatitis in Client‐Owned Dogs: A Multicenter, Double‐Masked, Randomised, Placebo‐Controlled Clinical Trial

Veterinary Dermatology, EarlyView.
Background: Inhibition of the Janus kinase pathway is an established treatment for allergic dermatitis. Objective: To evaluate the efficacy and safety of ilunocitinib for control of pruritus in dogs with allergic dermatitis in a randomised, double‐masked clinical trial.
Sophie Forster, Candace M. Trout, Simona Despa, Annette Boegel, Darren Berger, Stephen King   +5 more
wiley   +1 more source

Alternating sign matrices with reflective symmetry and plane partitions: $n+3$ pairs of equivalent statistics and a Cauchy-type identity

Forum of Mathematics, Sigma
Vertically symmetric alternating sign matrices (VSASMs) of order $2n+1$ are known to be equinumerous with lozenge tilings of a hexagon with side lengths $2n+2,2n,2n+2,2n,2n+2,2n$ and a central triangular hole of size $2$ that exhibit
Ilse Fischer, Hans Höngesberg
doaj   +1 more source

Sorting inversion sequences [PDF]

Discrete Mathematics & Theoretical Computer Science
We consider the avoidance of patterns in inversion sequences that relate sorting via sorting machines including data structures such as pop stacks and stacks.
Toufik Mansour, Howard Skogman, Rebecca Smith   +2 more
doaj   +1 more source

Cyclic to Random Transposition Shuffles [PDF]

, 2012
Consider a permutation $\sigma\in S_n$ as a deck of cards numbered from 1 to $n$ and laid out in a row, where $\sigma_j$ denotes the number of the card that is in the $j$-th position from the left.\rm\ We define two cyclic to random transposition ...
Pinsky, Ross G.
core  

Two Vignettes On Full Rook Placements [PDF]

, 2013
Using bijections between pattern-avoiding permutations and certain full rook placements on Ferrers boards, we give short proofs of two enumerative results.
Bloom, Jonathan, Vatter, Vince
core