Search

We generalize random-to-random shuffling from a Markov chain on the symmetric group to one on the Type A Iwahori Hecke algebra, and show that its eigenvalues are polynomials in q with non-negative integer coefficients. Setting q=1 recovers results of Dieker and Saliola, whose computation of the spectrum of random-to-random in the symmetric group resolved a nearly 20 year old conjecture by Uyemura-Reyes. Our methods simplify their proofs by drawing novel connections to the Jucys-Murphy elements of the Hecke algebra, Young seminormal forms, and the Okounkov-Vershik approach to representation theory., Comment: Reorganized, streamlined arguments, improved exposition, and addressed/clarified subtleties from v1

Positive geometries were introduced by Arkani-Hamed--Bai--Lam as a method of computing scattering amplitudes in theoretical physics. We show that a positive geometry from a polytope admits a log resolution of singularities to another positive geometry. Our result states that the regions in a wonderful compactification of a hyperplane arrangement complement, which we call wondertopes, are positive geometries. A familiar wondertope is the curvy associahedron, which tiles the moduli space of pointed stable rational curves. Thus our work generalizes the known positive geometry structure on this moduli space., Comment: 33 pages, 10 figures; comments welcome!

We develop the idempotent theory for algebras over a class of semigroups called left regular bands of groups (LRBGs), which simultaneously generalize group algebras of finite groups and left regular band (LRB) algebras. Our techniques weave together the representation theory of finite groups and LRBs, opening the door for a systematic study of LRBGs in an analogous way to LRBs. We apply our results to construct complete systems of primitive orthogonal idempotents in the Mantaci--Reutenauer algebra ${\sf{MR}}_n[G]$ associated to any finite group $G$. When $G$ is abelian, we give closed form expressions for these idempotents, and when $G$ is the cyclic group of order two, we prove that these recover idempotents introduced by Vazirani., Comment: To appear in Journal of Algebra

Graphical chip-firing is a discrete dynamical system where chips are placed on the vertices of a graph and exchanged via simple firing moves. Recent work has sought to generalize chip-firing on graphs to higher dimensions, wherein graphs are replaced by cellular complexes and chip firing becomes flow-rerouting along the faces of the complex. Given such a system, it is natural to ask (1) whether this firing process terminates and (2) if it terminates uniquely (e.g. is confluent). In the graphical case, these questions were definitively answered by Bjorner--Lovasz--Shor, who developed three regimes which completely determine if a given system will terminate. Building on the work of Duval--Klivans--Martin and Felzenszwalb-Klivans, we answer these questions in a context called flow-firing, where the cellular complexes are 2-dimensional.

We examine from an invariant theory viewpoint the monoid algebras for two monoids having large symmetry groups. The first monoid is the free left-regular band on $n$ letters, defined on the set of all injective words, that is, the words with at most one occurrence of each letter. This monoid carries the action of the symmetric group. The second monoid is one of its $q$-analogues, considered by K. Brown, carrying an action of the finite general linear group. In both cases, we show that the invariant subalgebras are semisimple commutative algebras, and characterize them using Stirling and $q$-Stirling numbers. We then use results from the theory of random walks and random-to-top shuffling to decompose the entire monoid algebra into irreducibles, simultaneously as a module over the invariant ring and as a group representation. Our irreducible decompositions are described in terms of derangement symmetric functions introduced by D\'esarm\'enien and Wachs., Comment: final version, to appear in the Pacific Journal of Mathematics

We give a Type $B$ analog of Whitehouse's lifts of the Eulerian representations from $S_n$ to $S_{n+1}$ by introducing a family of $B_{n}$-representations that lift to $B_{n+1}$. As in Type $A$, we interpret these representations combinatorially via a family of orthogonal idempotents in the Mantaci-Reutenauer algebra, and topologically as the graded pieces of the cohomology of a certain $\mathbb{Z}_{2}$-orbit configuration space of $\mathbb{R}^{3}$. We show that the lifted $B_{n+1}$-representations also have a configuration space interpretation, and further parallel the Type $A$ story by giving analogs of many of its notable properties, such as connections to equivariant cohomology and the Varchenko-Gelfand ring., Comment: final version, to appear in Mathematische Zeitschrift

