An analogue of Jeu de taquin for Littelmann's crystal paths.
van Leeuwen, Marc A.A. (1998)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Displaying similar documents to “On capacity regions of discrete asynchronous multiple access channels”
An analogue of Jeu de taquin for Littelmann's crystal paths.
Large equilateral triangles inscribed in the unit disk of a Minkowski plane.
Fabińska, Ewa, Lassak, Marek (2004)
Beiträge zur Algebra und Geometrie
Similarity:
The Lotharingian impact on combinatorial mathematics: Myth or reality?
Foata, Dominique (2003)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
The work of George Andrews: a Madison perspective.
Askey, Richard (1999)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
Christian Mauduit, András Sárközy (1997)
Acta Arithmetica
Similarity:
Local integrating factors.
Walcher, Sebastian (2003)
Journal of Lie Theory
Similarity:
Some debts I owe.
Andrews, George E. (1999)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
More on convolution of Riemannian manifolds.
Chen, Bang-Yen (2003)
Beiträge zur Algebra und Geometrie
Similarity:
Categories of locally diagonal partial algebras.
Šlapal, Josef (2004)
Beiträge zur Algebra und Geometrie
Similarity:
Graphical major indices. II.
Foata, Dominique, Krattenthaler, Christian (1995)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Chance constrained bottleneck transportation problem with preference of routes
Yue Ge, Minghao Chen, Hiroaki Ishii (2012)
Kybernetika
Similarity:
This paper considers a variant of the bottleneck transportation problem. For each supply-demand point pair, the transportation time is an independent random variable. Preference of each route is attached. Our model has two criteria, namely: minimize the transportation time target subject to a chance constraint and maximize the minimal preference among the used routes. Since usually a transportation pattern optimizing two objectives simultaneously does not exist, we define non-domination...