Kurt Luoto
University of British Columbia
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Kurt Luoto.
Journal of Combinatorial Theory | 2011
James Haglund; Kurt Luoto; Sarah Mason; S. van Willigenburg
We introduce a new basis for quasisymmetric functions, which arise from a specialization of nonsymmetric Macdonald polynomials to standard bases, also known as Demazure atoms. Our new basis is called the basis of quasisymmetric Schur functions, since the basis elements refine Schur functions in a natural way. We derive expansions for quasisymmetric Schur functions in terms of monomial and fundamental quasisymmetric functions, which give rise to quasisymmetric refinements of Kostka numbers and standard (reverse) tableaux. From here we derive a Pieri rule for quasisymmetric Schur functions that naturally refines the Pieri rule for Schur functions. After surveying combinatorial formulas for Macdonald polynomials, including an expansion of Macdonald polynomials into fundamental quasisymmetric functions, we show how some of our results can be extended to include the t parameter from Hall-Littlewood theory.
Advances in Mathematics | 2011
Christine Bessenrodt; Kurt Luoto; S. van Willigenburg
Abstract Recently a new basis for the Hopf algebra of quasisymmetric functions QSym, called quasisymmetric Schur functions, has been introduced by Haglund, Luoto, Mason, van Willigenburg. In this paper we extend the definition of quasisymmetric Schur functions to introduce skew quasisymmetric Schur functions. These functions include both classical skew Schur functions and quasisymmetric Schur functions as examples, and give rise to a new poset L C that is analogous to Youngs lattice. We also introduce a new basis for the Hopf algebra of noncommutative symmetric functions NSym. This basis of NSym is dual to the basis of quasisymmetric Schur functions and its elements are the pre-image of the Schur functions under the forgetful map χ : NSym → Sym . We prove that the multiplicative structure constants of the noncommutative Schur functions, equivalently the coefficients of the skew quasisymmetric Schur functions when expanded in the quasisymmetric Schur basis, are nonnegative integers, satisfying a Littlewood–Richardson rule analogue that reduces to the classical Littlewood–Richardson rule under χ. As an application we show that the morphism of algebras from the algebra of Poirier–Reutenauer to Sym factors through NSym. We also extend the definition of Schur functions in noncommuting variables of Rosas–Sagan in the algebra NCSym to define quasisymmetric Schur functions in the algebra NCQSym. We prove these latter functions refine the former and their properties, and project onto quasisymmetric Schur functions under the forgetful map. Lastly, we show that by suitably labeling L C , skew quasisymmetric Schur functions arise in the theory of Pieri operators on posets.
Journal of Combinatorial Theory | 2008
Kurt Luoto
A new Z-basis for the space of quasisymmetric functions (QSym, for short) is presented. It is shown to have nonnegative structure constants, and several interesting properties relative to the quasisymmetric functions associated to matroids by the Hopf algebra morphism F of Billera, Jia, and Reiner [L.J. Billera, N. Jia, V. Reiner, A quasisymmetric function for matroids, arXiv:math.CO/0606646]. In particular, for loopless matroids, this basis reflects the grading by matroid rank, as well as by the size of the ground set. It is shown that the morphism F distinguishes isomorphism classes of rank two matroids, and that decomposability of the quasisymmetric function of a rank two matroid mirrors the decomposability of its base polytope. An affirmative answer to the Hilbert basis question raised in [L.J. Billera, N. Jia, V. Reiner, A quasisymmetric function for matroids, arXiv:math.CO/0606646] is given.
Pacific Journal of Mathematics | 2015
Marcin Bownik; Kurt Luoto; Edward Richmond
In this paper we give a combinatorial characterization of tight fusion frame (TFF) sequences using Littlewood-Richardson skew tableaux. The equal rank case has been solved recently by Casazza et al. (8). Our characterization does not have this limitation. We also develop some methods for generating TFF sequences. The basic technique is a majorization principle for TFF sequences combined with spatial and Naimark dualities. We use these methods and our characterization to give necessary and sucient conditions which are satised by the rst three highest ranks. We also give a combinatorial interpretation of spatial and Naimark dualities in terms of Littlewood-Richardson coecients. We exhibit four classes of TFF sequences which have unique maximal elements with respect to majorization partial order. Finally, we give several examples illustrating our techniques including an example of tight fusion frame which can not be constructed by the existing spectral tetris techniques (5, 7, 8). We end the paper by giving a complete list of maximal TFF sequences in dimensions 9.
Archive | 2013
Kurt Luoto; Stefan Mykytiuk; Stephanie van Willigenburg
In this chapter we begin by defining partially ordered sets, linear extensions, the dual of a poset, and the disjoint union of two posets. We then define further combinatorial objects we will need including compositions, partitions, diagrams and Young tableaux, reverse tableaux, Young’s lattice and Schensted insertion.
Archive | 2013
Kurt Luoto; Stefan Mykytiuk; Stephanie van Willigenburg
In order to state results in the next chapter, we extend many definitions from Chapter 2 to define composition diagrams, Young composition tableaux that correspond to Young tableaux, and the Young composition poset. We additionally define reverse composition diagrams, reverse composition tableaux that correspond to reverse tableaux, and the reverse composition poset. Finally, useful bijections between Young tableaux, Young composition tableaux, reverse tableaux and reverse composition tableaux are described.
Archive | 2013
Kurt Luoto; Stefan Mykytiuk; Stephanie van Willigenburg
Archive | 2013
Kurt Luoto; Stefan Mykytiuk; Stephanie van Willigenburg
Discrete Mathematics & Theoretical Computer Science | 2009
James Haglund; Kurt Luoto; Sarah Mason; S. van Willigenburg