2 citations · 4 across the 5 of their papers we have counts for
8 papers
Balanced configurations of points in the plane
Laura Pierson, Julian Wellman
A balanced configuration of points on the sphere is a (finite) set of points which are in equilibrium if they act on each other according any force law dependent only on the…
Dihedral Sieving on Cluster Complexes
Zachary Stier, Julian Wellman, Zixuan Xu
The cyclic sieving phenomenon of Reiner, Stanton, and White characterizes the stabilizers of cyclic group actions on finite sets using q-analogue polynomials. Eu and Fu demonstrate…
Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess is Hard
Josh Brunner, Erik D. Demaine, Dylan Hendrickson +1
We prove PSPACE-completeness of two classic types of Chess problems when generalized to n-by-n boards. A "retrograde" problem asks whether it is possible for a position to be reach…
Rowmotion Orbits of Trapezoid Posets
Quang Vu Dao, Julian Wellman, Calvin Yost-Wolff +1
Rowmotion is an invertible operator on the order ideals of a poset which has been extensively studied and is well understood for the rectangle poset. In this paper, we show that ro…
Extended Nestohedra and their Face Numbers
Quang Dao, Christina Meng, Julian Wellman +3
Nestohedra are a family of convex polytopes that includes permutohedra, associahedra, and graph associahedra. In this paper, we study an extension of such polytopes, called extende…
An Optimal Algorithm for Online Freeze-tag
Josh Brunner, Julian Wellman
In the freeze-tag problem, one active robot must wake up many frozen robots. The robots are considered as points in a metric space, where active robots move at a constant rate and…
Flip cycles in plabic graphs
Alexey Balitskiy, Julian Wellman
Planar bicolored (plabic) graphs are combinatorial objects introduced by Postnikov to give parameterizations of the positroid cells of the totally nonnegative Grassmannian $\text{G…
Lower Bounds on Davenport-Schinzel Sequences via Rectangular Zarankiewicz Matrices
Julian Wellman, Seth Pettie
An order- Davenport-Schinzel sequence over an -letter alphabet is one avoiding immediate repetitions and alternating subsequences with length . The main problem is to de…