Related papers: Refined enumerations of alternating sign triangles
We introduce the notions of alternating roots of polynomials and alternating polynomials over a Cayley-Dickson algebra, and prove a connection between the alternating roots of a given polynomial and the roots of the corresponding…
Vincular and covincular patterns are generalizations of classical patterns allowing restrictions on the indices and values of the occurrences in a permutation. In this paper we study the integer sequences arising as the enumerations of…
We investigate analogues of alternating sign matrices, called partial alternating sign matrices. We prove bijections between these matrices and several other combinatorial objects. We use an analogue of Wieland's gyration on fully-packed…
In this note we introduce a determinant and then give its evaluating formula. The determinant turns out to be a generalization of the well-known ballot and Fuss-Catalan numbers, which is believed to be new. The evaluating formula is proved…
We give a new Jacobi--Trudi-type formula for characters of finite-dimensional irreducible representations in type $C_n$ using characters of the fundamental representations and non-intersecting lattice paths. We give equivalent determinant…
Starting with the recursive extended Euclid's algorithm, we apply a systematic approach using matrix notation to transform it into an iterative algorithm. The partial correctness proof derived from the transformation turns out to be very…
In this paper, we present new objects, quilts of alternating sign matrices with respect to two given posets. Quilts generalize several commonly used concepts in mathematics. For example, the rank function on submatrices of a matrix gives…
Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions to transients.…
We establish combinatorial interpretations of several identities for the Catalan and Fine numbers and, along the way, we present some new bijections of independent interest. Briefly, we show that C_{n} = 1/(n+1) Sum_{k} (n+1)choose(2k+1)…
In this article, I provide significant mathematical evidence in support of the existence of short-time approximations of any polynomial order for the computation of density matrices of physical systems described by arbitrarily smooth and…
We show that matchings avoiding certain partial patterns are counted by the 3-Catalan numbers. We give a characterization of 12312-avoiding matchings in terms of restrictions on the corresponding oscillating tableaux. We also find a…
A bijection is given between multi-edge trees and 3-coloured Motzkin paths.
We present an algebraic framework to represent indefinite nested sums over hypergeometric expressions in difference rings. In order to accomplish this task, parts of Karr's difference field theory have been extended to a ring theory in…
We study the Schur polynomial expansion of a family of symmetric polynomials related to the refined enumeration of alternating sign matrices with respect to their inversion number, complementary inversion number and the position of the…
We describe arithmetic algorithms on a canonical number representation based on the Catalan family of combinatorial objects specified as a Haskell type class. Our algorithms work on a {\em generic} representation that we illustrate on…
We count a large class of lattice paths by using factorizations of free monoids. Besides the classical lattice paths counting problems related to Catalan numbers, we give a new approach to the problem of counting walks on the slit plane…
For a second-order linear differential equation with two irregular singular points of rank three, multiple Laplace-type contour integral solutions are considered. An explicit formula in terms of the Stokes multipliers is derived for the…
The purpose of this paper is to provide a new account of multiplicity for finite morphisms between smooth projective varieties. Traditionally, this has been defined using commutative algebra in terms of the length of integral ring…
Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the…
The Springer numbers, introduced by Arnold, are generalizations of Euler numbers in the sense of Coxeter groups. They appear as the row sums of a double triangular array $(v_{n,k})$ of integers, $1\leq|k|\leq n$, defined recursively by a…