Related papers: 3-enumerated alternating sign matrices

Let R(n,k) be the number of permutations of $\{1,2,\ldots,n\}$ with k alternating runs. In this paper, we establish the relationships between R(n,k) and the central factorial numbers of even indices as well as the number of signed…

Recently, Babson and Steingrimsson (see [BS]) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We study generating functions for the number…

The Matrix Waring problem is if we can write every matrix as a sum of $k$-th powers. Here, we look at the same problem for triangular matrix algebra $T_n(\mathbb{F}_q)$ consisting of upper triangular matrices over a finite field. We prove…

Some rapidly convergent formulae for special values of the Riemann zeta function are given. We obtain a generating function formula for zeta(4n+3) which generalizes Apery's series for zeta(3), and appears to give the best possible series…

We study generating functions for Lusztig's $t$-analog of weight multiplicities associated to integrable highest weight representations of the simplest affine Lie algebra $A_1^{(1)}$. At $t=1$, these reduce to the {\em string functions} of…

The 1-2-3 Conjecture, posed by Karo\'{n}ski, {\L}uczak and Thomason, asked whether every connected graph $G$ different from $K_2$ can be 3-edge-weighted so that every two adjacent vertices of $G$ get distinct sums of incident weights. The…

We introduce the notion of a pre-sequence of matrix orthogonal polynomials to mean a sequence {F_n} of matrix orthogonal functions with respect to a weight function W, satisfying a three term recursion relation and such that det(F_0) is not…

It was shown by Kuperberg that the partition function of the square-ice model related to the quarter-turn symmetric alternating-sign matrices of even order is the product of two similar factors. We propose a square-ice model whose states…

Let (t_n) be the classical Thue-Morse sequence defined by t_n = s_2(n) (mod 2), where s_2 is the sum of the bits in the binary representation of n. It is well known that for any integer k>=1 the frequency of the letter "1" in the…

We introduce patterns on a triangular grid generated by paperfolding operations. We show that in case these patterns are defined using a periodic sequence of foldings, they can also be generated using substitution rules and compute…

We define a higher spin alternating sign matrix to be an integer-entry square matrix in which, for a nonnegative integer r, all complete row and column sums are r, and all partial row and column sums extending from each end of the row or…

Let G=SL(2,C) and F_r be a rank r free group. Given an admissible weight in N^{3r-3}, there exists a class function defined on Hom(F_r,G) called a central function. We show that these functions admit a combinatorial description in terms of…

For any given set $A$ of nonnegative integers and for any given two positive integers $k_1,k_2$, $R_{k_1,k_2}(A,n)$ is defined as the number of solutions of the equation $n=k_1a_1+k_2a_2$ with $a_1,a_2\in A$. In this paper, we prove that if…

Let R be a unital commutative ring and let $M$ be an $R$-module that is generated by $k$ elements but not less. Let $E_n(R)$ be the subgroup of $GL_n(R)$ generated by the elementary matrices. In this paper we study the action of $E_n(R)$ by…

A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…

Denote by $R(G_1, G_2, G_3)$ the minimum integer $N$ such that any three-colouring of the edges of the complete graph on $N$ vertices contains a monochromatic copy of a graph $G_i$ coloured with colour $i$ for some $i\in{1,2,3}$. In a…

The Tribonacci sequence is a well-known example of third order recurrence sequence, which belongs to a particular class of recursive sequences. In this article, other generalized Tribonacci sequence is introduced and defined by…

Let $G$ be a multiplicative subsemigroup of the general linear group $\Gl(\mathbb{R}^d)$ which consists of matrices with positive entries such that every column and every row contains a strictly positive element. Given a $G$--valued random…

A permutation graph is a graph that can be derived from a permutation, where the vertices correspond to letters of the permutation, and the edges represent inversions. We provide a construction to show that there are infinitely many…

We study pattern avoidance by combinatorial objects other than permutations, namely by ordered partitions of an integer and by permutations of a multiset. In the former case we determine the generating function explicitly, for integer…