Results 71 to 80 of about 183,560 (141)

The combinatorics of pattern-avoiding matrices

open access: yes, 2023
A permutation matrix P partially avoids a quasi-permutation matrix A (i.e., a 01- matrix such that each column and row of A contains at most one nonzero entry) if there is no submatrix P′ of P of the same size as A satisfying Ai,j ≤ P′ i,j for all ...
Mikšaník, David
core  

Wilf classes of pairs of permutations of length 4

open access: yes, 2005
Sn(π1 π2, . . . , πr) denotes the set of permutations of length n that have no subsequence with the same order relations as any of the πi. In this paper we show that Sn(1342, 2143)| = |Sn(3142, 2341)| and Sn(1342, 3124)| = |Sn(1243, 2134)|.
Le, Ian
core   +1 more source

A Bijective Proof of an Unbalanced Wilf Equivalence

open access: yes
10 pages, 2 figures.
Bridges, Jensen, Waite, Michael
openaire   +2 more sources

Original 1200 dpi plates for Wilf et al. 2014 Agathis zamunerae paper in American Journal of Botany.

open access: yes, 2014
Original resolution, 1200 dpi versions of figures published in: Wilf P, IH Escapa, NR Cúneo, RM Kooyman, KR Johnson, A Iglesias. 2014. First South American Agathis (Araucariaceae), Eocene of Patagonia. American Journal of Botany, v. 101, p. 156-179.
Peter Wilf (523632)
core   +1 more source

Evaluation of an Employment Intervention for Veterans Transitioning From the Military: A Randomized Controlled Trial. [PDF]

open access: yesJ Nerv Ment Dis, 2022
Bond GR   +8 more
europepmc   +1 more source

Proof of a conjecture on the shape-Wilf-equivalence for partially ordered patterns

open access: yesEuropean Journal of Combinatorics
A partially ordered pattern (abbreviated POP) is a partially ordered set (poset) that generalizes the notion of a pattern when we are not concerned with the relative order of some of its letters. The notion of partially ordered patterns provides a convenient language to deal with large sets of permutation patterns.
Lintong Wang, Sherry H. F. Yan
openaire   +4 more sources

Generating functions for Wilf equivalence under generalized factor order

open access: yes, 2010
Kitaev, Liese, Remmel, and Sagan recently defined generalized factor order on words comprised of letters from a partially ordered set $(P, \leq_P)$ by setting $u \leq_P w$ if there is a subword $v$ of $w$ of the same length as $u$ such that the $i$-th character of $v$ is greater than or equal to the $i$-th character of $u$ for all $i$. This subword $v$
Langley, Thomas, Liese, J., Remmel, J.
openaire   +3 more sources

Home - About - Disclaimer - Privacy