Related papers: Richard Stanley through a crystal lens and from a …
We give an algorithmic-bijective proof of Macdonald's reduced word identity in the theory of Schubert polynomials, in the special case where the permutation is dominant. Our bijection uses a novel application of David Little's generalized…
David Little developed a combinatorial algorithm to study the Schur-positivity of Stanley symmetric functions and the Lascoux-Sch\"{u}tzenberger tree. We generalize this algorithm to affine Stanley symmetric functions.
We consider several novel aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of L is regular if L is regular, and from this deduce an…
In a Coxeter group $W$, an element is fully commutative if any two of its reduced expressions can be linked by a series of commutation of adjacent letters. These elements have particularly nice combinatorial properties, and also index a…
In this paper, we are concerned with the BFV-reduction of first class constraints in classsical Hamiltonian mechanics and deformation quantization. As a result, we obtain continuous star products for certain singular reduced symplectic…
Matrix Factorization plays an important role in machine learning such as Non-negative Matrix Factorization, Principal Component Analysis, Dictionary Learning, etc. However, most of the studies aim to minimize the loss by measuring the…
We propose a methodology for studying the performance of common splitting methods through semidefinite programming. We prove tightness of the methodology and demonstrate its value by presenting two applications of it. First, we use the…
Monotone inclusions have a wide range of applications, including minimization, saddle-point, and equilibria problems. We introduce new stochastic algorithms, with or without variance reduction, to estimate a root of the expectation of…
Billey, Jockusch, and Stanley characterized 321-avoiding permutations by a property of their reduced decompositions. This paper generalizes that result with a detailed study of permutations via their reduced decompositions and the notion of…
We define a family of natural decompositions of Sturmian words in Christoffel words, called *reversible Christoffel* (RC) factorizations. They arise from the observation that two Sturmian words with the same language have (almost always)…
Stein operators are differential operators which arise within the so-called Stein's method for stochastic approximation. We propose a new mechanism for constructing such operators for arbitrary (continuous or discrete) parametric…
In a previous paper I showed how the ideal SLAC derivative and second-derivative operators for an infinite lattice can be obtained in simple closed form in position space, and implemented very efficiently in a stochastic fashion for…
I will share with the reader what I have learned from Richard Stanley and the ways in which he has contributed to research in combinatorics conducted by me and my collaborators.
The new method of multivariate data analysis based on the complements of classical probability distribution to quantum state and Schmidt decomposition is presented. We considered Schmidt formalism application to problems of statistical…
We consider positive, integral-preserving linear operators acting on $L^1$ space, known as stochastic operators or Markov operators. We show that, on finite-dimensional spaces, any stochastic operator can be approximated by a sequence of…
The partial success of the block renormalization group techniques is analysed in terms of a functional operator which formalizes the idea of self-replicability of a system in terms of smaller blocks which are similar to the original. The…
We present a self consistent method based on cluster algorithms and Renormalization Group on the lattice to study critical systems numerically. We illustrate it by means of the 2D Ising model. We compute the critical exponents $\nu$ and…
Let $i$ be a reduced expression of the longest element in the Weyl group of type $A$, which is adapted to a Dynkin quiver with a single sink. We present a simple description of the crystal embedding of Young tableaux of arbitrary shape into…
We examine the precise connection between the exact renormalisation group with local couplings and the renormalisation of correlation functions of composite operators in scale-invariant theories. A geometric description of theory space…
In this work, we explore the use of operator splitting algorithms for solving regularized structural topology optimization problems. The context is the classical structural design problems (e.g., compliance minimization and compliant…