The Schubert polynomials lift the Schur basis of symmetric polynomials into a basis for Z[x1, x2, . . .]. We suggest the prism tableau model for these polynomials. A novel aspect of this alternative to earlier results is that it directly invokes semistandard tableaux; it does so as part of a colored tableau amalgam. In the Grassmannian case, a prism tableau with colors ignored is a semistandard...

Factorization of linear programming (LP) models enables a large portion of the LP tableau to be represented implicitly and generatedfrom the remainingexplicit part. Dynamicfactorization admits algebraicelementswhichchangeindimensionduring the courseof solution.A unifyingmathematical framework for dynamic row factorization is presented with three algorithms which derive from differentLP modelrow...

We give a new combinatorial interpretation of Howe dual pairs the form $(\g,{\rm Sp}_{2\ell})$, where $\g$ is Lie (super)algebra classical type. This done by establishing symplectic analogue RSK algorithm associated to this pair, in uniform way which does not depend on $\g$. introduce an jeu de taquin sliding for spinor model irreducible characters superalgebra define $P$-tableau and show that ...

For an integer linear program, Gomory’s corner relaxation is obtained by ignoring the nonnegativity of the basic variables in a tableau formulation. In this paper, we do not relax these nonnegativity constraints. We generalize a classical result of Gomory and Johnson characterizing minimal cut-generating functions in terms of subadditivity, symmetry, and periodicity. Our result is based on a ne...

In this paper we study formal tools for the definition of tableaux systems for modal logics. We begin by some preliminaries about graphs. Then we present graph rewriting rules together with control constructs for defining strategies of application of these rules. We establish fair strategies that are sound, complete and terminating. These results cover almost all basic modal logics such as K, T...

We find a general expression for the free energy of G(φ) = φ2k generalized 2D YangMills theories in the strong (A > Ac) region at large N . We also show that in this region, the density function of Young tableau of these models is a three-cut problem. In the specific φ6 model, we show that the theory has a third order phase transition, like φ2 (YM2) and φ 4 models. We have some comments for k ≥...

For both classical and nonclassical first–order logic equality is a crucial feature to increase expressivity of the object language. It is, therefore, of great importance to have a method at hand that allows tableau–based theorem provers to handle equality in an efficient way. In the first approaches to adding equality to semantic tableaux [8, 10, 11] additional tableau rules were defined that ...

Research on the aesthetic layout of trees has been largely concerned with the special case of binary trees with small constant-sized nodes. Yet, without otherwise requiring the power of general graph-layout algorithms, many layout problems involve n-ary trees with variable-sized nodes. This paper addresses the general issue of the aesthetic layout of such trees. Two algorithms are presented for...

In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux. We exhibit an elementary insertion procedure on our tableaux which gives a clear proof that tree-like tableaux of size n are counted by n!, and which moreover respects most of the well-known statistics studied originally o...