Searcharxiv⌕ Search

arXiv subjects

Matjaz Konvalinka

Publications and source records attributed to Matjaz Konvalinka.

15 recordsLinked to original sources
arXiv2019

A bijective proof of the ASM theorem, Part I: the operator formula

Alternating sign matrices are known to be equinumerous with descending plane partitions, totally symmetric self-complementary plane partitions and alternating sign triangles, but no bijective proof for any of these equivalences has been found so far. In this paper we provide the first bijective proof of the operator formula for monotone triangles, which has been the main tool for several non-combinatorial proofs of such equivalences. In this proof, signed sets and sijections (signed bijections) play a fundamental role.

math.CO↗
arXiv2018

Hook, line and sinker: a bijective proof of the skew shifted hook-length formula

A few years ago, Naruse presented a beautiful cancellation-free hook-length formula for skew shapes, both straight and shifted. The formula involves a sum over objects called \emph{excited diagrams}, and the term corresponding to each excited diagram has hook lengths in the denominator, like the classical hook-length formula due to Frame, Robinson and Thrall. Recently, the formula for skew straight shapes was proved via a simple bumping algorithm. The aim of this paper is to extend this result to skew shifted shapes. Since straight skew shapes are special cases of skew shifted shapes, this is a bijection that proves the whole family of hook-length formulas, and is also the simplest known bijective proof for shifted (non-skew) shapes. A weighted generalization of Naruse's formula is also presented.

math.CO↗
arXiv2018

A bijective proof of the hook-length formula for skew shapes

Recently, Naruse presented a beautiful cancellation-free hook-length formula for skew shapes. The formula involves a sum over objects called excited diagrams, and the term corresponding to each excited diagram has hook lengths in the denominator, like the classical hook-length formula due to Frame, Robinson and Thrall. In this paper, we present a simple bijection that proves an equivalent recursive version of Naruse's result, in the same way that the celebrated hook-walk proof due to Green, Nijenhuis and Wilf gives a bijective (or probabilistic) proof of the hook-length formula for ordinary shapes. In particular, we also give a new bijective proof of the classical hook-length formula, quite different from the known proofs.

math.CO↗
arXiv2014

The role of residue and quotient tables in the theory of k-Schur functions

Recently, residue and quotient tables were defined by Fishel and the author, and were used to describe strong covers in the lattice of $k$-bounded partitions. In this paper, we show or conjecture that residue and quotient tables can be used to describe many other results in the theory of $k$-bounded partitions and $k$-Schur functions, including $k$-conjugates, weak horizontal and vertical strips, and the Murnaghan-Nakayama rule. Evidence is presented for the claim that one of the most important open questions in the theory of $k$-Schur functions, a general rule that would describe their product, can be also concisely stated in terms of residue tables.

math.CO↗
arXiv2012

Skew Pieri Rules for Hall-Littlewood Functions

We produce skew Pieri Rules for Hall--Littlewood functions in the spirit of Assaf and McNamara. The first two were conjectured by the first author. The key ingredients in the proofs are a q-binomial identity for skew partitions and a Hopf algebraic identity that expands products of skew elements in terms of the coproduct and the antipode.

math.CO↗
arXiv2011

Triangulations of Cayley and Tutte polytopes

Cayley polytopes were defined recently as convex hulls of Cayley compositions introduced by Cayley in 1857. In this paper we resolve Braun's conjecture, which expresses the volume of Cayley polytopes in terms of the number of connected graphs. We extend this result to two one-variable deformations of Cayley polytopes (which we call t-Cayley and t-Gayley polytopes), and to the most general two-variable deformations, which we call Tutte polytopes. The volume of the latter is given via an evaluation of the Tutte polynomial of the complete graph. Our approach is based on an explicit triangulation of the Cayley and Tutte polytope. We prove that simplices in the triangulations correspond to labeled trees. The heart of the proof is a direct bijection based on the neighbors-first search graph traversal algorithm.

math.CO↗
arXiv2011

Skew quantum Murnaghan-Nakayama rule

In this paper, we extend recent results of Assaf and McNamara on skew Pieri rule and skew Murnaghan-Nakayama rule to a more general identity, which gives an elegant expansion of the product of a skew Schur function with a quantum power sum function in terms of skew Schur functions. We give two proofs, one completely bijective in the spirit of Assaf-McNamara's original proof, and one via Lam-Lauve-Sotille's skew Littlewood-Richardson rule. We end with some conjectures for skew rules for Hall-Littlewood polynomials.

math.CO↗
arXiv2010

The weighted hook length formula III: Shifted tableaux

Recently, a simple proof of the hook length formula was given via the branching rule. In this paper, we extend the results to shifted tableaux. We give a bijective proof of the branching rule for the hook lengths for shifted tableaux; present variants of this rule, including weighted versions; and make the first tentative steps toward a bijective proof of the hook length formula for d-complete posets.

math.CO↗
arXiv2010

The weighted hook-length formula II: Complementary formulas

Recently, a new weighted generalization of the branching rule for the hook lengths, equivalent to the hook formula, was proved. In this paper, we generalize the complementary branching rule, which can be used to prove Burnside's formula. We present three different proofs: bijective, via weighted hook walks, and via the ordinary weighted branching rule.

math.CO↗
arXiv2010

The weighted hook length formula

Based on the ideas in [CKP], we introduce the weighted analogue of the branching rule for the classical hook length formula, and give two proofs of this result. The first proof is completely bijective, and in a special case gives a new short combinatorial proof of the hook length formula. Our second proof is probabilistic, generalizing the (usual) hook walk proof of Green-Nijenhuis-Wilf, as well as the q-walk of Kerov. Further applications are also presented.

math.CO↗
arXiv2008

On combinatorial formulas for the characters of Hecke algebras

Hecke algebras are beautiful q-extensions of Coxeter groups. In this paper, we prove several results on their characters, with an emphasis on characters induced from trivial and sign representations of parabolic subalgebras. While most of the results in type A are known, our proofs are of a combinatorial nature, and generalize to (partial) results in types B and C. We also present complete descriptions of such characters for type I.

math.CO↗
arXiv2007

Geometry and complexity of O'Hara's algorithm

In this paper we analyze O'Hara's partition bijection. We present three type of results. First, we show that O'Hara's bijection can be viewed geometrically as a certain scissor congruence type result. Second, we obtain a number of new complexity bounds, proving that O'Hara's bijection is efficient in several special cases and mildly exponential in general. Finally, we prove that for identities with finite support, the map of the O'Hara's bijection can be computed in polynomial time, i.e. much more efficiently than by O'Hara's construction.

math.CO↗
arXiv2007

Non-commutative Sylvester's determinantal identity

Sylvester's identity is a classical determinantal identity with a straightforward linear algebra proof. We present a new, combinatorial proof of the identity, prove several non-commutative versions, and find a $β$-extension that is both a generalization of Sylvester's identity and the $β$-extension of the MacMahon master theorem.

math.CO↗
arXiv2006

Non-commutative extensions of the MacMahon Master Theorem

We present several non-commutative extensions of the MacMahon Master Theorem, further extending the results of Cartier-Foata and Garoufalidis-Le-Zeilberger. The proofs are combinatorial and new even in the classical cases. We also give applications to the $β$-extension and Krattenthaler-Schlosser's $q$-analogue.

math.CO↗