Related papers: Richard Stanley through a crystal lens and from a …

Let G be a group of automorphisms of a ranked poset Q and let N_{k} denote the number of orbits on the elements of rank k in Q. What can be said about the N_{k} for standard posets, such as finite projective spaces or the Boolean lattice?…

The Stern poset $\mathcal{S}$ is a graded infinite poset naturally associated to Stern's triangle, which was defined by Stanley analogously to Pascal's triangle. Let $P_n$ denote the interval of $\mathcal{S}$ from the unique element of row…

Some conjectures on partition hook lengths, recently stated by the author, have been proved and generalized by Stanley, who also needed a formula by Andrews, Goulden and Jackson on symmetric functions to complete his derivation. Another…

We study the action of a differential operator on Schubert polynomials. Using this action, we first give a short new proof of an identity of I. Macdonald (1991). We then prove a determinant conjecture of R. Stanley (2017). This conjecture…

This paper describes the probabilistic behaviour of a random Sturmian word. It performs the probabilistic analysis of the recurrence function which can be viewed as a waiting time to discover all the factors of length $n$ of the Sturmian…

Rewriting methods have been developed for the study of coherence for algebraic objects. This consists in starting with a convergent presentation, and expliciting a family of generating confluences to obtain a coherent presentation -- one…

In this paper, a new method based on probability generating functions is used to obtain multiple Stein operators for various random variables closely related to Poisson, binomial and negative binomial distributions. Also, Stein operators…

Let W be an arbitrary Coxeter group of simply-laced type (possibly infinite but of finite rank), u,v be any two elements in W, and i be a reduced word (of length m) for the pair (u,v) in the Coxeter group W\times W. We associate to i a…

Let W be an infinite irreducible Coxeter group with (s_1, ..., s_n) the simple generators. We give a simple proof that the word s_1 s_2 ... s_n s_1 s_2 >... s_n ... s_1 s_2 ... s_n is reduced for any number of repetitions of s_1 s_2 >...…

A routine crystallography technique, crystal structure analysis, is rarely performed in computational condensed matter research. The lack of methods to identify and characterize crystal structures reliably in particle simulation data…

We consider the finite element approximation of fractional powers of regularly accretive operators via the Dunford-Taylor integral approach. We use a sinc quadrature scheme to approximate the Balakrishnan representation of the negative…

We count factorizations of Singer cycles as products of reflections in the families of special and general unitary and linear groups over a finite field. In the case of minimum-length factorizations, the resulting answer is a striking…

Given a permutation statistic $\operatorname{st}$, define its inverse statistic $\operatorname{ist}$ by $\operatorname{ist}(\pi):=\operatorname{st}(\pi^{-1})$. We give a general approach, based on the theory of symmetric functions, for…

Many aspects of the asymptotics of Plancherel distributed partitions have been studied in the past fifty years, in particular the limit shape, the distribution of the longest rows, connections with random matrix theory and characters of the…

Backwards analysis, first popularized by Seidel, is often the simplest most elegant way of analyzing a randomized algorithm. It applies to incremental algorithms where elements are added incrementally, following some random permutation,…

Carleson and sparse collections of sets play a central role in dyadic harmonic analysis. We employ methods from optimization theory to study such collections. First, we present a strongly polynomial algorithm to compute the Carleson…

Using some modification of the standard fermion technique we derive factorized formula for spin operator matrix elements (form-factors) between general eigenstates of the Hamiltonian of quantum Ising chain in a transverse field of finite…

The constraint operators belonging to a generally covariant system are found out within the framework of the BRST formalism. The result embraces quadratic Hamiltonian constraints whose potential can be factorized as a never null function…

This paper unites two problem-solving traditions in computer science: (1) constraint-based reasoning, and (2) formal concept analysis. For basic definitions and properties of networks of constraints, we follow the foundational approach of…

The concept of $t$-difference operator for functions of partitions is introduced to prove a generalization of Stanley's theorem on polynomiality of Plancherel averages of symmetric functions related to contents and hook lengths. Our…