Related papers: The Pascal Rhombus and the Generalized Grand Motzk…
Suppose A and B are unital C*-algebras and A is separable. Let Rep(A,B) denote the set of all unital *-homomorphisms from A to B with the topology of pointwise convergence. We consider the problem of when the closure of the unitary orbit of…
In this paper, certain mixed special polynomial families associated with Appell sequences are introduced and their properties are established. Further, operational rules providing connections between these families and the known special…
The Poitou-Tate sequence relates Galois cohomology with restricted ramification of a finite Galois module $M$ over a global field to that of the dual module under the assumption that $\#M$ is a unit away from the allowed ramification set.…
For a composition $\lambda$ of $n$ we consider the Kazhdan-Lusztig cell in the symmetric group $S_n$ containing the longest element of the standard parabolic subgroup of $S_n$ associated to $\lambda$. In this paper we extend some of the…
We introduce a new infinite family of arrays, the \emph{Pascal determinantal arrays} of order $k$, denoted $PD_k$, which generalize the classical Pascal array via determinantal constructions. We present a recursive algorithm for generating…
A {\em Motzkin path} of length $n$ is a lattice path from $(0,0)$ to $(n,0)$ in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of horizontal-steps $(1, 0)$, up-steps $(1,1)$, and down-steps $(1,-1)$, which never passes…
In this article we give a combinatorial formula for a certain class of Koornwinder polynomials, also known as Macdonald polynomials of type $\tilde{C}$. In particular, we give a combinatorial formula for the Koornwinder polynomials…
In this paper we introduce a notion of {\it generalized operad} containing as special cases various kinds of operad--like objects: ordinary, cyclic, modular, properads etc. We then construct inner cohomomorphism objects in their categories…
The paper addresses linear hyperbolic systems in one space dimension with random field coefficients. In many applications, a low degree of regularity of the paths of the coefficients is required, which is not covered by classical stochastic…
We initiate the study of a type $C_n$ generalization of the lattice path matroids defined by Bonin, de Mier, and Noy. These are delta matroids whose feasible sets are in bijection with lattice paths which are symmetric along the main…
In this work we deal with a symbolic approach to the general quadratic polynomial decomposition. By means of a symbolic implementation, we investigate some properties of the components sequences like orthogonality and symmetry. We present…
Consideration of a question of E. R. Berlekamp led Carlitz, Roselle, and Scoville to give a combinatorial interpretation of the entries of certain matrices of determinant~1 in terms of lattice paths. Here we generalize this result by…
This paper investigates the extension complexity of polytopes by exploiting the correspondence between non-negative factorizations of slack matrices and randomized communication protocols. We introduce a geometric characterization of…
The generating function and an explicit expression is derived for the (colored) Motzkin numbers of higher rank introduced recently. Considering the special case of rank one yields the corresponding results for the conventional colored…
In this paper, we provide a methodology for computing the probability distribution of sojourn times for a wide class of Markov chains. Our methodology consists in writing out linear systems and matrix equations for generating functions…
We give several bijections among restricted Motzkin paths, explaining why various parameters on these paths are equidistributed. For example, the number of doublerise-free Motzkin paths of length n is the same as the number of peak-free…
We introduce a method for describing Riordan matrices via recurrence relations along their diagonals. This provides a new structural description that complements the classical row-wise and column-wise constructions via the A-sequence. As an…
We say that a permutation $\pi$ is a Motzkin permutation if it avoids 132 and there do not exist $a<b$ such that $\pi_a<\pi_b<\pi_{b+1}$. We study the distribution of several statistics in Motzkin permutations, including the length of the…
This note is a survey and collection of results, as well as presenting some original research. For Bessel sequences and frames, the analysis, synthesis and frame operators as well as the Gram matrix are well-known, bounded operators. We…
We obtain an exact finite-size expression for the probability that a percolation hull will touch the boundary, on a strip of finite width. Our calculation is based on the q-deformed Knizhnik--Zamolodchikov approach, and the results are…