Updown numbers and the initial monomials of the slope variety (Q2380237)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Updown numbers and the initial monomials of the slope variety |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Updown numbers and the initial monomials of the slope variety |
scientific article |
Statements
Updown numbers and the initial monomials of the slope variety (English)
0 references
26 March 2010
0 references
Summary: Let \(I_n\) be the ideal of all algebraic relations on the slopes of the \(\binom{n}{2}\) lines formed by placing \(n\) points in a plane and connecting each pair of points with a line. Under each of two natural term orders, the ideal of \(I_n\) is generated by monomials corresponding to permutations satisfying a certain pattern-avoidance condition. We show bijectively that these permutations are enumerated by the updown (or Euler) numbers, thereby obtaining a formula for the number of generators of the initial ideal of \(I_n\) in each degree.
0 references
permutations
0 references
pattern avoidance condition
0 references
enumeration
0 references
updown numbers
0 references
Euler numbers
0 references
number of generators
0 references
ideal
0 references
0.7827132940292358
0 references
0.6992649435997009
0 references
0.6972346305847168
0 references
0.6972346305847168
0 references
