Related papers: Poly-Bernoulli numbers and lonesum matrices
A binary matrix can be scanned by moving a fixed rectangular window (submatrix) across it, rather like examining it closely under a microscope. With each viewing, a convenient measurement is the number of 1s visible in the window, which…
We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…
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…
For each $n$, let $M_n$ be an $n\times n$ random matrix with independent $\pm 1$ entries. We show that ${\mathbb P}\{\mbox{$M_n$ is singular}\}=(1/2+o_n(1))^n$, which settles an old problem. Some generalizations are considered.
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…
In this paper, we consider the degenerate multi-poly-Bernoulli numbers and polynomials which are defined by means of the multiple polylogarithms and degenerate versions of the multi-poly-Bernoulli numbers and polynomials. We investigate…
As properties of poly-Bernoulli numbers, a number of formulas such as the duality formula, explicit formula using the Stirling numbers of the second kind and periodicity for negative upper-index have been established. For the multi-indexed…
Polytope numbers for a given polytope are an integer sequence defined by the combinatorics of the polytope. Recent work by H. K. Kim and J. Y. Lee has focused on writing polytope number sequences as sums of simplex number sequences. We…
Let $\{B_n\}$, $\{B_n(x)\}$ and $\{E_n(x)\}$ be the Bernoulli numbers, Bernoulli polynomials and Euler polynomials, respectively. In this paper we mainly establish formulas for $\sum_{6\mid k-3}\binom nkB_{n-k}(x)$, $\sum_{6\mid k}\binom…
An overlooked formula of E. Lucas for the generalized Bernoulli numbers is proved using generating functions. This is then used to provide a new proof and a new form of a sum involving classical Bernoulli numbers studied by K. Dilcher. The…
We prove certain identities involving Euler and Bernoulli polynomials that can be treated as recurrences. We use these and also other known identities to indicate connection of Euler and Bernoulli numbers with entries of inverses of certain…
We define the Bernoulli polynomials with a $q$ parameter in terms of $r$-Whitney numbers of the second kind. Some algebraic properties and combinatorial identities of these polynomials are given. Also, we obtain several relations between…
In this paper, we introduce a new class of polynomials, called probabilistic q-Bernstein polynomials, alongside their generating function. Assuming Y is a random variable satisfying moment conditions, we use the generating function of these…
We give a formula for a $q$-analogue of Boyadzhiev-Mneimneh-type binomial sums of finite multi-polylogarithms. In the limit as $q\to 1$, this formula reduces to an identity equivalent to the Sakugawa-Seki identities. We also give a formula…
A sequence inverse relationship can be defined by a pair of infinite inverse matrices. If the pair of matrices are the same, they define a dual relationship. Here presented is a unified approach to construct dual relationships via…
The present paper deals with the discrete inverse problem of reconstructing binary matrices from their row and column sums under additional constraints on the number and pattern of entries in specified minors. While the classical…
A novel multinomial theorem for commutative idempotents is shown to lead to new results about the moments, central moments, factorial moments, and their generating functions for any random variable $X = \sum_{i} Y_i $ expressible as a sum…
In 1982, Tamaki Yano proposed a conjecture predicting the set of b-exponents of an irreducible plane curve singularity germ which is generic in its equisingularity class. In \cite{ACLM-Yano2} we proved the conjecture for the case in which…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…