Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Kassie Archer"'
Publikováno v:
Enumerative Combinatorics and Applications, Vol 5, Iss 1, p Article #S2R3 (2024)
Externí odkaz:
https://doaj.org/article/99dda978edc34ac8af62721d00252c2d
Autor:
Kassie Archer
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 22 no. 2, Permutation..., Iss Special issues (2022)
We enumerate permutations in the two permutation classes $\text{Av}_n(312, 4321)$ and $\text{Av}_n(321, 4123)$ by the number of cycles each permutation admits. We also refine this enumeration with respect to several statistics.
Externí odkaz:
https://doaj.org/article/41b9edddd2c64142a730ad92eddd2185
Autor:
Kassie Archer
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AT,..., Iss Proceedings (2014)
We prove an identity conjectured by Adin and Roichman involving the descent set of $\lambda$-unimodal cyclic permutations. These permutations appear in the character formulas for certain representations of the symmetric group and these formulas are u
Externí odkaz:
https://doaj.org/article/f0faef00a8134169952174ee863a5fdb
Autor:
Kassie Archer, Sergi Elizalde
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AS,..., Iss Proceedings (2013)
The periodic patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial description of the periodic patterns of an arbitrary signed shift, in terms of the structure of the desce
Externí odkaz:
https://doaj.org/article/175a59d52c9b496ab6743d2f53bf88aa
Publikováno v:
Journal of Algebraic Combinatorics. 57:811-828
The Gelfand representation of $\mathcal{S}_n$ is the multiplicity-free direct sum of the irreducible representations of $\mathcal{S}_n$. In this paper, we use a result of Adin, Postnikov, and Roichman to find a recursive generating function for the G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6185a6913d14d40b13eda7ca013fb1ea
https://doi.org/10.1007/s10801-022-01194-3
https://doi.org/10.1007/s10801-022-01194-3
Autor:
Charles Schmidt, L.-K. Lauderdale, Kassie Archer, Phung T. Tran, Rebecca Darby, Asa Linson, Mariah K. Maxfield
Publikováno v:
Journal of Algebraic Combinatorics. 54:1-15
For the positive integer m, let $${\mathbb {Z}}_m$$ denote the cyclic group of order m. Vertex-minimal planar graphs with prescribed automorphism group $${\mathbb {Z}}_m$$ were first considered by Marusic. In particular, when m is odd he produced a v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e31017e5c8d60f626bc4c20bf489a3b
https://doi.org/10.1007/s10801-020-00964-1
https://doi.org/10.1007/s10801-020-00964-1
Autor:
Kassie Archer, Christina Graves
Publikováno v:
Discrete Mathematics. 346:113247
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f234012fd23b34c8631641ef90936c2
https://doi.org/10.1016/j.disc.2022.113247
https://doi.org/10.1016/j.disc.2022.113247
Publikováno v:
Discrete Applied Mathematics. 267:12-29
The all-terminal reliability polynomial of a graph G is the probability that G remains connected if each edge is independently included with fixed probability p . Among all graphs with a fixed number of n vertices and m edges, a graph is uniformly mo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c36721f263ae4ea1b842f00ead544f0
https://doi.org/10.1016/j.dam.2019.04.022
https://doi.org/10.1016/j.dam.2019.04.022
Autor:
Kassie Archer, Christina Graves
In this paper, we characterize and enumerate pattern-avoiding permutations composed of only 3-cycles. In particular, we answer the question for the six patterns of length 3. We find that the number of permutations composed of $n$ 3-cycles that avoid
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::639a0d75d06e625944cb0aeb9081912d
http://arxiv.org/abs/2104.12664
http://arxiv.org/abs/2104.12664
Autor:
Kassie Archer, Scott M. LaLonde
Publikováno v:
SIAM Journal on Discrete Mathematics. 31:317-334
We introduce a new technique to study pattern avoidance in dynamical systems, namely the use of a commuter function between non-conjugate dynamical systems. We investigate the properties of such a commuter function, specifically $h : [0,1] \to [0,1]$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1b69c92b8a37e9c74f37fa92d4f2e38
https://doi.org/10.1137/16m1078495
https://doi.org/10.1137/16m1078495