William Q. Erickson
William Q. Erickson has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Herden
Baylor University Waco TX USA
3 shared publications - Jonathan Meddaugh3 shared publications
- Mark R. Sepanski
Baylor University, United States
3 shared publications Cordell Hammon
2 shared publicationsIndalecio Ruiz-Bolanos
2 shared publicationsJasmin Mohn
2 shared publications
Latest Publications
- Open Access
$K$-type multiplicities in degenerate principal series via Howe duality
Let $K$ be one of the complex classical groups ${\rm O}_k$, ${\rm GL}_k$, or ${\rm Sp}_{2k}$. Let $M \subseteq K$ be the block diagonal embedding ${\rm O}_{k_1} \times \cdots \times {\rm O}_{k_r}$ or ${\rm GL}_{k_1} \times \cdots \times {\rm GL}_{k_r}$ or ${\rm Sp}_{2k_1} \times \cdots \times {\rm Sp}_{2k_r}$, respectively. By using Howe duality and seesaw reciprocity as a unified conceptual framework, we prove a formula for the branching multiplicities from $K$ to $M$ which is expressed as a sum of generalized Littlewood-Richardson coefficients, valid within a certain stable range. By viewing $K$ as the complexification of the maximal compact subgroup $K_{\mathbb{R}}$ of the real group $G_{\mathbb{R}} = {\rm GL}(k,\mathbb{R})$, ${\rm GL}(k, \mathbb{C})$, or ${\rm GL}(k,\mathbb{H})$, respectively, one can interpret our branching multiplicities as $K_{\mathbb{R}}$-type multiplicities in degenerate principal series representations of $G_{\mathbb{R}}$. Upon specializing to the minimal $M$, where $k_1 = \cdots = k_r = 1$, we establish a fully general tableau-theoretic interpretation of the branching multiplicities, corresponding to the $K_{\mathbb{R}}$-type multiplicities in the principal series.Open Access$K$-type multiplicities in degenerate principal series via Howe duality
Let $K$ be one of the complex classical groups ${\rm O}_k$, ${\rm GL}_k$, or ${\rm Sp}_{2k}$. Let $M \subseteq K$ be the block diagonal embedding ${\rm O}_{k_1} \times \cdots \times {\rm O}_{k_r}$ or ${\rm GL}_{k_1} \times \cdots \times {\rm GL}_{k_r}$ or ${\rm Sp}_{2k_1} \times \cdots \times {\rm Sp}_{2k_r}$, respectively. By using Howe duality and seesaw reciprocity as a unified conceptual framework, we prove a formula for the branching multiplicities from $K$ to $M$ which is expressed as a sum of generalized Littlewood-Richardson coefficients, valid within a certain stable range. By viewing $K$ as the complexification of the maximal compact subgroup $K_{\mathbb{R}}$ of the real group $G_{\mathbb{R}} = {\rm GL}(k,\mathbb{R})$, ${\rm GL}(k, \mathbb{C})$, or ${\rm GL}(k,\mathbb{H})$, respectively, one can interpret our branching multiplicities as $K_{\mathbb{R}}$-type multiplicities in degenerate principal series representations of $G_{\mathbb{R}}$. Upon specializing to the minimal $M$, where $k_1 = \cdots = k_r = 1$, we establish a fully general tableau-theoretic interpretation of the branching multiplicities, corresponding to the $K_{\mathbb{R}}$-type multiplicities in the principal series. - Open Access
Limits and Periodicity of Metamour $2$-Distance Graphs
Given a finite simple graph $G$, let $\operatorname{M}(G)$ denote its 2-distance graph, in which two vertices are adjacent if and only if they have distance 2 in $G$. In this paper, we consider the periodic behavior of the sequence $G, \operatorname{M}(G), \operatorname{M}^2(G), \operatorname{M}^3(G), \ldots$ obtained by iterating the 2-distance operation. In particular, we classify the connected graphs with period 3, and we partially characterize those with period 2. We then study two families of graphs whose 2-distance sequence is eventually periodic: namely, generalized Petersen graphs and complete $m$-ary trees. For each family, we show that the eventual period is 2, and we determine the pre-period and the two limit graphs of the sequence.Open AccessLimits and Periodicity of Metamour $2$-Distance Graphs
Given a finite simple graph $G$, let $\operatorname{M}(G)$ denote its 2-distance graph, in which two vertices are adjacent if and only if they have distance 2 in $G$. In this paper, we consider the periodic behavior of the sequence $G, \operatorname{M}(G), \operatorname{M}^2(G), \operatorname{M}^3(G), \ldots$ obtained by iterating the 2-distance operation. In particular, we classify the connected graphs with period 3, and we partially characterize those with period 2. We then study two families of graphs whose 2-distance sequence is eventually periodic: namely, generalized Petersen graphs and complete $m$-ary trees. For each family, we show that the eventual period is 2, and we determine the pre-period and the two limit graphs of the sequence. - Open Access
The Demazure product extended to biwords
The symmetric group $\mathfrak{S}_n$ (and more generally, any Coxeter group) admits an associative operation known as the Demazure product. In this paper, we first extend the Demazure product to the (infinite) set of all biwords on $\{1, \ldots, n\}$, or equivalently, the set of all $n \times n$ nonnegative integer matrices. We define this product diagrammatically, via braid-like graphs we call kelp beds, since they significantly generalize the seaweeds introduced by Tiskin (2015). Our motivation for this extended Demazure product arises from optimization theory, in particular the semigroup of all $(n+1) \times (n+1)$ simple nonnegative integer Monge matrices equipped with the distance (i.e., min-plus) product. As our main result, we show that this semigroup of Monge matrices is isomorphic to the semigroup of biwords equipped with the extended Demazure product. We exploit this isomorphism to write down generating functions for the growth series of the Monge matrices with respect to certain natural matrix norms.Open AccessThe Demazure product extended to biwords
The symmetric group $\mathfrak{S}_n$ (and more generally, any Coxeter group) admits an associative operation known as the Demazure product. In this paper, we first extend the Demazure product to the (infinite) set of all biwords on $\{1, \ldots, n\}$, or equivalently, the set of all $n \times n$ nonnegative integer matrices. We define this product diagrammatically, via braid-like graphs we call kelp beds, since they significantly generalize the seaweeds introduced by Tiskin (2015). Our motivation for this extended Demazure product arises from optimization theory, in particular the semigroup of all $(n+1) \times (n+1)$ simple nonnegative integer Monge matrices equipped with the distance (i.e., min-plus) product. As our main result, we show that this semigroup of Monge matrices is isomorphic to the semigroup of biwords equipped with the extended Demazure product. We exploit this isomorphism to write down generating functions for the growth series of the Monge matrices with respect to certain natural matrix norms. - Open Access
Stanley decompositions of rings of invariants and certain highest weight Harish-Chandra modules
The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups. This culminates in a graphical description of graded linear bases. By applying well-known results of lattice path combinatorics to Weyl's fundamental theorems of classical invariant theory, we write down Stanley decompositions and Hilbert-Poincare series in terms of families of non-intersecting lattice paths, enumerated with respect to certain corners. In the second half of the paper, we revisit the (semi)invariants in the first half as a special case of a much broader phenomenon. On one hand, polynomial invariants of a group $H$ can be generalized to modules of covariants, i.e., $H$-equivariant polynomial functions between $H$-modules. On the other hand, from the perspective of Roger Howe's theory of dual pairs, these modules of covariants can be viewed as infinite-dimensional simple $(\mathfrak{g}, K)$-modules. This suggests an expanded program in which our goal is to apply combinatorial techniques involving lattice paths in order to write down Hilbert series for arbitrary unitarizable highest-weight $(\mathfrak{g},K)$-modules. As a preview of future work in this program, we present examples showing how modules of covariants -- even those which are not Cohen-Macaulay, and therefore which we would not expect to be combinatorially nice -- can be decomposed in terms of lattice paths. We also extend these methods beyond the classical groups.Open AccessStanley decompositions of rings of invariants and certain highest weight Harish-Chandra modules
The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups. This culminates in a graphical description of graded linear bases. By applying well-known results of lattice path combinatorics to Weyl's fundamental theorems of classical invariant theory, we write down Stanley decompositions and Hilbert-Poincare series in terms of families of non-intersecting lattice paths, enumerated with respect to certain corners. In the second half of the paper, we revisit the (semi)invariants in the first half as a special case of a much broader phenomenon. On one hand, polynomial invariants of a group $H$ can be generalized to modules of covariants, i.e., $H$-equivariant polynomial functions between $H$-modules. On the other hand, from the perspective of Roger Howe's theory of dual pairs, these modules of covariants can be viewed as infinite-dimensional simple $(\mathfrak{g}, K)$-modules. This suggests an expanded program in which our goal is to apply combinatorial techniques involving lattice paths in order to write down Hilbert series for arbitrary unitarizable highest-weight $(\mathfrak{g},K)$-modules. As a preview of future work in this program, we present examples showing how modules of covariants -- even those which are not Cohen-Macaulay, and therefore which we would not expect to be combinatorially nice -- can be decomposed in terms of lattice paths. We also extend these methods beyond the classical groups. - Open Access
Young tableau reconstruction via minors
The tableau reconstruction problem, posed by Monks (2009), asks the following. Starting with a standard Young tableau $T$, a 1-minor of $T$ is a tableau obtained by first deleting any cell of $T$, and then performing jeu de taquin slides to fill the resulting gap. This can be iterated to arrive at the set of $k$-minors of $T$. The problem is this: given $k$, what are the values of $n$ such that every tableau of size $n$ can be reconstructed from its set of $k$-minors? For $k=1$, the problem was recently solved by Cain and Lehtonen. In this paper, we solve the problem for $k=2$, proving the sharp lower bound $n \geq 8$. In the case of multisets of $k$-minors, we also give a lower bound for arbitrary $k$, as a first step toward a sharp bound in the general multiset case.Open AccessYoung tableau reconstruction via minors
The tableau reconstruction problem, posed by Monks (2009), asks the following. Starting with a standard Young tableau $T$, a 1-minor of $T$ is a tableau obtained by first deleting any cell of $T$, and then performing jeu de taquin slides to fill the resulting gap. This can be iterated to arrive at the set of $k$-minors of $T$. The problem is this: given $k$, what are the values of $n$ such that every tableau of size $n$ can be reconstructed from its set of $k$-minors? For $k=1$, the problem was recently solved by Cain and Lehtonen. In this paper, we solve the problem for $k=2$, proving the sharp lower bound $n \geq 8$. In the case of multisets of $k$-minors, we also give a lower bound for arbitrary $k$, as a first step toward a sharp bound in the general multiset case. - Open Access
A Cayley-Menger formula for the earth mover's simplex
The earth mover's distance (EMD) is a well-known metric on spaces of histograms; roughly speaking, the EMD measures the minimum amount of work required to equalize two histograms. The EMD has a natural generalization that compares an arbitrary number of histograms; in this case, the EMD can be viewed as hypervolume in $d$ dimensions, where the histograms are vertices of a $d$-simplex. For $d=2$, it is known that the EMD between three histograms equals half the sum of the pairwise EMDs -- a sort of Heron's formula for histograms, but where the area equals the semiperimeter. In this paper, by introducing an object we call the earth mover's simplex, we prove two generalizations of this Heron-like formula in arbitrary dimension: the first (a sort of Cayley-Menger formula) expresses the EMD in terms of the edge lengths (the pairwise EMDs), the second in terms of the facets (EMDs excluding one histogram).Open AccessA Cayley-Menger formula for the earth mover's simplex
The earth mover's distance (EMD) is a well-known metric on spaces of histograms; roughly speaking, the EMD measures the minimum amount of work required to equalize two histograms. The EMD has a natural generalization that compares an arbitrary number of histograms; in this case, the EMD can be viewed as hypervolume in $d$ dimensions, where the histograms are vertices of a $d$-simplex. For $d=2$, it is known that the EMD between three histograms equals half the sum of the pairwise EMDs -- a sort of Heron's formula for histograms, but where the area equals the semiperimeter. In this paper, by introducing an object we call the earth mover's simplex, we prove two generalizations of this Heron-like formula in arbitrary dimension: the first (a sort of Cayley-Menger formula) expresses the EMD in terms of the edge lengths (the pairwise EMDs), the second in terms of the facets (EMDs excluding one histogram). - Open Access
The sum of all width-one tensors
This paper generalizes a recent result by the authors concerning the sum of width-one matrices; in the present work, we consider width-one tensors of arbitrary dimensions. A tensor is said to have width 1 if, when visualized as an array, its nonzero entries lie along a path consisting of steps in the directions of the standard coordinate vectors. We prove two different formulas to compute the sum of all width-one tensors with fixed dimensions and fixed sum of (nonnegative integer) components. The first formula is obtained by converting width-one tensors into tuples of one-row semistandard Young tableaux; the second formula, which extracts coefficients from products of multiset Eulerian polynomials, is derived via Stanley-Reisner theory, making use of the EL-shelling of the order complex on the standard basis of tensors.
Open AccessThe sum of all width-one tensors
This paper generalizes a recent result by the authors concerning the sum of width-one matrices; in the present work, we consider width-one tensors of arbitrary dimensions. A tensor is said to have width 1 if, when visualized as an array, its nonzero entries lie along a path consisting of steps in the directions of the standard coordinate vectors. We prove two different formulas to compute the sum of all width-one tensors with fixed dimensions and fixed sum of (nonnegative integer) components. The first formula is obtained by converting width-one tensors into tuples of one-row semistandard Young tableaux; the second formula, which extracts coefficients from products of multiset Eulerian polynomials, is derived via Stanley-Reisner theory, making use of the EL-shelling of the order complex on the standard basis of tensors.
- Open Access
Klein cordial trees and odd cyclic cordial friendship graphs
For a graph $G$ and an abelian group $A$, a labeling of the vertices of $G$ induces a labeling of the edges via the sum of adjacent vertex labels. Hovey introduced the notion of an $A$-cordial vertex labeling when both the vertex and edge labels are as evenly distributed as possible. Much work has since been done with trees, hypertrees, paths, cycles, ladders, prisms, hypercubes, and bipartite graphs. In this paper we show that all trees are $\mathbb{Z}_2^2$-cordial except for $P_4$ and $P_5$. In addition, we give numerous results relating to $\mathbb{Z}_m$-cordiality of the friendship graph $F_n$. The most general result shows that when $m$ is an odd multiple of $3$, then $F_n$ is $\mathbb{Z}_m$-cordial for all $n$. We also give a general conjecture to determine when $F_n$ is $\mathbb{Z}_m$-cordial.Open AccessKlein cordial trees and odd cyclic cordial friendship graphs
For a graph $G$ and an abelian group $A$, a labeling of the vertices of $G$ induces a labeling of the edges via the sum of adjacent vertex labels. Hovey introduced the notion of an $A$-cordial vertex labeling when both the vertex and edge labels are as evenly distributed as possible. Much work has since been done with trees, hypertrees, paths, cycles, ladders, prisms, hypercubes, and bipartite graphs. In this paper we show that all trees are $\mathbb{Z}_2^2$-cordial except for $P_4$ and $P_5$. In addition, we give numerous results relating to $\mathbb{Z}_m$-cordiality of the friendship graph $F_n$. The most general result shows that when $m$ is an odd multiple of $3$, then $F_n$ is $\mathbb{Z}_m$-cordial for all $n$. We also give a general conjecture to determine when $F_n$ is $\mathbb{Z}_m$-cordial.