Results 31 to 40 of about 167 (109)
Pattern Avoidance for Random Permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences and a ...
Harry Crane, Stephen DeSalvo
doaj +1 more source
Veterinary Dermatology, Volume 27, Issue 5, Page 391-e98, October 2016., 2016 Background– Pseudomonas aeruginosa (PA) may cause suppurative otitis externa with severe inflammation and ulceration in dogs. Multidrug resistance is commonly reported for this organism, creating a difficult therapeutic challenge. Objective– The aim of this study was to evaluate the in vitro antimicrobial activity of a gel containing 0.5 µg/mL of ...
Giovanni Ghibaudo +6 more
wiley +1 more source
Counting lattice paths by crossings and major index I: the corner-flipping bijections [PDF]
, 2022 We solve two problems regarding the enumeration of lattice paths in \(\mathbb{Z}^2\) with steps \((1,1)\) and \((1,-1)\) with respect to the major index, defined as the sum of the positions of the valleys, and to the number of certain crossings.
Elizalde, Sergi, Sergi Elizalde
core +1 more source
Continued fractions for permutation statistics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We explore a bijection between permutations and colored Motzkin paths that has been used in different forms by Foata and Zeilberger, Biane, and Corteel.
Sergi Elizalde
doaj +1 more source
Counting occurrences of 132 in an even permutation
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 25, Page 1329-1341, 2004., 2004 We study the generating function for the number of even (or odd) permutations on n letters containing exactly r ≥ 0 occurrences of a 132 pattern. It is shown that finding this function for a given r amounts to a routine check of all permutations in 𝔖2r.
Toufik Mansour
wiley +1 more source
Discrete Mathematics & Theoretical Computer Science, 2019 Two permutations in a class are Wilf-equivalent if, for every size, $n$, the number of permutations in the class of size $n$ containing each of them is the same.
Michael Albert, Jinge Li
doaj +1 more source
Pattern Avoidance in Weak Ascent Sequences [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn this paper, we study pattern avoidance in weak ascent sequences, giving some results for patterns of length 3. This is an analogous study to one given by Duncan and Steingr\'imsson (2011) for ascent sequences. More precisely, we provide systematically
Beáta Bényi +2 more
doaj +1 more source
Two-sided permutation statistics via symmetric functions
Forum of Mathematics, SigmaGiven 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
Interval and $\ell$-interval Rational Parking Functions [PDF]
Discrete Mathematics & Theoretical Computer ScienceInterval 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 +14 more
doaj +1 more source
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 +2 more
doaj +1 more source