Related papers: Prism tableaux for alternating sign matrix varieti…
A Newton-Okounkov polytope of a complete flag variety can be turned into a convex geometric model for Schubert calculus. Namely, we can represent Schubert cycles by linear combinations of faces of the polytope so that the intersection…
Weierstrass representation is a classical parameterization of minimal surfaces. However, two functions should be specified to construct the parametric form in Weierestrass representation. In this paper, we propose an explicit parametric…
The polynomial ring $B$ in infinitely many indeterminates $(x_1,x_2,\ldots)$, with rational coefficients, has a vector space basis of Schur polynomials, parametrized by partitions. The goal of this note is to provide an explanation of the…
In this paper we study a relatively new combinatorial object called staircase tableaux. Staircase tableaux were introduced by Corteel and Williams in the connection with Asymmetric Exclusion Process and has since found interesting…
A new class of univariate stationary interpolatory subdivision schemes of dual type is presented. As opposed to classical primal interpolatory schemes, these new schemes have masks with an even number of elements and are not step-wise…
Inspired by the classic apolarity theory of symmetric tensors, the aim of this paper is to introduce the Schur apolarity theory, i.e. an apolarity for any irreducible representation of the special linear group $SL(V)$. This allows to…
For a polynomial ring over a commutative ring of positive characteristic, we define on the associated de Rham-Witt complex a set of functions, and show that they are pseudovaluations in the sense of Davis, Langer and Zink. To achieve it, we…
We give a short and elementary proof of a theorem of Procesi, Schacher and (independently) Gondard, Ribenboim that generalizes a famous result of Artin. Let $A$ be an $n \times n$ symmetric matrix with entries in the polynomial ring…
By unifying various earlier extensions of alternating sign matrices (ASMs), we introduce the notion of prefix-bounded matrices (PBMs). It is shown that the convex hull of these matrices forms the intersection of two special generalized…
Like the LR-tableau, a socle tableau is given as a skew diagram with certain entries. Unlike in the LR-tableau, the entries in the socle tableau are weakly increasing in each row, strictly increasing in each column and satisfy a modified…
Let $\Lambda$ be the space of symmetric functions and $V_k$ be the subspace spanned by the modified Schur functions $\{S_\lambda[X/(1-t)]\}_{\lambda_1\leq k}$. We introduce a new family of symmetric polynomials,…
A recursive algebraic method which allows to obtain the Feynman or Schwinger parametric representation of a generic L-loops and (E+1) external lines diagram, in a scalar $\phi ^{3}\oplus \phi ^{4}$ theory, is presented. The representation…
We give a combinatorial interpretation of the determinant of a matrix as a generating function over Brauer diagrams in two different but related ways. The sign of a permutation associated to its number of inversions in the Leibniz formula…
Left-right and conjugation actions on matrix tuples have received considerable attention in theoretical computer science due to their connections with polynomial identity testing, group isomorphism, and tensor isomorphism. In this paper, we…
We use the Pieri and Giambelli formulas of arXiv:0809.4966 and arXiv:1109.6669 and the calculus of raising operators developed in arXiv:0811.2781 and arXiv:0812.0639 to prove a tableau formula for eta polynomials of arXiv:1109.6669 and the…
Many algorithms for inserting elements into tableaux are known, starting with the Robinson-Schensted algorithm. Much of those processes can be incorporated into the general framework of Fomin's "growth diagrams". Even for single types of…
We give an extension of the classical Schensted correspondence to the case of ribbon tableaux, where ribbons are allowed to be of different sizes. This is done by extending Fomin's growth diagram approach of the classical correspondence…
A new version of Farkas lemma of alternative linear systems is proposed. One and the same matrix $A$ and vector $b$ have always been used in alternative linear systems. The paper shows a different way of alternative systems involving…
In this paper we introduce an algebraic recursive multilevel incomplete factorization preconditioner, based on a distributed Schur complement formulation, for solving general linear systems. The novelty of the proposed method is to combine…
A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…