Results 91 to 100 of about 176,018 (136)
Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations. [PDF]
SIAM J Discret Math, 2020 Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
A Simple Bijective Proof of the Shape-Wilf-Equivalence of the Patterns 231 and 312
, 2011 10 ...
Bloom, Jonathan, Saracino, Dan
openaire +2 more sources
Artificial Examples of Empirical Equivalence [PDF]
, 2013 In this paper I analyze three artificial examples of empirical equivalence: van Fraassen’s alternative formulations of Newton’s theory, the Poincaré-Reichenbach argument for the conventionality of geometry; and predictively equivalent ‘systems of the ...
Acuña, Pablo
core
Stimulus Equivalence: A Comparison of Operant and Associative Procedures [PDF]
, 2011 Previous studies comparing the effectiveness of the stimulus-pairing-observation and matching-to-sample procedures in facilitating the formation of equivalence relations have had conflicting findings.
Kinloch, Jennifer May
core
Extending Results on Wilf-Equivalence of Partial Shuffles
In 2020, Bloom and Sagan defined subsets of the symmetric group $\mathfrak{S}_n$ called partial shuffles, and proved a formula for the Schur expansion of the pattern quasisymmetric function associated with a partial shuffle. In their proof, they establish that any two partial shuffles of the same size are Wilf-equivalent.
Albert, Michael +2 more
openaire +2 more sources
New Wilf-equivalence results for dashed patterns
, 2012 We give a sufficient condition for the two dashed patterns $τ^{(1)}-τ^{(2)}-\cdots-τ^{(\ell)}$ and $τ^{(\ell)}-τ^{(\ell-1)}-\cdots-τ^{(1)}$ to be (strongly) Wilf-equivalent. This permits to solve in a unified way several problems of Heubach and Mansour on Wilf-equivalences on words and compositions, as well as a conjecture of Baxter and Pudwell on Wilf-
openaire +2 more sources
Pattern avoidance and dominating compositions [PDF]
Enumerative Combinatorics and Applications, 2021 Krishna Menon, Anurag Singh
doaj
Wilf Dillon interviewed by Cynthia Brown, 5 March 2003
, 2003 Interview with Wilf Dillon [WD], born 1920. WD gives a brief description of his childhood. [00:02:12] WD describes a game from his childhood called 'Faggies'; which was played with cards from packs of cigarettes and the cigarettes themselves.
Dillon, Wilf
core
A Wilf equivalence related to two stack sortable permutations
, 2005 A permutation is so-called two stack sortable if it (i) avoids the (scattered) pattern 2-3-4-1, and (ii) contains a 3-2-4-1 pattern only as part of a 3-5-2-4-1 pattern. Here we show that the permutations on [n] satisfying condition (ii) alone are equinumerous with the permutations on [n] that avoid the mixed scattered/consecutive pattern 31-4-2.
openaire +2 more sources
, 2011 Heildartexti lokaskýrslu. Prentuð útgáfa og öll fylgi gögn á CD eru varðveitt í bókasafni HRThis B.Sc. project deals with mesh pattern avoidance in permutations. A mesh pattern is a pair P=(p,R), where p is a permutation of length k and R is a subset of [
Steinunn Gróa Sigurðardóttir 1987- +3 more
core +2 more sources