Related papers: A Little bijection for affine Stanley symmetric fu…
We give a generalisation of the Lenstra-Lenstra-Lov\'asz (LLL) lattice-reduction algorithm that is valid for an arbitrary (split, semisimple) reductive group $G$. This can be regarded as `lattice reduction with symmetries'. We make this…
Lie symmetry analysis is an established method for generating symmetries of differential equations. We apply this method together the generalized fundamental theorem of double reduction. In particular, Noether symmetries and some associated…
We study a linear map on symmetric functions that ``divides'' a partition by a positive integer $k$, sending a Schur function indexed by a partition of $kn$ to a symmetric function indexed by partitions of $n$. We determine its Schur…
We give a Littlewood-Richardson type rule for expanding the product of a row-strict quasisymmetric Schur function and a symmetric Schur function in terms of row-strict quasisymmetric Schur functions. This expansion follows from several new…
We present a single operation for constructing skew diagrams whose corresponding skew Schur functions are equal. This combinatorial operation naturally generalises and unifies all results of this type to date. Moreover, our operation…
The connection between the generating functions of various sets of tableaux and the appropriate families of quasisymmetric functions is a significant tool to give a direct analytical proof of some advanced bijective results and provide new…
In this paper we propose a new approach to least squares approximation problems. This approach is based on partitioning and Schur function. The nature of this approach is combinatorial, while most existing approaches are based on algebra…
We prove that the well-known condition of being a balanced labeling can be characterized in terms of the sliding algorithm on tower diagrams. The characterization involves a generalization of authors' Rothification algorithm. Using the…
Stanley symmetric functions are the stable limits of Schubert polynomials. In this paper, we show that, conversely, Schubert polynomials are Demazure truncations of Stanley symmetric functions. This parallels the relationship between Schur…
We revisit the R\'{e}dei-Berge symmetric function $\mathcal{U}_D$ for digraphs $D$, a specialization of Chow's path-cycle symmetric function. Through the lens of matrix algebra, we consolidate and expand on the work of Chow, Grinberg and…
Stanley and F\'eray gave a formula for the irreducible character of the symmetric group related to a multi-rectangular Young diagram. This formula shows that the character is a polynomial in the multi-rectangular coordinates and gives an…
A new combinatorial approach to the ribbon tableaux generating functions and q-Littlewood Richardson coefficients of Lascoux, Leclerc and Thibon is suggested. We define operators which add ribbons to partitions and following Fomin and…
Motivated by Stanley's conjecture on the multiplication of Jack symmetric functions, we prove a couple of identities showing that skew Jack symmetric functions are semi-invariant up to translation and rotation of a $\pi$ angle of the skew…
We propose a $\Gamma$-convergent discrete approximation of the Mumford-Shah functional. The discrete functionals act on functions defined on stationary stochastic lattices and take into account general finite differences through a…
We study the partition function of the compactified 5D U(1) gauge theory (in the Omega-background) with a single adjoint hypermultiplet, calculated using the refined topological vertex. We show that this partition function is an example a…
Lam, Lee, and Shimozono introduced the double Stanley symmetric functions in their study of the equivariant geometry of the affine Grassmannian. They proved that the associated double Edelman--Greene coefficients, the double Schur expansion…
We use Knuth's combinatorial approach to Pfaffians to reprove and clarify a century-old formula, due to Brill. It expresses arbitrary minors of a skew symmetric matrix in terms of Pfaffians.
Classical results show that gradient descent converges linearly to minimizers of smooth strongly convex functions. A natural question is whether there exists a locally nearly linearly convergent method for nonsmooth functions with quadratic…
As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we…
By considering the parity of the degrees and levels of nodes in increasing trees, a new combinatorial interpretation for the coefficients of the Taylor expansions of the Jacobi elliptic functions is found. As one application of this new…