Sweep maps: A continuous family of sorting algorithms

We define a family of maps on lattice paths, called sweep maps, that assign levels to each step in the path and sort steps according to their level. Surprisingly, although sweep maps act by sorting, they appear to be bijective in general. The sweep maps give concise combinatorial formulas for the q,t-Catalan numbers, the higher q,t-Catalan numbers, the q,t-square numbers, and many more general polynomials connected to the nabla operator and rational Catalan combinatorics. We prove that many algorithms that have appeared in the literature (including maps studied by Andrews, Egge, Gorsky, Haglund, Hanusa, Jones, Killpatrick, Krattenthaler, Kremer, Orsina, Mazin, Papi, Vaille, and the present authors) are all special cases of the sweep maps or their inverses. The sweep maps provide a very simple unifying framework for understanding all of these algorithms. We explain how inversion of the sweep map (which is an open problem in general) can be solved in known special cases by finding a "bounce path" for the lattice paths under consideration. We also define a generalized sweep map acting on words over arbitrary alphabets with arbitrary weights, which is also conjectured to be bijective.Comment: 21 pages; full version of FPSAC 2014 extended abstrac

Transition matrices for symmetric and quasisymmetric Hall-Littlewood polynomials

We introduce explicit combinatorial interpretations for the coefficients in some of the transition matrices relating to skew Hall-Littlewood polynomials P_lambda/mu(x;t) and Hivert's quasisymmetric Hall-Littlewood polynomials G_gamma(x;t). More specifically, we provide: 1) the G-expansions of the Hall-Littlewood polynomials P_lambda, the monomial quasisymmetric polynomials M_alpha, the quasisymmetric Schur polynomials S_alpha, and the peak quasisymmetric functions K_alpha; 2) an expansion of P_lambda/mu in terms of the F_alpha's. The F-expansion of P_lambda/mu is facilitated by introducing starred tableaux.Comment: 28 pages; added brief discussion of the Hall-Littlewood Q', typos corrected, added references in response to referee suggestion

Generic approach for deriving reliability and maintenance requirements through consideration of in-context customer objectives

Not all implementations of reliability are equally effective at providing customer and user benefit. Random system failure with no prior warning or failure accommodation will have an immediate, usually adverse impact on operation. Nevertheless, this approach to reliability, implicit in measurements such as ‘failure rate’ and ‘MTBF’, is widely assumed without consideration of potential benefits of pro-active maintenance. Similarly, it is easy to assume that improved maintainability is always a good thing. However, maintainability is only one option available to reduce cost of ownership and reduce the impact of failure. This paper discusses a process for deriving optimised reliability and maintenance requirements through consideration of in-context customer objectives rather than a product in isolation

Too little, too late: reduced visual span and speed characterize pure alexia

Whether normal word reading includes a stage of visual processing selectively dedicated to word or letter recognition is highly debated. Characterizing pure alexia, a seemingly selective disorder of reading, has been central to this debate. Two main theories claim either that 1) Pure alexia is caused by damage to a reading specific brain region in the left fusiform gyrus or 2) Pure alexia results from a general visual impairment that may particularly affect simultaneous processing of multiple items. We tested these competing theories in 4 patients with pure alexia using sensitive psychophysical measures and mathematical modeling. Recognition of single letters and digits in the central visual field was impaired in all patients. Visual apprehension span was also reduced for both letters and digits in all patients. The only cortical region lesioned across all 4 patients was the left fusiform gyrus, indicating that this region subserves a function broader than letter or word identification. We suggest that a seemingly pure disorder of reading can arise due to a general reduction of visual speed and span, and explain why this has a disproportionate impact on word reading while recognition of other visual stimuli are less obviously affected

A continuous family of partition statistics equidistributed with length

AbstractThis article investigates a remarkable generalization of the generating function that enumerates partitions by area and number of parts. This generating function is given by the infinite product ∏i⩾11/(1−tqi). We give uncountably many new combinatorial interpretations of this infinite product involving partition statistics that arose originally in the context of Hilbert schemes. We construct explicit bijections proving that all of these statistics are equidistributed with the length statistic on partitions of n. Our bijections employ various combinatorial constructions involving cylindrical lattice paths, Eulerian tours on directed multigraphs, and oriented trees

A rooted variant of Stanley's chromatic symmetric function

Richard Stanley defined the chromatic symmetric function $X_G$ of a graph $G$ and asked whether there are non-isomorphic trees $T$ and $U$ with $X_T=X_U$. We study variants of the chromatic symmetric function for rooted graphs, where we require the root vertex to either use or avoid a specified color. We present combinatorial identities and recursions satisfied by these rooted chromatic polynomials, explain their relation to pointed chromatic functions and rooted $U$-polynomials, and prove three main theorems. First, for all non-empty connected graphs $G$, Stanley's polynomial $X_G(x_1,\ldots,x_N)$ is irreducible in $\mathbb{Q}[x_1,\ldots,x_N]$ for all large enough $N$. The same result holds for our rooted variant where the root node must avoid a specified color. We prove irreducibility by a novel combinatorial application of Eisenstein's Criterion. Second, we prove the rooted version of Stanley's Conjecture: two rooted trees are isomorphic as rooted graphs if and only if their rooted chromatic polynomials are equal. In fact, we prove that a one-variable specialization of the rooted chromatic polynomial (obtained by setting $x_0=x_1=q$, $x_2=x_3=1$, and $x_n=0$ for $n>3$) already distinguishes rooted trees. Third, we answer a question of Pawlowski by providing a combinatorial interpretation of the monomial expansion of pointed chromatic functions.Comment: 21 pages; v2: added a short algebraic proof to Theorem 2 (now Theorem 15), we also answer a question of Pawlowski about monomial expansions; v3: added additional one-variable specialization results, simplified main proof