Results 21 to 30 of about 365 (70)
Sensitivities and block sensitivities of elementary symmetric Boolean functions
Boolean functions have important applications in molecular regulatory networks, engineering, cryptography, information technology, and computer science. Symmetric Boolean functions have received a lot of attention in several decades.
Zhang Jing, Li Yuan, Adeyeye John O.
doaj +1 more source
Consecutive Patterns in Inversion Sequences [PDF]
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
Pattern Avoidance for Random Permutations [PDF]
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
Distribution of sets of descent tops and descent bottoms on restricted permutations [PDF]
In this note, we prove some and conjecture other results regarding the distribution of descent top and descent bottom sets on some pattern-avoiding permutations.
Alexander Burstein
doaj +1 more source
Subclasses of the separable permutations [PDF]
We prove that all subclasses of the separable permutations not containing Av(231) or a symmetry of this class have rational generating functions. Our principal tools are partial well-order, atomicity, and the theory of strongly rational permutation ...
Albert, Michael H. +2 more
core +1 more source
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
Continued fractions for permutation statistics [PDF]
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
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
Pattern Avoidance in Weak Ascent Sequences [PDF]
In 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 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

