78 citations
- Dartmouth CollegeUS23 papers
- Arizona State UniversityUS3 papers
- University of IowaUS3 papers
- Cornell UniversityUS2 papers
- University of WollongongAU2 papers
- UNSW SydneyAU2 papers
- Western Michigan UniversityUS2 papers
- Duke UniversityUS1 paper
- East Tennessee State UniversityUS1 paper
- Emory UniversityUS1 paper
- Georgia Institute of TechnologyUS1 paper
- Harvard University PressUS1 paper
4 papers · 1 filter
The -class and almost-increasing permutations
Sergi Elizalde
In this paper we give a bijection between the class of permutations that can be drawn on an X-shape and a certain set of permutations that appears in [Knuth] in connection to sorti…
Generating trees for permutations avoiding generalized patterns
Sergi Elizalde
We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at e…
Domination Cover Pebbling: Graph Families
James Gardner, Anant P. Godbole, Alberto Mokak Teguia +3
Given a configuration of pebbles on the vertices of a connected graph G, a pebbling move is defined as the removal of two pebbles from some vertex, and the placement of one of thes…
Fixed points and excedances in restricted permutations
Sergi Elizalde
In this paper we prove that among the permutations of length n with i fixed points and j excedances, the number of 321-avoiding ones equals the number of 132-avoiding ones, for all…