Related papers: Poly-Bernoulli numbers and lonesum matrices
Given some binary matrix $M$, suppose we are presented with the collection of its rows and columns in independent arbitrary orderings. From this information, are we able to recover the unique original orderings and matrix? We present an…
Abstract. We generalize the $b$-ary binomial coefficients with negative entries, which is based on the generating function obtained in early work. Besides an explicit expression involving the restricted partition, several properties such as…
As is well-known, poly-Bernoulli polynomials are defined in terms of polylogarithm functions. Recently, as degenerate version of such functions and polynomials, degenerate polylogarithm functions were introduced and degenertae…
Given two infinite sequences with known binomial transforms, we compute the binomial transform of the product sequence. Various identities are obtained and numerous examples are given involving sequences of special numbers: Harmonic…
A notion of quantum matrix (QM-) algebra generalizes and unifies two famous families of algebras from the theory of quantum groups: the RTT-algebras and the reflection equation (RE-) algebras. These algebras being generated by the…
Chebyshev polynomials and their modifications are attributes of various fields of mathematics. In particular, they are generating functions of the rows elements of certain Riordan matrices. In paper, we give a selection of some…
The multigraded Poincare-Betti series P_R^k(x_1,...,x_n; t) of a monomial ring k[x_1,...,x_n]/<M> on a finite number of monomial generators has the form (1+tx_1)(1+tx_2)...(1+tx_n)/b_(R,k)(x_1,...,x_n; t), where b_(R,k)(x_1,...,x_n;t) is a…
We consider a $(q,y)$-analogue of Laguerre polynomials $L^{(\alpha)}_n(x;y;q)$ for integral $\alpha\geq -1$, which turns out to be a rescaled version of Al-Salam--Chihara polynomials. A combinatorial interpretation for the $(q,y)$-Laguerre…
Motivated by polymer-based data-storage platforms that use chains of binary synthetic polymers as the recording media and read the content via tandem mass spectrometers, we propose a new family of codes that allows for both unique string…
We study a new class of polyominoes, called $p$-Fibonacci polyominoes, defined using $p$-Fibonacci words. We enumerate these polyominoes by applying generating functions to capture geometric parameters such as area, semi-perimeter, and the…
Consider the set $\mathcal{K}$ of integers $k$ for which there are infinitely many primes $p$ such that $p+k$ is a power of $2$. The aim of this paper is to show a relationship between $\mathcal{K}$ and the limits points of some set…
Let $\mathcal{Q}$ be a quaternion division algebra over a field, and $n \geq 2$ be an integer. In a recent article, de La Cruz et al have proved that every $n$-by-$n$ matrix with entries in $\mathcal{Q}$ and pure quaternionic trace is the…
We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…
Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…
In this paper, we bring into light the matrix representation of bi-periodic Jacobsthal sequence, which we shall call the bi-periodic Jacobsthal Matrix sequence.. We obtained the nth general term of this new matrix sequence. By studying the…
In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…
We study the modular resolution method using new tools called polynumbers and polyseries, introduced by Prof. Wildberger N.J. We try to prove an equivalence theorem of the existence and the uniqueness of the solutions of the modular…
A simple matrix formulation of the Fibonacci, Lucas, Chebyshev, and Dixon polynomials polynomials is presented. It utilizes the powers and the symmetric tensor powers of a certain matrix.
For a prime $p$ and a positive integer $s$ consider a homogeneous linear system over the ring $\mathbb{Z}_{p^s}$ (the ring of integers modulo $p^s$) described by an $n \times m$-matrix. The possible number of solutions to such a system is…
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…