skip to main content


The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 5:00 PM ET until 11:00 PM ET on Friday, June 21 due to maintenance. We apologize for the inconvenience.

Title: Composition-dependent shuffle-shear coupling and shuffle-regulated strain glass transition in compositionally modulated Ti-Nb alloys
Award ID(s):
Author(s) / Creator(s):
; ; ; ; ; ; ; ; ; ;
Publisher / Repository:
Date Published:
Journal Name:
Acta Materialia
Page Range / eLocation ID:
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Krattenthaler, Christian ; Thibon, Jean-Yves (Ed.)
  2. Abstract

    A permutation statistic$${{\,\textrm{st}\,}}$$stis said to be shuffle-compatible if the distribution of$${{\,\textrm{st}\,}}$$stover the set of shuffles of two disjoint permutations$$\pi $$πand$$\sigma $$σdepends only on$${{\,\textrm{st}\,}}\pi $$stπ,$${{\,\textrm{st}\,}}\sigma $$stσ, and the lengths of$$\pi $$πand$$\sigma $$σ. Shuffle-compatibility is implicit in Stanley’s early work onP-partitions, and was first explicitly studied by Gessel and Zhuang, who developed an algebraic framework for shuffle-compatibility centered around their notion of the shuffle algebra of a shuffle-compatible statistic. For a family of statistics called descent statistics, these shuffle algebras are isomorphic to quotients of the algebra of quasisymmetric functions. Recently, Domagalski, Liang, Minnich, Sagan, Schmidt, and Sietsema defined a version of shuffle-compatibility for statistics on cyclic permutations, and studied cyclic shuffle-compatibility through purely combinatorial means. In this paper, we define the cyclic shuffle algebra of a cyclic shuffle-compatible statistic, and develop an algebraic framework for cyclic shuffle-compatibility in which the role of quasisymmetric functions is replaced by the cyclic quasisymmetric functions recently introduced by Adin, Gessel, Reiner, and Roichman. We use our theory to provide explicit descriptions for the cyclic shuffle algebras of various cyclic permutation statistics, which in turn gives algebraic proofs for their cyclic shuffle-compatibility.

    more » « less
  3. Abstract We generalize the shuffle theorem and its $(km,kn)$ version, as conjectured by Haglund et al. and Bergeron et al. and proven by Carlsson and Mellit, and Mellit, respectively. In our version the $(km,kn)$ Dyck paths on the combinatorial side are replaced by lattice paths lying under a line segment whose x and y intercepts need not be integers, and the algebraic side is given either by a Schiffmann algebra operator formula or an equivalent explicit raising operator formula. We derive our combinatorial identity as the polynomial truncation of an identity of infinite series of $\operatorname {\mathrm {GL}}_{l}$ characters, expressed in terms of infinite series versions of LLT polynomials. The series identity in question follows from a Cauchy identity for nonsymmetric Hall–Littlewood polynomials. 
    more » « less