The following pages link to Kassie Archer (Q294520):
Displaying 25 items.
- Descents of \(\lambda\)-unimodal cycles in a character formula (Q294521) (← links)
- Characterization of the allowed patterns of signed shifts (Q516799) (← links)
- Rooted forests that avoid sets of permutations (Q1715620) (← links)
- Patterns of negative shifts and signed shifts (Q1745146) (← links)
- Vertex-minimal planar graphs with cyclic 2-group symmetry (Q2045055) (← links)
- A new statistic on Dyck paths for counting 3-dimensional Catalan words (Q2111910) (← links)
- Pattern-restricted permutations composed of 3-cycles (Q2138988) (← links)
- Arithmetical structures on bidents (Q2182185) (← links)
- Counting acyclic and strong digraphs by descents (Q2198383) (← links)
- Classes of uniformly most reliable graphs for all-terminal reliability (Q2322865) (← links)
- Enumeration of cyclic permutations in vector grid classes (Q2335913) (← links)
- Unimodal permutations and almost-increasing cycles (Q2409827) (← links)
- Cyclic permutations realized by signed shifts (Q2448249) (← links)
- On the number of \(\lambda\)-unimodal involutions (Q2632709) (← links)
- Allowed Patterns of Symmetric Tent Maps via Commuter Functions (Q2968514) (← links)
- (Q4584119) (← links)
- Pattern restricted quasi-Stirling permutations (Q5197606) (← links)
- Characterization of the allowed patterns of signed shifts (Q5746184) (← links)
- Involutions and the Gelfand character (Q6100542) (← links)
- Enumerating two permutation classes by the number of cycles (Q6102520) (← links)
- Critical groups of arithmetical structures on star graphs and complete graphs (Q6117408) (← links)
- Enumerating Acyclic Digraphs by Descents (Q6290809) (← links)
- On the Intersection Numbers of Finite Groups (Q6321602) (← links)
- Cyclic permutations avoiding patterns in both one-line and cycle forms (Q6462763) (← links)
- Powers of permutations that avoid chains of patterns (Q6464707) (← links)