Counting nonintersecting lattice paths with turns.

Krattenthaler, Christian

Displaying similar documents to “Counting nonintersecting lattice paths with turns.”

Littlewood-Richardson without algorithmically defined bijections.

Hoffman, Peter (1988)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity:

A reduction technique in Waring's problem, I

Kent D. Boklan (1993)

Acta Arithmetica

Similarity:

Optimal stationary policies inrisk-sensitive dynamic programs with finite state spaceand nonnegative rewards

Rolando Cavazos-Cadena, Raúl Montes-de-Oca (2000)

Applicationes Mathematicae

Similarity:

This work concerns controlled Markov chains with finite state space and nonnegative rewards; it is assumed that the controller has a constant risk-sensitivity, and that the performance ofa control policy is measured by a risk-sensitive expected total-reward criterion. The existence of optimal stationary policies isstudied within this context, and the main resultestablishes the optimalityof a stationary policy achieving the supremum in the correspondingoptimality equation, whenever the...