Related papers: Andre Permutation Calculus; a Twin Seidel Matrix S…
Under binary matrices we mean matrices whose entries take one of two values. In this paper, explicit formulae for calculating the determinant of some type of binary Toeplitz matrices are obtained. Examples of the application of the…
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…
Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…
In this paper, we carry out a fairly comprehensive study of special classes of numerical semigroups, and their tangent cones, generated by the sequence of partial sums of an arithmetic progression, in embedding dimension $5$. These classes…
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…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
Kaneko and Tsumura proved a relation of multiple $\tilde{T}$-values involving Entringer numbers counting the total number of down-up permutations starting with a fixed value. In the present paper, we generalize this relation and provide…
This paper introduces a new structure of commutative semiring, generalizing the tropical semiring, and having an arithmetic that modifies the standard tropical operations, i.e. summation and maximum. Although our framework is combinatorial,…
This article investigates integer sequences that partition the sequence into blocks of various lengths - irregular arrays. The main result of the article is explicit formulas for numbering of irregular arrays. A generalization of Cantor…
A Parity Alternating Permutation of the set $[n] = \{1, 2,\ldots, n\}$ is a permutation with even and odd entries alternatively. We deal with parity alternating permutations having an odd entry in the first position, PAPs. We study the…
We show that two tensor permutation matrices permutate tensor product of rectangle matrices. Some examples, in the particular case of tensor commutation matrices, for studying some linear matrix equations are given.
We explore the combination of deterministic and Monte Carlo methods to facilitate efficient automatic numerical computation of multidimensional integrals with singular integrands. Two adaptive algorithms are presented that employ recursion…
In this paper we study a class of dynamical systems generated by iterations of multivariate permutation polynomial systems which lead to polynomial growth of the degrees of these iterations. Using these estimates and the same techniques…
A ballot permutation is a permutation {\pi} such that in any prefix of {\pi} the descent number is not more than the ascent number. In this article, we obtained a formula in close form for the multivariate generating function of {A(n,d,j)},…
Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…
In the context of Stirling polynomials, Gessel and Stanley introduced the definition of Stirling permutation, which has attracted extensive attention over the past decades. Recently, we introduced Stirling permutation code and provided…
We extend Stanley's work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting…
The alternating (zigzag) numbers $A_n$, counting the ascending alternating permutations of $\left\{1,\cdots,n\right\}$ and defined by the exponential generating function $\tan x+\sec x$, admit several classical combinatorial and analytic…
Many combinatorial and other number triangles are solutions of recurrences of the Graham-Knuth-Patashnik (GKP) type. Such triangles and their defining recurrences are investigated analytically. They are acted on by a transformation group…
An integer sequence that is defined by initial values and a linear recurrence with constant integer coefficients, can be represented by the difference of two arithmetic terms containing exponentiation. All constants occuring in the term are…