Bijection between bigrassmannian permutations maximal below a permutation and its essential set.
The Electronic Journal of Combinatorics [electronic only] (2010)
- Volume: 17, Issue: 1, page Research Paper N27, 8 p.-Research Paper N27, 8 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topKobayashi, Masato. "Bijection between bigrassmannian permutations maximal below a permutation and its essential set.." The Electronic Journal of Combinatorics [electronic only] 17.1 (2010): Research Paper N27, 8 p.-Research Paper N27, 8 p.. <http://eudml.org/doc/229998>.
@article{Kobayashi2010,
author = {Kobayashi, Masato},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {bigrassmanian permutations; Bruhat order; essential set;; essential set},
language = {eng},
number = {1},
pages = {Research Paper N27, 8 p.-Research Paper N27, 8 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Bijection between bigrassmannian permutations maximal below a permutation and its essential set.},
url = {http://eudml.org/doc/229998},
volume = {17},
year = {2010},
}
TY - JOUR
AU - Kobayashi, Masato
TI - Bijection between bigrassmannian permutations maximal below a permutation and its essential set.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2010
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 17
IS - 1
SP - Research Paper N27, 8 p.
EP - Research Paper N27, 8 p.
LA - eng
KW - bigrassmanian permutations; Bruhat order; essential set;; essential set
UR - http://eudml.org/doc/229998
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.