AbstractThis work presents a simple proof of the Littlewood-Richardson rule on multiplying Schur functions using nonintersecting paths and a characterization of Schur functions by this rule
ABSTRACT We present the implementation of the Littlewood-Richardson rule in L ı E. We describe the m...
19 pages, 5 figures, accepted version (Journal of Combinatorics)19 pages, 5 figures, accepted versio...
AbstractThere is a strikingly simple classical formula for the number of lattice paths avoiding the ...
AbstractThis work presents a simple proof of the Littlewood-Richardson rule on multiplying Schur fun...
This thesis proves a special case of the $k$-Littlewood--Richardson rule, which is analogous to the ...
AbstractThe Littlewood-Richardson construction is shown to yield the same collection of standard tab...
AbstractThe Littlewood-Richardson rule is a combinatorial procedure for computing the multiplicities...
© 2012 Dr. Paul W. T. FijnThis thesis primarily examines several problems in enumerative combinatori...
AbstractThis paper develops a unified enumerative and asymptotic theory of directed two-dimensional ...
AbstractWe present a simple proof of the Littlewood-Richardson rule using a sign-reversing involutio...
International audienceWe analyze some enumerative and asymptotic properties of Dyck paths under a li...
AbstractA bijective proof of Gessel and Viennot is extended to a proof of an n-dimensional q-analogu...
AbstractThis note generalizes André's reflection principle to give a new combinatorial proof of a fo...
In this talk, the combinatorics of osculating lattice paths will be considered, and it will be shown...
AbstractWe use some combinatorial methods to study underdiagonal paths (on the Z2 lattice) made up o...
ABSTRACT We present the implementation of the Littlewood-Richardson rule in L ı E. We describe the m...
19 pages, 5 figures, accepted version (Journal of Combinatorics)19 pages, 5 figures, accepted versio...
AbstractThere is a strikingly simple classical formula for the number of lattice paths avoiding the ...
AbstractThis work presents a simple proof of the Littlewood-Richardson rule on multiplying Schur fun...
This thesis proves a special case of the $k$-Littlewood--Richardson rule, which is analogous to the ...
AbstractThe Littlewood-Richardson construction is shown to yield the same collection of standard tab...
AbstractThe Littlewood-Richardson rule is a combinatorial procedure for computing the multiplicities...
© 2012 Dr. Paul W. T. FijnThis thesis primarily examines several problems in enumerative combinatori...
AbstractThis paper develops a unified enumerative and asymptotic theory of directed two-dimensional ...
AbstractWe present a simple proof of the Littlewood-Richardson rule using a sign-reversing involutio...
International audienceWe analyze some enumerative and asymptotic properties of Dyck paths under a li...
AbstractA bijective proof of Gessel and Viennot is extended to a proof of an n-dimensional q-analogu...
AbstractThis note generalizes André's reflection principle to give a new combinatorial proof of a fo...
In this talk, the combinatorics of osculating lattice paths will be considered, and it will be shown...
AbstractWe use some combinatorial methods to study underdiagonal paths (on the Z2 lattice) made up o...
ABSTRACT We present the implementation of the Littlewood-Richardson rule in L ı E. We describe the m...
19 pages, 5 figures, accepted version (Journal of Combinatorics)19 pages, 5 figures, accepted versio...
AbstractThere is a strikingly simple classical formula for the number of lattice paths avoiding the ...
DOI
Add to ORKG