Download An Introduction to Quasisymmetric Schur Functions: Hopf by Kurt Luoto, Stefan Mykytiuk, Stephanie van Willigenburg PDF

By Kurt Luoto, Stefan Mykytiuk, Stephanie van Willigenburg

An creation to Quasisymmetric Schur Functions is aimed toward researchers and graduate scholars in algebraic combinatorics. The target of this monograph is twofold. the 1st target is to supply a reference textual content for the fundamental concept of Hopf algebras, specifically the Hopf algebras of symmetric, quasisymmetric and noncommutative symmetric capabilities and connections among them. the second one objective is to provide a survey of effects with admire to a thrilling new foundation of the Hopf algebra of quasisymmetric capabilities, whose combinatorics is similar to that of the popular Schur functions.

Show description

Read or Download An Introduction to Quasisymmetric Schur Functions: Hopf Algebras, Quasisymmetric Functions, and Young Composition Tableaux PDF

Similar combinatorics books

Combinatorics: The Rota Way (Cambridge Mathematical Library)

Written by means of of Gian-Carlo Rota's former scholars, this publication relies on notes from his classes and on own discussions with him. issues comprise units and valuations, partly ordered units, distributive lattices, walls and entropy, matching conception, loose matrices, doubly stochastic matrices, Moebius features, chains and antichains, Sperner conception, commuting equivalence relatives and linear lattices, modular and geometric lattices, valuation earrings, producing services, umbral calculus, symmetric services, Baxter algebras, unimodality of sequences, and site of zeros of polynomials.

Combinatorial games : tic-tac-toe theory

''Traditional online game idea has been profitable at constructing method in video games of incomplete details: whilst one participant is aware whatever that the opposite doesn't. however it has little to assert approximately video games of whole details, for instance, tic-tac-toe, solitaire, and hex. this can be the topic of combinatorial video game conception.

Combinatorial geometry and its algorithmic applications

In accordance with a lecture sequence given by means of the authors at a satellite tv for pc assembly of the 2006 overseas Congress of Mathematicians and on many articles written by means of them and their collaborators, this quantity offers a finished up to date survey of numerous middle components of combinatorial geometry. It describes the beginnings of the topic, going again to the 19th century (if to not Euclid), and explains why counting incidences and estimating the combinatorial complexity of assorted preparations of geometric items grew to become the theoretical spine of computational geometry within the Nineteen Eighties and Nineteen Nineties.

Extra info for An Introduction to Quasisymmetric Schur Functions: Hopf Algebras, Quasisymmetric Functions, and Young Composition Tableaux

Example text

K ) and a k-tuple I = (i1 , . . , ik ) of positive integers i1 < · · · < ik , let xαI α denote the monomial xαi11 · · · xikk . A quasisymmetric function is a formal power series f ∈ Q[[x1 , x2 , . ]] such that 1. f has finite degree, 2. f is invariant under the action of S∞ on Q[[x1 , x2 , . I is defined to be the k-tuple obtained by arranging the numbers σ (i1 ), . . , σ (ik ) in increasing order. That is, σ . f = f where the action of σ is extended by linearity. 3. If f = x21 x2 + x21 x3 + x22 x3 and σ ∈ S2 , then σ .

K ) n. Furthermore we say a formal power series has finite degree if each monomial has degree at most m for some nonnegative integer m, and is homogeneous of degree n if each monomial has degree n. 1. A symmetric function is a formal power series f ∈ Q[[x1 , x2 , . ]] such that 1. The degree of f is finite. α 2. For every composition (α1 , . . , αk ), all monomials xαi11 · · · xikk in f with distinct indices i1 , . . , ik have the same coefficient. Let n be a nonnegative integer, then recall that a permutation of [n] is a bijection σ : [n] → [n], which we may write as an n-tuple σ (1) · · · σ (n).

Equivalently we can think of a symmetric function as follows. 2. A symmetric function is a formal power series f ∈ Q[[x1 , x2 , . ]] such that 1. f has finite degree, 2. f is invariant under the action of S∞ on Q[[x1 , x2 , . (xαi11 · · · xαikk ) = xασ1(i ) · · · xασk(i ) . 1 k That is, σ . f = f when the action of σ is extended by linearity. 3. If f = x21 + x22 + x1 x2 and σ ∈ S2 , then σ . f = x21 + x22 + x1x2 = f . The set of all symmetric functions with the operations of the next subsection forms a graded Hopf algebra Sym = Symn n 0 spanned by the following functions, strongly suggested by the definition of Sym.

Download PDF sample

Rated 4.99 of 5 – based on 25 votes