GDGalen Dorpalen-Barry
Galen Dorpalen-Barry
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Galen Dorpalen-Barry has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Cyrus Hettle
Georgia Institute of Technology
2 shared publications - Jang Soo Kim
Department of Mathematics, Sungkyunkwan University, Suwon, South Korea
2 shared publications - Jeremy L. Martin
Department of Mathematics, University of Kansas, Lawrence, USA
2 shared publications - Victor Reiner
School of Mathematics, University of Minnesota, Minneapolis, USA
2 shared publications Ayomikun Adeniran
1 shared publication- David C. Livingston
Mathematics Department University of Wyoming 82071 Laramie WY
1 shared publication
Latest Publications
- Open Access
A positivity phenomenon in Elser's Gaussian-cluster percolation model
Veit Elser proposed a random graph model for percolation in which physical dimension appears as a parameter. Studying this model combinatorially leads naturally to the consideration of numerical graph invariants which we call \emph{Elser numbers} $\mathsf{els}_k(G)$, where $G$ is a connected graph and $k$ a nonnegative integer. Elser had proven that $\mathsf{els}_1(G)=0$ for all $G$. By interpreting the Elser numbers as Euler characteristics of appropriate simplicial complexes called \emph{nucleus complexes}, we prove that for all graphs $G$, they are nonpositive when $k=0$ and nonnegative for $k\geq2$. The last result confirms a conjecture of Elser. Furthermore, we give necessary and sufficient conditions, in terms of the 2-connected structure of~$G$, for the nonvanishing of the Elser numbers.Open AccessA positivity phenomenon in Elser's Gaussian-cluster percolation model
Veit Elser proposed a random graph model for percolation in which physical dimension appears as a parameter. Studying this model combinatorially leads naturally to the consideration of numerical graph invariants which we call \emph{Elser numbers} $\mathsf{els}_k(G)$, where $G$ is a connected graph and $k$ a nonnegative integer. Elser had proven that $\mathsf{els}_1(G)=0$ for all $G$. By interpreting the Elser numbers as Euler characteristics of appropriate simplicial complexes called \emph{nucleus complexes}, we prove that for all graphs $G$, they are nonpositive when $k=0$ and nonnegative for $k\geq2$. The last result confirms a conjecture of Elser. Furthermore, we give necessary and sufficient conditions, in terms of the 2-connected structure of~$G$, for the nonvanishing of the Elser numbers. - 29 July 2022
- Published by Mathematical Sciences Publishers in Involve, a Journal of Mathematics
- Vol. 15 (2) , 271-288
Filtering cohomology of ordinary and Lagrangian Grassmannians
- 29 July 2022
- Published by Mathematical Sciences Publishers in Involve, a Journal of Mathematics
- Vol. 15 (2) , 271-288
Filtering cohomology of ordinary and Lagrangian Grassmannians
- 25 January 2021
- Published by Springer Nature in Order
- Vol. 38 (2) , 283-322
Whitney Numbers for Poset Cones
- 25 January 2021
- Published by Springer Nature in Order
- Vol. 38 (2) , 283-322
Whitney Numbers for Poset Cones
- Open Access
Enumerating Parking Completions Using Join and Split
Given a strictly increasing sequence $\mathbf{t}$ with entries from $[n]:=\{1,\ldots,n\}$, a parking completion is a sequence $\mathbf{c}$ with $|\mathbf{t}|+|\mathbf{c}|=n$ and $|\{t\in \mathbf{t}\mid t\le i\}|+|\{c\in \mathbf{c}\mid c\le i\}|\ge i$ for all $i$ in $[n]$. We can think of $\mathbf{t}$ as a list of spots already taken in a street with $n$ parking spots and $\mathbf{c}$ as a list of parking preferences where the $i$-th car attempts to park in the $c_i$-th spot and if not available then proceeds up the street to find the next available spot, if any. A parking completion corresponds to a set of preferences $\mathbf{c}$ where all cars park. We relate parking completions to enumerating restricted lattice paths and give formulas for both the ordered and unordered variations of the problem by use of a pair of operations termed \textbf{Join} and \textbf{Split}. Our results give a new volume formula for most Pitman-Stanley polytopes, and enumerate the signature parking functions of Ceballos and Gonz\'alez D'Le\'on.Open AccessEnumerating Parking Completions Using Join and Split
Given a strictly increasing sequence $\mathbf{t}$ with entries from $[n]:=\{1,\ldots,n\}$, a parking completion is a sequence $\mathbf{c}$ with $|\mathbf{t}|+|\mathbf{c}|=n$ and $|\{t\in \mathbf{t}\mid t\le i\}|+|\{c\in \mathbf{c}\mid c\le i\}|\ge i$ for all $i$ in $[n]$. We can think of $\mathbf{t}$ as a list of spots already taken in a street with $n$ parking spots and $\mathbf{c}$ as a list of parking preferences where the $i$-th car attempts to park in the $c_i$-th spot and if not available then proceeds up the street to find the next available spot, if any. A parking completion corresponds to a set of preferences $\mathbf{c}$ where all cars park. We relate parking completions to enumerating restricted lattice paths and give formulas for both the ordered and unordered variations of the problem by use of a pair of operations termed \textbf{Join} and \textbf{Split}. Our results give a new volume formula for most Pitman-Stanley polytopes, and enumerate the signature parking functions of Ceballos and Gonz\'alez D'Le\'on. - Open Access
Whitney Numbers for Poset Cones
Hyperplane arrangements dissect $\mathbb{R}^n$ into connected components called chambers, and a well-known theorem of Zaslavsky counts chambers as a sum of nonnegative integers called Whitney numbers of the first kind. His theorem generalizes to count chambers within any cone defined as the intersection of a collection of halfspaces from the arrangement, leading to a notion of Whitney numbers for each cone. This paper focuses on cones within the braid arrangement, consisting of the reflecting hyperplanes $x_i=x_j$ inside $\mathbb{R}^n$ for the symmetric group, thought of as the type $A_{n-1}$ reflection group. Here cones correspond to posets, chambers within the cone correspond to linear extensions of the poset, and the Whitney numbers of the cone interestingly refine the number of linear extensions of the poset. We interpret this refinement for all posets as counting linear extensions according to a statistic that generalizes the number of left-to-right maxima of a permutation. When the poset is a disjoint union of chains, we interpret this refinement differently, using Foata's theory of cycle decomposition for multiset permutations, leading to a simple generating function compiling these Whitney numbers.Open AccessWhitney Numbers for Poset Cones
Hyperplane arrangements dissect $\mathbb{R}^n$ into connected components called chambers, and a well-known theorem of Zaslavsky counts chambers as a sum of nonnegative integers called Whitney numbers of the first kind. His theorem generalizes to count chambers within any cone defined as the intersection of a collection of halfspaces from the arrangement, leading to a notion of Whitney numbers for each cone. This paper focuses on cones within the braid arrangement, consisting of the reflecting hyperplanes $x_i=x_j$ inside $\mathbb{R}^n$ for the symmetric group, thought of as the type $A_{n-1}$ reflection group. Here cones correspond to posets, chambers within the cone correspond to linear extensions of the poset, and the Whitney numbers of the cone interestingly refine the number of linear extensions of the poset. We interpret this refinement for all posets as counting linear extensions according to a statistic that generalizes the number of left-to-right maxima of a permutation. When the poset is a disjoint union of chains, we interpret this refinement differently, using Foata's theory of cycle decomposition for multiset permutations, leading to a simple generating function compiling these Whitney numbers.