Related papers: Towards a combinatorial classification of skew Sch…
An attempt is described to extend the notion of Schur functions from Young diagrams to plane partitions. The suggestion is to use the recursion in the partition size, which is easily generalized and deformed. This opens a possibility to…
We define a new basis of quasisymmetric functions, the row-strict dual immaculate functions, as the generating function of a particular set of tableaux. We establish that this definition gives a function that can also be obtained by…
In this work we construct the model of a skew--selfadjoint operator with a simple spectrum acting on a Hilbert quaternion bimodule. This result is based on the Spectral Theorem for a skew--selfadjoint operator.
In our joint paper with W. Fulton (math.AG/9804041) we prove a formula for the cohomology class of a quiver variety. This formula is general enough to give new expressions for all known types of Schubert polynomials. In the present paper we…
In this paper, we study Grothendieck polynomials from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials, analogues of the factorial Schur functions and present some of their properties, and use them to produce a…
The noncommutative projective scheme $\operatorname{\mathsf{Proj_{nc}}} S$ of a $(\pm 1)$-skew polynomial algebra $S$ in $n$ variables is considered to be a $(\pm 1)$-skew projective space of dimension $n-1$. In this paper, using…
We present some thoughts on the relation between symmetric Schur-class functions on the bidisk and Schur-class functions on the symmetrized bidisk. Among other things, use of this relation leads to a finite dimensional realization result…
We find closed-form expressions for the Schur indices of 4d $\mathcal{N}=2^{*}$ super Yang-Mills theory with unitary gauge groups for arbitrary ranks via the Fermi-gas formulation. They can be written as a sum over the Young diagrams…
Classical spectral theory provides powerful tools for analyzing linear operators, but does not extend naturally to nonlinear or compositional settings. In particular, there is no general way to transport spectral invariants in a functorial…
While equality of skew Schur functions is well understood, the problem of determining when two skew Schur $Q$ functions are equal is still largely open. It has been studied in the case of ribbon shapes in 2008 by Barekat and van…
An identity is derived expressing Schur functions as sums over products of pairs of Schur $Q$-functions, generalizing previously known special cases. This is shown to follow from their representations as vacuum expectation values (VEV's) of…
Using symmetric function theory, we study the cycle structure and increasing subsequence structure of permutations after various shuffling methods, emphasizing the role of Cauchy type identities and the Robinson-Schensted-Knuth…
The plethysm product of Schur functions corresponds to composing polynomial representations of infinite general linear groups. Finding the plethysm coefficients $\langle s_\nu \circ s_\mu, s_\lambda\rangle$ that express an arbitrary…
We provide a classification of eventually periodic subshifts up to conjugacy and flow equivalence. We use our results to prove that each skew Sturmian subshift is conjugate to exactly one other skew Sturmian subshift and that all skew…
We exhibit a weight-preserving bijection between semi-standard Young tableaux and semi-skyline augmented fillings to provide a combinatorial proof that the Schur functions decompose into nonsymmetric functions indexed by compositions. The…
The product of any finite number of factorial Schur functions can be expanded as a $Z[y]$-linear combination of Schur functions. We give a rule for computing the coefficients in such an expansion which generalizes a specialization of the…
We present a construction of skew monoidal structures from strong actions. We prove that the existence of a certain adjoint allows one to equip the actegory with a skew monoidal structure and that this adjunction becomes monoidal. This…
We present a combinatorial method of constructing solutions to the normal ordering of boson operators. Generalizations of standard combinatorial notions - the Stirling and Bell numbers, Bell polynomials and Dobinski relations - lead to…
Subtraction-free computational complexity is the version of arithmetic circuit complexity that allows only three operations: addition, multiplication, and division. We use cluster transformations to design efficient subtraction-free…
A Redheffer type description of the set of all contractive solutions to the relaxed commutant lifting problem is given. The description involves a set of Schur class functions which is obtained by combining the method of isometric coupling…