Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Alejandro H. Morales"'
Publikováno v:
Enumerative Combinatorics and Applications, Vol 2, Iss 3, p Article #S2R20 (2022)
Externí odkaz:
https://doaj.org/article/29f4f27a6b4c415788754a61fd01b9ed
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings, 28th... (2020)
We consider GLn (Fq)-analogues of certain factorization problems in the symmetric group Sn: ratherthan counting factorizations of the long cycle(1,2, . . . , n) given the number of cycles of each factor, we countfactorizations of a regular elliptic e
Externí odkaz:
https://doaj.org/article/57f563834e544bc2a979c0a0f359813d
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings, 28th... (2020)
The celebrated hook-length formula gives a product formula for the number of standard Young tableaux of a straight shape. In 2014, Naruse announced a more general formula for the number of standard Young tableaux of skew shapes as a positive sum over
Externí odkaz:
https://doaj.org/article/f3bbe52d07974a949637e48c9b615497
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings, 27th..., Iss Proceedings (2015)
26 pages, 4 figures. v2 has typos fixed, updated references, and a final remarks section including remarks from previous sections
Externí odkaz:
https://doaj.org/article/d7c4ed022c644406b832225957142f4d
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AS,..., Iss Proceedings (2013)
A poset is $(3+1)$-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets are the subject of the $(3+1)$-free conjecture of Stanley and Stembridge. Recently, Lewis and Zhang have enumerated $\t
Externí odkaz:
https://doaj.org/article/4fefd268d87a46adb951b8d9c4c960cb
Autor:
Karola Mészáros, Alejandro H. Morales
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AR,..., Iss Proceedings (2012)
We establish the relationship between volumes of flow polytopes associated to signed graphs and the Kostant partition function. A special case of this relationship, namely, when the graphs are signless, has been studied in detail by Baldoni and Vergn
Externí odkaz:
https://doaj.org/article/90a3b96e126d422e934b45ad67c8e6ca
Autor:
Joel Brewster Lewis, Ricky Ini Liu, Alejandro H. Morales, Greta Panova, Steven V Sam, Yan Zhang
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AO,..., Iss Proceedings (2011)
We study the functions that count matrices of given rank over a finite field with specified positions equal to zero. We show that these matrices are $q$-analogues of permutations with certain restricted values. We obtain a simple closed formula for t
Externí odkaz:
https://doaj.org/article/9df26cfd3f14462182ae62cf58a62cb8
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AO,..., Iss Proceedings (2011)
This paper is devoted to the evaluation of the generating series of the connection coefficients of the double cosets of the hyperoctahedral group. Hanlon, Stanley, Stembridge (1992) showed that this series, indexed by a partition $ν$, gives the spec
Externí odkaz:
https://doaj.org/article/db4cc29b8e9b42ffad61059afb719d26
Autor:
Alejandro H. Morales, William Shi
Publikováno v:
Comptes Rendus. Mathématique. 359:823-851
Flow polytopes are an important class of polytopes in combinatorics whose lattice points and volumes have interesting properties and relations. The Chan-Robbins-Yuen (CRY) polytope is a flow polytope with normalized volume equal to the product of con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::139703d7d2baad0a1d23aa38c5348e9b
https://doi.org/10.5802/crmath.218
https://doi.org/10.5802/crmath.218
Publikováno v:
SIAM Journal on Discrete Mathematics
We introduce a class of posets, which includes both ribbon posets (skew shapes) and $d$-complete posets, such that their number of linear extensions is given by a determinant of a matrix whose entries are products of hook lengths. We also give $q$-an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa2ef2cd56377569f96ebc34d36dd41f
https://doi.org/10.1137/20m1320730
https://doi.org/10.1137/20m1320730