3 citations · 8 across the 28 of their papers we have counts for
6 papers · 1 filter
Forced perimeter in Elnitksy polygons
Bridget Eileen Tenner
We study tiling-based perimeter and characterize when a given perimeter tile appears in all rhombic tilings of an Elnitsky polygon. Regardless of where on the perimeter this tile a…
Sós Permutations
Sarah Bockting-Conrad, Yevgenia Kashina, T. Kyle Petersen +1
Let for fixed real parameters and . For any positive integer , define the Sós permutation to be the lexicographically first permutation such tha…
Star factorizations and noncrossing partitions
Bridget Eileen Tenner
We develop the relationship between minimal transitive star factorizations and noncrossing partitions. This gives a new combinatorial proof of a result by Irving and Rattan, and a…
The range of repetition in reduced decompositions
Bridget Eileen Tenner
Given a permutation w, we look at the range of how often a simple reflection s_k appears in reduced decompositions of w. We compute the minimum and give a sharp upper bound on the…
Admissible pinnacle orderings
Irena Rusu, Bridget Eileen Tenner
A pinnacle of a permutation is a value that is larger than its immediate neighbors when written in one-line notation. In this paper, we build on previous work that characterized ad…
Interval structures in the Bruhat and weak orders
Bridget Eileen Tenner
We study the appearance of notable interval structures -- lattices, modular lattices, distributive lattices, and boolean lattices -- in both the Bruhat and weak orders of Coxeter g…