相关论文: Poly-Bernoulli numbers and lonesum matrices

Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…

Let $$ S_{m,n}(q):=\sum_{k=1}^{n}\frac{1-q^{2k}}{1-q^2} (\frac{1-q^k}{1-q})^{m-1}q^{\frac{m+1}{2}(n-k)}. $$ Generalizing the formulas of Warnaar and Schlosser, we prove that there exist polynomials $P_{m,k}(q)\in\mathbb{Z}[q]$ such that $$…

Let $m$, $r$ and $n$ be positive integers. We denote by ${\bf k}\vdash n$ any tuple of odd positive integers ${\bf k}=(k_1,\dots,k_t)$ such that $k_1+\dots+k_t=n$ and $k_j\ge 3$ for all $j$. In this paper we prove that for every…

We conjecture that the structure of Bernoulli numbers can be explicitly given in the closed form $$ B_n = (-1)^{\frac{n}{2}-1} \prod_{p-1 \nmid n} |n|_p^{-1} \prod\limits_{(p,l)\in\Psi^{\rm irr}_1 \atop n \equiv l \mods{p-1}} |p…

The permanent of a square matrix is defined in a way similar to the determinant, but without using signs. The exact computation of the permanent is hard, but there are Monte-Carlo algorithms that can estimate general permanents. Given a…

Let $n$ be a large integer and $M_n$ be a random $n$ by $n$ matrix whose entries are i.i.d. Bernoulli random variables (each entry is $\pm 1$ with probability 1/2). We show that the probability that $M_n$ is singular is at most $(3/4…

Sum rules are elegant formulas that relate entropy functionals to coefficients associated with orthogonal polynomials [Sim11]. In a series of paper (see for example [GNR16], [GNR17], [BSZ18a], [BSZ18b]), interesting connections have been…

We present new proofs and generalizations of unimodality of the q-binomial coefficients \binom{n}{k}_q as polynomials in q. We use an algebraic approach by interpreting the differences between numbers of certain partitions as Kronecker…

This is a collection of definitions, notations and proofs for the Bernoulli numbers $B_n$ appearing in formulas for the sum of integer powers, some of which can be found scattered in the large related historical literature in French,…

We generalize the notion of a de Bruijn sequence to a "multi de Bruijn sequence": a cyclic or linear sequence that contains every k-mer over an alphabet of size q exactly m times. For example, over the binary alphabet {0,1}, the cyclic…

We construct a $k$-fold $q$-series as a generating function of $k$-regular partitions for each positive integer $k$. The $k=1$ case is one of Euler's $q$-series identities pertaining to the partitions into distinct parts. The construction…

We show that if $A$ is an $n\times n$-matrix, then the diagonal entries of each power $A^{m}$ are uniquely determined by the principal minors of $A$, and can be written as universal (integral) polynomials in the latter. Furthermore, if the…

In this paper, we construct four binary linear codes closely connected with certain exponential sums over the finite field F_q and F_q-{0,1}. Here q is a power of two. Then we obtain four recursive formulas for the power moments of…

Rowland found a matrix product formula for generating functions counting binomial coefficients by their $p$-adic valuations. A natural generalization of binomial coefficients was introduced by Knuth and Wilf defined by a sequence $C$. We…

The Boolean product $R = P \cdot Q$ of two $\{ 0, 1\} \; m \times m \; $ matrices is $$R(j,k) = 1 \; \mathrm{\ IF\ for\ some\ } \; t \; \,P(j, t) = Q(t, k) = 1\; \; \mathrm{ELSE\ } \, R(j, k) = 0. $$ The near-optimal design reduces the…

Recently O. Pechenik studied the cyclic sieving of increasing tableaux of shape $2\times n$, and obtained a polynomial on the major index of these tableaux, which is a $q$-analogue of refined small Schr\"{o}der numbers. We define…

For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…

Recently, Komastu introduced the concept of poly-Cauchy numbers and polynomials which generalize Cauchy numbers and polynomials. In this paper, we introduce new generaliza- tion of poly-Cauchy and poly-Bernoulli numbers and polynomials.…

Fischer provided a new type of binomial determinant for the number of alternating sign matrices involving the third root of unity. In this paper we prove that her formula, when replacing the third root of unity by an indeterminate $q$, is…

If L, respectively R are matrices with entries binom{i-1,j-1}, respectively binom{i-1,n-j}, it is known that L^2 = I (mod 2), respectively R^3 = I (mod 2), where I is the identity matrix of dimension n > 1 (see P10735-May 1999 issue of the…