Updown numbers and the initial monomials of the slope variety

zbMATH Open1186.05014arXiv0905.4751MaRDI QIDQ2380237FDOQ2380237

Authors: Jeremy L. Martin, Jennifer D. Wagner 

Publication date: 26 March 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: Let $I_n$ be the ideal of all algebraic relations on the slopes of the $$ 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 initial 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.

Full work available at URL: https://arxiv.org/abs/0905.4751

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• The slopes determined by \(n\) points in the plane
• Counting points of slope varieties over finite fields
• Ordering points by linear functionals
• Combinatorics and geometry of power ideals
• scientific article; zbMATH DE number 2196316

zbMATH Keywords

permutationsenumerationidealEuler numbersnumber of generatorspattern avoidance conditionupdown numbers

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Configurations and arrangements of linear subspaces (14N20)

Cited In (3)

• Title not available (Why is that?)
• Bijections for Entringer families
• The slopes determined by \(n\) points in the plane

This page was built for publication: Updown numbers and the initial monomials of the slope variety

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380237)