Results 31 to 40 of about 569 (73)
Consecutive Patterns in Inversion Sequences [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 An inversion sequence of length $n$ is an integer sequence $e=e_{1}e_{2}\dots e_{n}$ such that $0\leq e_{i}
Juan S. Auli, Sergi Elizalde
doaj +1 more source
Applications of the Finite State Automata for Counting Restricted Permutations and Variations
, 2012 : In this paper, we use the finite state automata to count the number of restricted permutations and the number of restricted variations. For each type of restricted permutations, we construct a finite state automaton able to recognize and enumerate them.
V. Baltic
semanticscholar +1 more source
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
Solving multivariate functional equations [PDF]
, 2013 This paper presents a new method to solve functional equations of multivariate generating functions, such as $$F(r,s)=e(r,s)+xf(r,s)F(1,1)+xg(r,s)F(qr,1)+xh(r,s)F(qr,qs),$$ giving a formula for $F(r,s)$ in terms of a sum over finite sequences.
Amy Lee +12 more
core +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
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
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
Bicomplex generalized k-Horadam quaternions
Miskolc Mathematical Notes, 2019 This study provides a broad overview of the generalization of the various quaternions, especially in the context of its enhancing importance in the disciplines of mathematics and physics.
Y. Yazlık, Sure Köme, Cahit Köme
semanticscholar +1 more source