Results 51 to 60 of about 99 (75)
Infant Mental Health Journal: Infancy and Early Childhood, Volume 45, Issue 2, Page 234-246, March 2024.Abstract Improving parental sensitivity is an important objective of interventions to support families. This study examined reliability and validity of parental sensitivity ratings using a novel package of an e‐learning tool and an interactive decision tree provided through a mobile application, called the OK! package.
Mirte L. Forrer +3 more
wiley +1 more source
The permutation class Av(4213,2143) [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 We determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutation consists of the skew sum of a sequence of plane trees, together with an increasing sequence of points above and an increasing sequence of points to its ...
David Bevan
doaj +1 more source
Proofs of Conjectures about Pattern-Avoiding Linear Extensions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 After fixing a canonical ordering (or labeling) of the elements of a finite poset, one can associate each linear extension of the poset with a permutation.
Colin Defant
doaj +1 more source
The 26 Wilf-equivalence classes of length five quasi-consecutive patterns [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We present two families of Wilf-equivalences for consecutive and quasi-consecutive vincular patterns. These give new proofs of the classification of consecutive patterns of length $4$ and $5$.
Evan Chen, Shyam Narayanan
doaj +1 more source
Key-avoidance for alternating sign matrices [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe initiate a systematic study of key-avoidance on alternating sign matrices (ASMs) defined via pattern-avoidance on an associated permutation called the \emph{key} of an ASM.
Mathilde Bouvel +2 more
doaj +1 more source
Convexity of tableau sets for type A Demazure characters (key polynomials), parabolic Catalan numbers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 This is the first of three papers that develop structures which are counted by a "parabolic" generalization of Catalan numbers. Fix a subset R of {1,..,n-1}. Consider the ordered partitions of {1,..,n} whose block sizes are determined by R. These are the
Robert A. Proctor, Matthew J. Willis
doaj +1 more source
Classical pattern distributions in $\mathcal{S}_{n}(132)$ and $\mathcal{S}_{n}(123)$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Classical pattern avoidance and occurrence are well studied in the symmetric group $\mathcal{S}_{n}$. In this paper, we provide explicit recurrence relations to the generating functions counting the number of classical pattern occurrence in the set of ...
Dun Qiu, Jeffrey Remmel
doaj +1 more source
Distribution of sets of descent tops and descent bottoms on restricted permutations [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn 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
K-Orbit closures and Hessenberg varieties
Forum of Mathematics, SigmaThis article explores the relationship between Hessenberg varieties associated with semisimple operators with two eigenvalues and orbit closures of a spherical subgroup of the general linear group.
Mahir Bilen Can +3 more
doaj +1 more source
Involution factorizations of Ewens random permutations [PDF]
Discrete Mathematics & Theoretical Computer ScienceAn involution is a bijection that is its own inverse. Given a permutation $σ$ of $[n],$ let $\mathsf{invol}(σ)$ denote the number of ways $σ$ can be expressed as a composition of two involutions of $[n].$ We prove that the statistic $\mathsf{invol}$ is ...
Charles Burnette
doaj +1 more source