Related papers: A note on number triangles that are almost their o…
This is the second paper of the paper series on multiple Riordan arrays. In this paper, based on the study of multiple Riordan arrays and the multiple Riordan group, we define multiple almost-Riordan arrays and find that the set of all…
This paper introduces the concept of a generating set for stochastic matrices -- a subset of matrices whose repeated composition generates the entire set. Understanding such generating sets requires specifying the "indivisible elements" and…
In this paper, we define the bi-periodic Fibonacci matrix sequence that represent bi-periodic Fibonacci numbers. Then, we investigate generating function, Binet formula and summations of bi-periodic Fibonacci matrix sequence. After that, we…
We study compositions whose parts are colored by subsequences of the Fibonacci numbers. We give explicit bijections between Fibonacci colored compositions and several combinatorial objects, including certain restricted ternary and…
Constellations are partial algebras that are one-sided generalisations of categories. It has previously been shown that the category of inductive constellations is isomorphic to the category of left restriction semigroups. Here we consider…
In this paper, we construct new families of convolutional codes. Such codes are obtained by means of algebraic geometry codes. Additionally, more families of convolutional codes are constructed by means of puncturing, extending, expanding…
Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…
Borel's triangle is an array of integers closely related to the classical Catalan numbers. In this paper we study combinatorial statistics counted by Borel's triangle. We present various combinatorial interpretations of Borel's triangle in…
In this paper, we count acyclic and strongly connected uniform directed labeled hypergraphs. For these combinatorial structures, we introduce a specific generating function allowing us to recover and generalize some results on the number of…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…
Various families of octonion number sequences (such as Fibonacci octonion, Pell octonion and Jacobsthal octonion) have been established by a number of authors in many different ways. In addition, formulas and identities involving these…
A new construction of codes from old ones is considered, it is an extension of the matrix-product construction. Several linear codes that improve the parameters of the known ones are presented.
Ordinary binary multiplication of natural numbers can be generalized in a non-trivial way to a ternary operation by considering discrete volumes of lattice hexagons. With this operation, a natural notion of `3-primality' -- primality with…
Recently, sub-indices and sub-factors of groups with connections to number theory, additive combinatorics, and factorization of groups have been introduced and studied. Since all group subsets are considered in the theory and there are many…
The main goal in this manuscript is to present a class of functions satisfying a certain orthogonality property for which there also exists a three term recurrence formula. This class of functions, which can be considered as an extension to…
This paper derives sparse recurrence relations between orthogonal polynomials on a triangle and their partial derivatives, which are analogous to recurrence relations for Jacobi polynomials. We derive these recurrences in a systematic…
In this paper we obtained several properties that the characteristic polynomials of the unit-primitive matrix satisfy. In addition, using these properties we have shown that the recurrence relation given as in the formula (1) is true. In…
Tree-child networks are a recently-described class of directed acyclic graphs that have risen to prominence in phylogenetics (the study of evolutionary trees and networks). Although these networks have a number of attractive mathematical…
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…