Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Vega, Julianne"'
An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we prove that th
Externí odkaz:
http://arxiv.org/abs/2411.04601
A (general) polygonal line tiling is a graph formed by a string of cycles, each intersecting the previous at an edge, no three intersecting. In 2022, Matsushita proved the matching complex of a certain type of polygonal line tiling with even cycles i
Externí odkaz:
http://arxiv.org/abs/2211.12559
The {\em perfect matching complex} of a graph is the simplicial complex on the edge set of the graph with facets corresponding to perfect matchings of the graph. This paper studies the perfect matching complexes, $\mathcal{M}_p(H_{k \times m\times n}
Externí odkaz:
http://arxiv.org/abs/2209.02803
Autor:
Niese, Elizabeth, Sundaram, Sheila, van Willigenburg, Stephanie, Vega, Julianne, Wang, Shiyun
Publikováno v:
Trans. Amer. Math. Soc. 377 (2024), no. 4, 2525-2582
We introduce a new basis of quasisymmetric functions, the row-strict dual immaculate functions. We construct a cyclic, indecomposable 0-Hecke algebra module for these functions. Our row-strict immaculate functions are related to the dual immaculate f
Externí odkaz:
http://arxiv.org/abs/2202.00708
Autor:
Niese, Elizabeth, Sundaram, Sheila, van Willigenburg, Stephanie, Vega, Julianne, Wang, Shiyun
Publikováno v:
Advances in Applied Mathematics 149 (2023) 102540
We define a new basis of quasisymmetric functions, the row-strict dual immaculate functions, as the generating function of a particular set of tableaux. We establish that this definition gives a function that can also be obtained by applying the $\ps
Externí odkaz:
http://arxiv.org/abs/2202.00706
Autor:
von Bell, Matias, Braun, Benjamin, Hanely, Derek, Serhiyenko, Khrystyna, Vega, Julianne, Vindas-Meléndez, Andrés R., Yip, Martha
This work regards the order polytopes arising from the class of generalized snake posets and their posets of meet-irreducible elements. Among generalized snake posets of the same rank, we characterize those whose order polytopes have minimal and maxi
Externí odkaz:
http://arxiv.org/abs/2102.11306
Autor:
Bayer, Margaret, Goeckner, Bennet, Hong, Su Ji, McAllister, Tyrrell, Olsen, McCabe, Pinckney, Casey, Vega, Julianne, Yip, Martha
Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a polytope has the integer decomposition property and determining when a polytope is reflexive. While these properties are of independent interest, the c
Externí odkaz:
http://arxiv.org/abs/2005.09628
Autor:
Niese, Elizabeth, Sundaram, Sheila, van Willigenburg, Stephanie, Vega, Julianne, Wang, Shiyun
Publikováno v:
In Advances in Applied Mathematics August 2023 149
Autor:
Vega, Julianne
A $2$-matching complex is a simplicial complex which captures the relationship between $2$-matchings of a graph. In this paper, we will use discrete Morse Theory and the Matching Tree Algorithm to prove homotopical results. We will consider a class o
Externí odkaz:
http://arxiv.org/abs/1909.10406
Autor:
Dorpalen-Barry, Galen, Hettle, Cyrus, Livingston, David C., Martin, Jeremy L., Nasr, George, Vega, Julianne, Whitlatch, Hays
Publikováno v:
J. Combin. Theory Ser. A 179 (2021) 105364
Veit Elser proposed a random graph model for percolation in which physical dimension appears as a parameter. Studying this model combinatorially leads naturally to the consideration of numerical graph invariants which we call \emph{Elser numbers} $\m
Externí odkaz:
http://arxiv.org/abs/1905.11330