The Eulerian idempotents, first introduced for the symmetric group and later extended to all reflection groups, generate a family of representations called the Eulerian representations that decompose the regular representation. In Type $A$, the Eulerian representations have many elegant but mysterious connections to rings naturally associated with the braid arrangement. In this paper, we unify these results and show that they hold for any reflection group of coincidental type -- that is, $S_{n}$, $B_{n}$, $H_{3}$ or the dihedral group $I_{2}(m)$ -- by giving six characterizations of the Eulerian representations, including as components of the associated graded of the Varchenko-Gelfand ring $\mathcal{V}$. As a consequence, we show that Solomon's descent algebra contains a commutative subalgebra generated by sums of elements with the same number of descents if and only if $W$ is coincidental. More generally, when $W$ is any finite real reflection group, we give a case-free construction of a family of Eulerian representations described by a flat-decomposition of the ring $\mathcal{V}$., Comment: Final version, to appear in the Journal of the London Mathematical Society

The divisor theory of graphs views a finite connected graph $G$ as a discrete version of a Riemann surface. Divisors on $G$ are formal integral combinations of the vertices of $G$, and linear equivalence of divisors is determined by the discrete Laplacian operator for $G$. As in the case of Riemann surfaces, we are interested in the complete linear system $|D|$ of a divisor $D$---the collection of nonnegative divisors linearly equivalent to $D$. Unlike the case of Riemann surfaces, the complete linear system of a divisor on a graph is always finite. We compute generating functions encoding the sizes of all complete linear systems on $G$ and interpret our results in terms of polyhedra associated with divisors and in terms of the invariant theory of the (dual of the) Jacobian group of $G$. If $G$ is a cycle graph, our results lead to a bijection between complete linear systems and binary necklaces. The final section generalizes our results to a model based on integral $M$-matrices., Comment: 26 pages; added "Further work" section

Fulton and Kraskiewicz gave a presentation of Specht modules as a quotient of the space of column tabloids by dual Garnir relations. We simplify this presentation by showing that it can be generated by a single relation for each pair of columns of a tableau with ordered columns, thereby significantly reducing the number of generators given in the original construction. Our presentation applies to all Specht modules, and is of a similar nature to a recent result by Friedmann-Hanlon-Stanley-Wachs that applies to staircase partitions. We show that our presentation implies the Friedmann-Hanlon-Stanley-Wachs presentation., Comment: Final version appearing in the Journal of Pure and Applied Algebra

This review attempts to consider all publicly available studies that examine employment outcomes for people who have left welfare. Only studies that describe their methodology clearly and report survey response rates of 50% or higher are included, for a total of 11 studies reviewed. These studies cover various geographic areas, labor market conditions, and welfare reform policies. Some general patterns emerge. The majority of welfare leavers are working. Shortly after leaving welfare for any reason, including sanction, half to two-thirds of welfare leavers were employed after a specific period of time. Those who remain off welfare tend to have higher employment rates than those who return to welfare, and those who left as a result of sanction have lower employment rates. Leavers usually have low-wage jobs, however, so their earnings remain low, despite high employment rates and number of hours worked. The average welfare leaver's earnings are below the poverty level, and most leavers report incomes that are lower than or similar to their combined earnings and benefits before leaving welfare. One-half to two-thirds of welfare leavers continue to receive Medicaid, while about half receive food stamps. Most families believe they are better off leaving welfare, but about a third report problems providing food, paying utility bills, and paying rent. A few studies found significant reliance on friends and family as a means of additional support. (Contains 10 end notes and 9 tables.) (SLD)