Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A061539
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A061539 Signed permutations in B_n which correspond to smooth Schubert varieties. These permutations avoid the following patterns: (-2 -1) (1 2 -3) (1 -2 -3) (-1 2 -3) (2 -1 -3) (-2 1 -3) (3 -2 1) (2 -4 3 1) (-2 -4 3 1) (3412) (3 4 -1 2) (-3 4 1 2) (4 1 3 -2) (4 -1 3 -2) (4 2 3 1) (4 2 3 -1) (-4 2 3 1). +0
1
2, 7, 28, 116, 490, 2094, 9014, 38988, 169184 (list; graph; listen)
OFFSET

1,1

COMMENT

A signed permutation w corresponds to a matrix with exactly one nonzero entry in each row and column and that entry is either 1 or -1. A signed permutation avoids the pattern (1 2 -3) if no three rows and three columns gives a submatrix with diagonal entries 1 1 -1.

REFERENCES

S. C. Billey, Pattern Avoidance and Rational Smoothness of Schubert varieties. Advances in Math, vol. 139 (1998) pp. 141-156.

EXAMPLE

a(2) = 7 because there are 8 signed permutations of two elements and there is exactly one bad pattern of length 2.

CROSSREFS

Cf. A032351.

Sequence in context: A012855 A150646 A128611 this_sequence A116078 A150647 A150648

Adjacent sequences: A061536 A061537 A061538 this_sequence A061540 A061541 A061542

KEYWORD

more,nonn

AUTHOR

Sara C. Billey (sara(AT)math.mit.edu), May 15 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research