Alejandro H. Morales
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Alejandro H. Morales has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Joel Brewster Lewis
University of Minnesota
3 shared publications - Aaron J. Klein
Brookline High School, Brookline, USA
2 shared publications - Ekaterina A. Vassilieva
Ecole Polytechnique, Palaiseau, France
2 shared publications - Mathieu Guay-Paquet
Université du Québec à Montréal 201 Av du Président-Kennedy H2X 3Y7 Montréal QC Canada
2 shared publications Eric Rowland
1 shared publication- Eric Rowland
Hofstra University
1 shared publication
Latest Publications
- 22 November 2014
- Published by Springer Nature in Annals of Combinatorics
- Vol. 18 (4) , 645-674
Structure and Enumeration of (3+1)-Free Posets
- 22 November 2014
- Published by Springer Nature in Annals of Combinatorics
- Vol. 18 (4) , 645-674
Structure and Enumeration of (3+1)-Free Posets
- Open Access
Structure and enumeration of (3+1)-free posets
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 play a central role in the (3+1)-free conjecture of Stanley and Stembridge. Lewis and Zhang have enumerated (3+1)-free posets in the graded case by decomposing them into bipartite graphs, but until now the general enumeration problem has remained open. We give a finer decomposition into bipartite graphs which applies to all (3+1)-free posets and obtain generating functions which count (3+1)-free posets with labelled or unlabelled vertices. Using this decomposition, we obtain a decomposition of the automorphism group and asymptotics for the number of (3+1)-free posets.
Open AccessStructure and enumeration of (3+1)-free posets
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 play a central role in the (3+1)-free conjecture of Stanley and Stembridge. Lewis and Zhang have enumerated (3+1)-free posets in the graded case by decomposing them into bipartite graphs, but until now the general enumeration problem has remained open. We give a finer decomposition into bipartite graphs which applies to all (3+1)-free posets and obtain generating functions which count (3+1)-free posets with labelled or unlabelled vertices. Using this decomposition, we obtain a decomposition of the automorphism group and asymptotics for the number of (3+1)-free posets.
- 31 May 2013
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 39 (2) , 429-456
Counting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams
- 31 May 2013
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 39 (2) , 429-456
Counting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams
- Open Access
- 9 April 2013
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 20 (2) , P6
Direct Bijective Computation of the Generating Series for 2 and 3-Connection Coefficients of the Symmetric Group
We evaluate combinatorially certain connection coefficients of the symmetric group that count the number of factorizations of a long cycle as a product of three permutations. Such factorizations admit an important topological interpretation in terms of unicellular constellations on orientable surfaces. Algebraic computation of these coefficients was first done by Jackson using irreducible characters of the symmetric group. However, bijective computations of these coefficients are so far limited to very special cases. Thanks to a new bijection that refines the work of Schaeffer and Vassilieva, we give an explicit closed form evaluation of the generating series for these coefficients. The main ingredient in the bijection is a modified oriented tricolored tree tractable to enumerate. Finally, reducing this bijection to factorizations of a long cycle into two permutations, we get the analogue formula for the corresponding generating series.
- 9 April 2013
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 20 (2) , P6
Open AccessDirect Bijective Computation of the Generating Series for 2 and 3-Connection Coefficients of the Symmetric Group
We evaluate combinatorially certain connection coefficients of the symmetric group that count the number of factorizations of a long cycle as a product of three permutations. Such factorizations admit an important topological interpretation in terms of unicellular constellations on orientable surfaces. Algebraic computation of these coefficients was first done by Jackson using irreducible characters of the symmetric group. However, bijective computations of these coefficients are so far limited to very special cases. Thanks to a new bijection that refines the work of Schaeffer and Vassilieva, we give an explicit closed form evaluation of the generating series for these coefficients. The main ingredient in the bijection is a modified oriented tricolored tree tractable to enumerate. Finally, reducing this bijection to factorizations of a long cycle into two permutations, we get the analogue formula for the corresponding generating series.
- Open Access
Direct bijective computation of the generating series for 2 and 3-connection coefficients of the symmetric group
We evaluate combinatorially certain connection coefficients of the symmetric group that count the number of factorizations of a long cycle as a product of three permutations. Such factorizations admit an important topological interpretation in terms of unicellular constellations on orientable surfaces. Algebraic computation of these coefficients was first done by Jackson using irreducible characters of the symmetric group. However, bijective computations of these coefficients are so far limited to very special cases. Thanks to a new bijection that refines the work of Schaeffer and Vassilieva, and Vassilieva, we give an explicit closed form evaluation of the generating series for these coefficients. The main ingredient in the bijection is a modified oriented tricolored tree tractable to enumerate. Finally, reducing this bijection to factorizations of a long cycle into two permutations, we get the analogue formula for the corresponding generating series.
Open AccessDirect bijective computation of the generating series for 2 and 3-connection coefficients of the symmetric group
We evaluate combinatorially certain connection coefficients of the symmetric group that count the number of factorizations of a long cycle as a product of three permutations. Such factorizations admit an important topological interpretation in terms of unicellular constellations on orientable surfaces. Algebraic computation of these coefficients was first done by Jackson using irreducible characters of the symmetric group. However, bijective computations of these coefficients are so far limited to very special cases. Thanks to a new bijection that refines the work of Schaeffer and Vassilieva, and Vassilieva, we give an explicit closed form evaluation of the generating series for these coefficients. The main ingredient in the bijection is a modified oriented tricolored tree tractable to enumerate. Finally, reducing this bijection to factorizations of a long cycle into two permutations, we get the analogue formula for the corresponding generating series.
- Open Access
Counting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams
We consider the problem of finding the number of matrices over a finite field with a certain rank and with support that avoids a subset of the entries. These matrices are a q-analogue of permutations with restricted positions (i.e., rook placements). For general sets of entries these numbers of matrices are not polynomials in q (Stembridge 98); however, when the set of entries is a Young diagram, the numbers, up to a power of q-1, are polynomials with nonnegative coefficients (Haglund 98). In this paper, we give a number of conditions under which these numbers are polynomials in q, or even polynomials with nonnegative integer coefficients. We extend Haglund's result to complements of skew Young diagrams, and we apply this result to the case when the set of entries is the Rothe diagram of a permutation. In particular, we give a necessary and sufficient condition on the permutation for its Rothe diagram to be the complement of a skew Young diagram up to rearrangement of rows and columns. We end by giving conjectures connecting invertible matrices whose support avoids a Rothe diagram and Poincar\'e polynomials of the strong Bruhat order.
Open AccessCounting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams
We consider the problem of finding the number of matrices over a finite field with a certain rank and with support that avoids a subset of the entries. These matrices are a q-analogue of permutations with restricted positions (i.e., rook placements). For general sets of entries these numbers of matrices are not polynomials in q (Stembridge 98); however, when the set of entries is a Young diagram, the numbers, up to a power of q-1, are polynomials with nonnegative coefficients (Haglund 98). In this paper, we give a number of conditions under which these numbers are polynomials in q, or even polynomials with nonnegative integer coefficients. We extend Haglund's result to complements of skew Young diagrams, and we apply this result to the case when the set of entries is the Rothe diagram of a permutation. In particular, we give a necessary and sufficient condition on the permutation for its Rothe diagram to be the complement of a skew Young diagram up to rearrangement of rows and columns. We end by giving conjectures connecting invertible matrices whose support avoids a Rothe diagram and Poincar\'e polynomials of the strong Bruhat order.
- 1 January 2011
- Published by International Press of Boston in Journal of Combinatorics
- Vol. 2 (3) , 355-395
Matrices with restricted entries and $q$-analogues of permutations
- 1 January 2011
- Published by International Press of Boston in Journal of Combinatorics
- Vol. 2 (3) , 355-395
Matrices with restricted entries and $q$-analogues of permutations