Results 31 to 40 of about 1,020 (80)
Pattern Avoiding Permutations Enumerated by Inversions [PDF]
Discrete Mathematics & Theoretical Computer SciencePermutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations.
Atli Fannar Franklín
doaj +1 more source
Determinant of binary circulant matrices
Special Matrices, 2019 This article gives a closed-form expression for the determinant of binary circulant matrices.
Hariprasad M.
doaj +1 more source
On an alternative sequence comparison statistic of Steele [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 The purpose of this paper is to study a statistic that is used to compare the similarity between two strings, which is first introduced by Michael Steele in 1982.
Ümit Işlak, Alperen Y. Özdemir
doaj +1 more source
Lattice Paths and Pattern-Avoiding Uniquely Sorted Permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 Defant, Engen, and Miller defined a permutation to be uniquely sorted if it has exactly one preimage under West's stack-sorting map. We enumerate classes of uniquely sorted permutations that avoid a pattern of length three and a pattern of length four by
Hanna Mularczyk
doaj +1 more source
Long increasing subsequences and non-algebraicity [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe use a recent result of Alin Bostan to prove that the generating functions of two infinite sequences of permutation classes are not algebraic.
Miklos Bona
doaj +1 more source
Snow Leopard Permutations and Their Even and Odd Threads [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Caffrey, Egge, Michel, Rubin and Ver Steegh recently introduced snow leopard permutations, which are the anti-Baxter permutations that are compatible with the doubly alternating Baxter permutations. Among other things, they showed that these permutations
Eric S. Egge, Kailee Rubin
doaj +1 more source
A positional statistic for 1324-avoiding permutations [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe consider the class $S_n(1324)$ of permutations of size $n$ that avoid the pattern 1324 and examine the subset $S_n^{a\prec n}(1324)$ of elements for which $a\prec n\prec [a-1]$, $a\ge 1$.
Juan B. Gil +2 more
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
Random and exhaustive generation of permutations and cycles
, 2007 In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. This algorithm is very similar to the standard method for generating a random permutation, but is less well known.
D. Gries +8 more
core +3 more sources
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