Related papers: Complementary Algorithms For Tableaux
We present a version of the domino shuffling algorithm (due to Elkies, Kuperberg, Larsen and Propp) which works on a different lattice: the hexagonal lattice superimposed on its dual graph. We use our algorithm to count perfect matchings on…
Refined canonical stable Grothendieck polynomials were introduced by Hwang, Jang, Kim, Song, and Song. There exist two combinatorial models for these polynomials: one using hook-valued tableaux and the other using pairs of a semistandard…
The paper studies complementary choice functions, i.e. monotonic and consistent choice functions. Such choice functions were introduced and used in the work \cite{RY} for investigation of matchings with complementary contracts. Three…
We consider sets of operations on a set A that are closed under permutation of variables, addition of dummy variables and composition. We describe these closed sets in terms of a Galois connection between operations and systems of pointed…
We study the correspondence assigning the vertices of a certain quotient of the local Bruhat-Tits tree for the general linear group over a global function field, to conjugacy classes of maximal orders in some quaternion algebras. The…
We develop a general theory for Markov chains whose transition probabilities are the coefficients of descent operators on combinatorial Hopf algebras. These model the breaking-then-recombining of combinational objects. Examples include the…
We introduce a new Hopf algebra that operates on pairs of finite interval partitions and permutations of equal length. This algebra captures vincular patterns, which involve specifying both the permutation patterns and the consecutive…
Iterative algorithms are of utmost importance in decision and control. With an ever growing number of algorithms being developed, distributed, and proprietarized, there is a similarly growing need for methods that can provide classification…
A key fact about M.-P. Sch\"{u}tzenberger's (1972) promotion operator on rectangular standard Young tableaux is that iterating promotion once per entry recovers the original tableau. For tableaux with strictly increasing rows and columns,…
We define a number of new combinatorial operations on skew semistandard domino tableaux, which together with constructions introduced earlier by C. Carre and B. Leclerc, define an elegant structure on the set of these tableaux, that closely…
Numerical methods of approximate solution of the Cauchy problem for coupled systems of evolution equations are considered. Separating simpler subproblems for individual components of the solution achieves simplification of the problem at a…
We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the…
The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…
We present some general theorems about operator algebras that are algebras of functions on sets, including theories of local algebras, residually finite dimensional operator algebras and algebras that can be represented as the scalar…
This paper describes an approach to computer aided calculations in the cohomology of arithmetic groups. It complements existing literature on the topic by emphasizing homotopies and perturbation techniques, rather than cellular subdivision,…
In this paper, we propose a new and simple approach to the approximation algorithms that are modified and improved from our published results. The computational and graphical examples are presented with the aid of Maple procedures.
In this paper we describe a parallel Gaussian elimination algorithm for matrices with entries in a finite field. Unlike previous approaches, our algorithm subdivides a very large input matrix into smaller submatrices by subdividing both…
Labelled tableaux have been a traditional approach to define satisfiability checking procedures for Modal Logics. In many cases, they can also be used to obtain tight complexity bounds and lead to efficient implementations of reasoning…
Gaussian elimination with full pivoting generates a PLUQ matrix decomposition. Depending on the strategy used in the search for pivots, the permutation matrices can reveal some information about the row or the column rank profiles of the…
We generalize the Robinson-Schensted-Knuth algorithm to the insertion of two row arrays of multisets. This generalization leads to new enumerative results that have representation theoretic interpretations as decompositions of centralizer…