Douglas M. Chen

activity

20192026

most citedPermutation Invariant Parking Assortments

2 citations · 2 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2026

An Improved Bound for Smith's Longest Cycles Conjecture via a Forbidden Subdivision

Douglas M. Chen

Smith's conjecture asserts that in every $k$ -connected graph with $k \geq 2$ , any two longest cycles intersect in at least $k$ vertices. In this work, we establish an $Ω (k^{8/11})$ …

math.CO2023

On the Structure of Permutation Invariant Parking

Douglas M. Chen

We continue the study of parking assortments, a generalization of parking functions introduced by Chen, Harris, Martínez, Pabón-Cancel, and Sargent. Given $n$ cars of lengths $\mat…

math.CO2023

Lattice Path Delta Matroids

Douglas M. Chen, Mario Sanchez, John Veliz +1

We initiate the study of a type $C_{n}$ generalization of the lattice path matroids defined by Bonin, de Mier, and Noy. These are delta matroids whose feasible sets are in bijection…

math.CO2022★ 2 cited

Permutation Invariant Parking Assortments

Douglas M. Chen, Pamela E. Harris, J. Carlos Martínez Mori +2

We introduce parking assortments, a generalization of parking functions with cars of assorted lengths. In this setting, there are $n \in N$ cars of lengths $\mathbf{y}=(y_1,…

math.CO2019

NIM with Cash: A Concrete Approach

Douglas Chen, William Gasarch

Let A be a finite subset of the naturals and let n be a natural. Let NIM(A;n) be the two player game in which players alternate removing $a \in A$ stones from a pile with $n$ stones…