Matjaž Konvalinka
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
Matjaž Konvalinka has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
Igor Pak
8 shared publications- Ilse Fischer
Universität Wien, Austria
4 shared publications - Vasu Tewari4 shared publications
- Sara Billey
Department of Mathematics, University of Washington, Seattle, Washington 98195
3 shared publications - T. Kyle Petersen
Department of Mathematical Sciences, DePaul University
3 shared publications - Aaron Lauve
Department of Mathematics and Statistics, Loyola University Chicago, Chicago, USA
2 shared publications
Latest Publications
- Open Access
The Eulerian numbers can D.I.E
The Eulerian numbers form a triangular array with many interesting properties. The numbers arise from various combinatorial and probabilistic interpretations, and have been studied in a variety of mathematical contexts. In this article we examine two distinct alternating sign formulas for the Eulerian numbers and show how they can be proved using a sign-reversing involution technique described by Benjamin and Quinn known as the ``D.I.E.'' method. Each of these arguments lends itself to a broad generalization, shedding light on different parts of mathematics.
Open AccessThe Eulerian numbers can D.I.E
The Eulerian numbers form a triangular array with many interesting properties. The numbers arise from various combinatorial and probabilistic interpretations, and have been studied in a variety of mathematical contexts. In this article we examine two distinct alternating sign formulas for the Eulerian numbers and show how they can be proved using a sign-reversing involution technique described by Benjamin and Quinn known as the ``D.I.E.'' method. Each of these arguments lends itself to a broad generalization, shedding light on different parts of mathematics.
- Open Access
- 2 September 2021
- Published by MathDoc/Centre Mersenne in Algebraic Combinatorics
- Vol. 4 (4) , 663-674
Trimming the permutahedron to extend the parking space
Berget and Rhoades asked whether the permutation representation obtained by the action of on parking functions of length can be extended to a permutation action of . We answer this question in the affirmative. We realize our module in two different ways. The first description involves binary Lyndon words and the second involves the action of the symmetric group on the lattice points of the trimmed standard permutahedron.- 2 September 2021
- Published by MathDoc/Centre Mersenne in Algebraic Combinatorics
- Vol. 4 (4) , 663-674
Open AccessTrimming the permutahedron to extend the parking space
Berget and Rhoades asked whether the permutation representation obtained by the action of on parking functions of length can be extended to a permutation action of . We answer this question in the affirmative. We realize our module in two different ways. The first description involves binary Lyndon words and the second involves the action of the symmetric group on the lattice points of the trimmed standard permutahedron. - 2 September 2020
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 117 (38) , 23460-23466
The mysterious story of square ice, piles of cubes, and bijections
Significance: In the early 1980s, it was discovered that alternating sign matrices (ASMs), which are also commonly encountered in statistical mechanics, are counted by the same numbers as two classes of plane partitions. Since then it has been a major open problem in this area to construct explicit bijections between the three classes of objects. In this paper we describe a bijective proof that relates ASMs to one of the two classes of plane partitions as well as a bijective proof of the fact that the numbers can be expressed by a simple product formula. The constructions are complicated, but they are completely explicit and also provided in the form of computer code.
- 2 September 2020
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 117 (38) , 23460-23466
The mysterious story of square ice, piles of cubes, and bijections
Significance: In the early 1980s, it was discovered that alternating sign matrices (ASMs), which are also commonly encountered in statistical mechanics, are counted by the same numbers as two classes of plane partitions. Since then it has been a major open problem in this area to construct explicit bijections between the three classes of objects. In this paper we describe a bijective proof that relates ASMs to one of the two classes of plane partitions as well as a bijective proof of the fact that the numbers can be expressed by a simple product formula. The constructions are complicated, but they are completely explicit and also provided in the form of computer code.
- Open Access
Tableau posets and the fake degrees of coinvariant algebras
We introduce two new partial orders on the standard Young tableaux of a given partition shape, in analogy with the strong and weak Bruhat orders on permutations. Both posets are ranked by the major index statistic offset by a fixed shift. The existence of such ranked poset structures allows us to classify the realizable major index statistics on standard tableaux of arbitrary straight shape and certain skew shapes. By a theorem of Lusztig--Stanley, this classification can be interpreted as determining which irreducible representations of the symmetric group exist in which homogeneous components of the corresponding coinvariant algebra, strengthening a recent result of the third author for the modular major index. Our approach is to identify patterns in standard tableaux that allow one to mutate descent sets in a controlled manner. By work of Lusztig and Stembridge, the arguments extend to a classification of all nonzero fake degrees of coinvariant algebras for finite complex reflection groups in the infinite family of Shephard--Todd groups.
Open AccessTableau posets and the fake degrees of coinvariant algebras
We introduce two new partial orders on the standard Young tableaux of a given partition shape, in analogy with the strong and weak Bruhat orders on permutations. Both posets are ranked by the major index statistic offset by a fixed shift. The existence of such ranked poset structures allows us to classify the realizable major index statistics on standard tableaux of arbitrary straight shape and certain skew shapes. By a theorem of Lusztig--Stanley, this classification can be interpreted as determining which irreducible representations of the symmetric group exist in which homogeneous components of the corresponding coinvariant algebra, strengthening a recent result of the third author for the modular major index. Our approach is to identify patterns in standard tableaux that allow one to mutate descent sets in a controlled manner. By work of Lusztig and Stembridge, the arguments extend to a classification of all nonzero fake degrees of coinvariant algebras for finite complex reflection groups in the infinite family of Shephard--Todd groups.
- Open Access
Trimming the permutahedron to extend the parking space
Berget and Rhoades asked whether the permutation representation obtained by the action of $S_{n-1}$ on parking functions of length $n-1$ can be extended to a permutation action of $S_{n}$. We answer this question in the affirmative. We realize our module in two different ways. The first description involves binary Lyndon words and the second involves the action of the symmetric group on the lattice points of the trimmed standard permutahedron.Open AccessTrimming the permutahedron to extend the parking space
Berget and Rhoades asked whether the permutation representation obtained by the action of $S_{n-1}$ on parking functions of length $n-1$ can be extended to a permutation action of $S_{n}$. We answer this question in the affirmative. We realize our module in two different ways. The first description involves binary Lyndon words and the second involves the action of the symmetric group on the lattice points of the trimmed standard permutahedron. - 22 April 2020
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Discrete Mathematics & Theoretical Computer Science
- Vol. DMTCS Proc
Diagonally and antidiagonally symmetric alternating sign matrices of odd order
We study the enumeration of diagonally and antidiagonally symmetric alternating sign matrices (DAS- ASMs) of fixed odd order by introducing a case of the six-vertex model whose configurations are in bijection with such matrices. The model involves a grid graph on a triangle, with bulk and boundary weights which satisfy the Yang– Baxter and reflection equations. We obtain a general expression for the partition function of this model as a sum of two determinantal terms, and show that at a certain point each of these terms reduces to a Schur function. We are then able to prove a conjecture of Robbins from the mid 1980's that the total number of (2n + 1) × (2n + 1) DASASMs is∏n (3i)! ,andaconjectureofStroganovfrom2008thattheratiobetweenthenumbersof(2n+1)×(2n+1) i=0 (n+i)! DASASMs with central entry −1 and 1 is n/(n + 1). Among the several product formulae for the enumeration of symmetric alternating sign matrices which were conjectured in the 1980's, that for odd-order DASASMs is the last to have been proved.
- 22 April 2020
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Discrete Mathematics & Theoretical Computer Science
- Vol. DMTCS Proc
Diagonally and antidiagonally symmetric alternating sign matrices of odd order
We study the enumeration of diagonally and antidiagonally symmetric alternating sign matrices (DAS- ASMs) of fixed odd order by introducing a case of the six-vertex model whose configurations are in bijection with such matrices. The model involves a grid graph on a triangle, with bulk and boundary weights which satisfy the Yang– Baxter and reflection equations. We obtain a general expression for the partition function of this model as a sum of two determinantal terms, and show that at a certain point each of these terms reduces to a Schur function. We are then able to prove a conjecture of Robbins from the mid 1980's that the total number of (2n + 1) × (2n + 1) DASASMs is∏n (3i)! ,andaconjectureofStroganovfrom2008thattheratiobetweenthenumbersof(2n+1)×(2n+1) i=0 (n+i)! DASASMs with central entry −1 and 1 is n/(n + 1). Among the several product formulae for the enumeration of symmetric alternating sign matrices which were conjectured in the 1980's, that for odd-order DASASMs is the last to have been proved.
- 22 April 2020
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Discrete Mathematics & Theoretical Computer Science
- Vol. DMTCS Proc
Parabolic double cosets in Coxeter groups
Parabolic subgroups WI of Coxeter systems (W,S) and their ordinary and double cosets W/WI and WI\W/WJ appear in many contexts in combinatorics and Lie theory, including the geometry and topology of generalized flag varieties and the symmetry groups of regular polytopes. The set of ordinary cosets wWI , for I ⊆ S, forms the Coxeter complex of W , and is well-studied. In this extended abstract, we look at a less studied object: the set of all double cosets WIwWJ for I,J ⊆ S. Each double coset can be presented by many different triples (I, w, J). We describe what we call the lex-minimal presentation and prove that there exists a unique such choice for each double coset. Lex-minimal presentations can be enumerated via a finite automaton depending on the Coxeter graph for (W, S). In particular, we present a formula for the number of parabolic double cosets with a fixed minimal element when W is the symmetric group Sn. In that case, parabolic subgroups are also known as Young subgroups. Our formula is almost always linear time computable in n, and the formula can be generalized to any Coxeter group.
- 22 April 2020
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Discrete Mathematics & Theoretical Computer Science
- Vol. DMTCS Proc
Parabolic double cosets in Coxeter groups
Parabolic subgroups WI of Coxeter systems (W,S) and their ordinary and double cosets W/WI and WI\W/WJ appear in many contexts in combinatorics and Lie theory, including the geometry and topology of generalized flag varieties and the symmetry groups of regular polytopes. The set of ordinary cosets wWI , for I ⊆ S, forms the Coxeter complex of W , and is well-studied. In this extended abstract, we look at a less studied object: the set of all double cosets WIwWJ for I,J ⊆ S. Each double coset can be presented by many different triples (I, w, J). We describe what we call the lex-minimal presentation and prove that there exists a unique such choice for each double coset. Lex-minimal presentations can be enumerated via a finite automaton depending on the Coxeter graph for (W, S). In particular, we present a formula for the number of parabolic double cosets with a fixed minimal element when W is the symmetric group Sn. In that case, parabolic subgroups are also known as Young subgroups. Our formula is almost always linear time computable in n, and the formula can be generalized to any Coxeter group.
- Open Access
Some natural extensions of the parking space
We construct a family of $S_n$ modules indexed by $c\in\{1,\dots,n\}$ with the property that upon restriction to $S_{n-1}$ they recover the classical parking function representation of Haiman. The construction of these modules relies on an $S_n$-action on a set that is closely related to the set of parking functions. We compute the characters of these modules and use the resulting description to classify them up to isomorphism. In particular, we show that the number of isomorphism classes is equal to the number of divisors $d$ of $n$ satisfying $ d\neq 2 \: (\!\!\!\!\mod 4)$. In the cases $c=n$ and $c=1$, we compute the number of orbits. Based on empirical evidence, we conjecture that when $c=1$, our representation is $h$-positive and is in fact the (ungraded) extension of the parking function representation constructed by Berget and Rhoades.Open AccessSome natural extensions of the parking space
We construct a family of $S_n$ modules indexed by $c\in\{1,\dots,n\}$ with the property that upon restriction to $S_{n-1}$ they recover the classical parking function representation of Haiman. The construction of these modules relies on an $S_n$-action on a set that is closely related to the set of parking functions. We compute the characters of these modules and use the resulting description to classify them up to isomorphism. In particular, we show that the number of isomorphism classes is equal to the number of divisors $d$ of $n$ satisfying $ d\neq 2 \: (\!\!\!\!\mod 4)$. In the cases $c=n$ and $c=1$, we compute the number of orbits. Based on empirical evidence, we conjecture that when $c=1$, our representation is $h$-positive and is in fact the (ungraded) extension of the parking function representation constructed by Berget and Rhoades. - 13 November 2019
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 17 (2) , 481-491
Strong geodetic problem on complete multipartite graphs
Strong geodetic problem on complete multipartite graphs
- 13 November 2019
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 17 (2) , 481-491
Strong geodetic problem on complete multipartite graphs
Strong geodetic problem on complete multipartite graphs
- Open Access
- 4 July 2019
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 26 (3) , P3.22
Smirnov Trees
We introduce a generalization of Smirnov words in the context of labeled binary trees, which we call Smirnov trees. We study the generating function for ascent-descent statistics on Smirnov trees and establish that it is $e$-positive, which is akin to the classical case of Smirnov words. Our proof relies on an intricate weight-preserving bijection.
- 4 July 2019
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 26 (3) , P3.22
Open AccessSmirnov Trees
We introduce a generalization of Smirnov words in the context of labeled binary trees, which we call Smirnov trees. We study the generating function for ascent-descent statistics on Smirnov trees and establish that it is $e$-positive, which is akin to the classical case of Smirnov words. Our proof relies on an intricate weight-preserving bijection.