Zobrazeno 1 - 10
of 276
pro vyhledávání: '"Yan, Catherine"'
A fundamental identity in the representation theory of the partition algebra is $n^k = \sum_{\lambda} f^\lambda m_k^\lambda$ for $n \geq 2k$, where $\lambda$ ranges over integer partitions of $n$, $f^\lambda$ is the number of standard Young tableaux
Externí odkaz:
http://arxiv.org/abs/2405.07093
Vacillating tableaux are sequences of integer partitions that satisfy specific conditions. The concept of vacillating tableaux stems from the representation theory of the partition algebra and the combinatorial theory of crossings and nestings of mat
Externí odkaz:
http://arxiv.org/abs/2308.14183
Autor:
Snider, Lauren, Yan, Catherine
Graphical parking functions, or $G$-parking functions, are a generalization of classical parking functions which depend on a connected multigraph $G$ having a distinguished root vertex. Gaydarov and Hopkins characterized the relationship between $G$-
Externí odkaz:
http://arxiv.org/abs/2305.03651
A fundamental identity in the representation theory of the partition algeba is $n^k = \sum_{\lambda} f^\lambda m_k^\lambda$ for $n \geq 2k$, where $\lambda$ ranges over integer partitions of $n$, $f^\lambda$ is the number of standard Young tableaux o
Externí odkaz:
http://arxiv.org/abs/2208.13091
Autor:
Sacks, Gregory, Shah, Veer, Yao, Lilian, Yan, Catherine, Shah, Darshi, Limeta, Lorely, DeStefano, Vincent
Publikováno v:
In Biomedical Technology June 2024 6:75-89
Autor:
Yan, Catherine, Kleiner, Corinne, Tabigue, Aaron, Shah, Veer, Sacks, Gregory, Shah, Darshi, DeStefano, Vincent
Publikováno v:
In Engineered Regeneration March 2024 5(1):45-55
Univariate delta Gon\v{c}arov polynomials arise when the classical Gon\v{c}arov interpolation problem in numerical analysis is modified by replacing derivatives with delta operators. When the delta operator under consideration is the backward differe
Externí odkaz:
http://arxiv.org/abs/2012.01628
Autor:
Adeniran, Ayomikun, Yan, Catherine
The notion of parking sequences is a new generalization of parking functions introduced by Ehrenborg and Happ. In the parking process defining the classical parking functions, instead of each car only taking one parking space, we allow the cars to ha
Externí odkaz:
http://arxiv.org/abs/2005.04759
Autor:
Adeniran, Ayomikun, Yan, Catherine
Classical Gon\v{c}arov polynomials arose in numerical analysis as a basis for the solutions of the Gon\v{c}arov interpolation problem. These polynomials provide a natural algebraic tool in the enumerative theory of parking functions. By replacing the
Externí odkaz:
http://arxiv.org/abs/1907.07814
Autor:
King, Westin, Yan, Catherine
Classical parking functions can be defined in terms of drivers with preferred parking spaces searching a linear parking lot for an open parking spot. We may consider this linear parking lot as a collection of $n$ vertices (parking spots) arranged in
Externí odkaz:
http://arxiv.org/abs/1905.12010