Related papers: A combinatorial determinant

Combinatorial interpretation of the fibonomial coefficients as a number of choices of specific finite subsets of an infinite partially ordered set of not binomial type is proposed. This partially ordered set is here defined via…

We present a simple and accessible method which uses contour integration methods to derive formulae for functional determinants. To make the presentation as clear as possible, the general idea is first illustrated on the simplest case: a…

Let $r > 0$ be an integer, let $\mathbb{F}_q$ be a finite field of $q$ elements, and let $\mathcal{A}$ be a nonempty proper subset of $\mathbb{F}_q$. Moreover, let $\mathbf{M}$ be a random $m \times n$ rank-$r$ matrix over $\mathbb{F}_q$…

This paper gives a complete proof of a theorem of de Bruijn that classifies additive systems for the nonnegative integers, that is, families $\mca = (A_i)_{i\in I}$ of sets of nonnegative integers, each set containing 0, such that every…

We investigate properties of families $F$ of subsets of a finite set in a situation where subsets are incomparable by the binary inclusion relation and a) for any $A\notin F$, there is such set $A'\in F$ that either $A\subset A'$ or…

Let $M$ be an arbitrary matroid with circuits $\mathcal{C}(M)$. We propose a definition of a derived matroid $\delta M$ that has as its ground set $\mathcal{C}(M)$. Unlike previous attempts of such a definition, our definition applies to…

Based on a less-known result, we prove a recent conjecture concerning the determinant of a certain Sylvester-Kac type matrix and consider an extension of it.

Determinants and symmetric functions of the eigenvalues of matrices characterizing stochastic processes with indepedent increments. Relationships with Fibonacci numbers are derived.

We prove fibration theorems \`a la Milnor for differentiable real maps with non isolated critical values. We study the situation for maps with linear discriminant, and prove that the concept of d-regularity is the key point for the…

The unification problem in a propositional logic is to determine, given a formula F, whether there exists a substitution s such that s(F) is in that logic. In that case, s is a unifier of F. When a unifiable formula has minimal complete…

Let $A$ be an $n \times n$ random matrix with iid entries over a finite field of order $q$. Suppose that the entries do not take values in any additive coset of the field with probability greater than $1 - \alpha$ for some fixed $0 < \alpha…

We are concerned with the general problem of proving the existence of joint distributions of two discrete random variables $M$ and $N$ subject to infinitely many constraints of the form $\mathbb{P}\left(M=i,N=j\right)=0$. In particular, the…

In this paper we use a formula for the $n$-th power of a $2\times2$ matrix $A$ (in terms of the entries in $A$) to derive various combinatorial identities. Three examples of our results follow. 1) We show that if $m$ and $n$ are positive…

Let $M$ be an $mn\times mn$ matrix over a commutative ring $R$. Divide $M$ into $m \times m$ blocks. Assume that the blocks commute pairwise. Consider the following two procedures: (1) Evaluate the $n \times n$ determinant formula at these…

We prove two inequalities regarding the ratio $\det(A+D)/\det A$ of the determinant of a positive-definite matrix $A$ and the determinant of its perturbation $A+D$. In the first problem, we study the perturbations that happen when positive…

We describe the variety of fixed points of a unipotent operator acting on the space of matrices. We compute the determinant and the rank of a generic (symmetric, or anti-symmetric) matrix in the fixed variety, yielding information about the…

The solution to systems of moment differential equations of the form $z\partial_my=(zA+B)y$ are provided, for a matrix $B$ with general good spectrum. Existence and convergence of Floquet-type solutions is studied. A generalized definition…

In this paper, we study the consequences of the fundamental theorem of calculus from an algebraic point of view. For functions with singularities, this leads to a generalized notion of evaluation. We investigate properties of such…

Denote by $M_n$ the set of $n\times n$ complex matrices. Let $f: M_n \rightarrow [0,\infty)$ be a continuous map such that $f(\mu UAU^*)= f(A)$ for any complex unit $\mu$, $A \in M_n$ and unitary $U \in M_n$, $f(X)=0$ if and only if $X=0$…

We prove that the number of iterations required to solve a random positive definite linear system with the conjugate gradient algorithm is almost deterministic for large matrices. We treat the case of Wishart matrices $W = XX^*$ where $X$…