Related papers: Quelques \'el\'ements de combinatoire des matrices…

We characterize sequences of positive integers $(a_1,a_2,\ldots,a_n)$ for which the $2\times2$ matrix $\left( \begin{array}{cc} a_n&-1 1&0 \end{array} \right) \left( \begin{array}{cc} a_{n-1}&-1 1&0 \end{array} \right) \cdots \left(…

We consider the polynomial equation $$X^n + a_{n-1}\cdot X^{n-1} + \dots + a_1 \cdot X + a_0 \cdot I = O,$$ over $(2 \times 2)$-matrices $X$ with the real entries, where $I$ is the identity matrix, $O$ is the null matrix, $a_i \in \mathbb…

We characterize sequences of positive integers (c 1 , c 2 , ..., cn) for which the (2 x 2)-matrix c 1 --1 1 0 $\times$ $\times$ $\times$ cn --1 1 0 belongs to the principal congruence subgroup of level 2 in SL(2, Z). The answer is given in…

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…

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…

In this paper we give a new formula for the $n$-th power of a $2\times2$ matrix. More precisely, we prove the following: Let $A= \left ( \begin{matrix} a & b \\ c & d \end{matrix} \right )$ be an arbitrary $2\times2$ matrix, $T=a+d$ its…

We prove a deterministic analogue of Rudelson's sampling theorem for sums of positive semidefinite matrices. Let $A_1,\dots,A_m$ be positive semidefinite \(d\times d\) matrices, and let $\lambda_1,\dots,\lambda_m \ge 0$ satisfy \[…

In this article, we study the combinatorics of congruence subgroups of the modular group. More precisely, we consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of…

For a fixed unit vector $a=(a_1,a_2,\ldots,a_n)\in S^{n-1}$, we consider the $2^n$ sign vectors $\varepsilon=(\varepsilon^1,\varepsilon^2,\ldots,\varepsilon^n)\in \{+1,-1\}^n$ and the corresponding scalar products $\varepsilon\cdot…

The aim of this article is to count the $n$-tuples of positive integers $(a_{1},\ldots,a_{n})$ solutions of the equation $\begin{pmatrix} a_{n} & -1 \\[4pt] 1 & 0 \end{pmatrix} \begin{pmatrix} a_{n-1} & -1 \\[4pt] 1 & 0 \end{pmatrix} \cdots…

In this paper, we consider matrices whose entries are combinatorial sequences which can be expressed in terms of a convolution of elementary and complete homogeneous symmetric functions. We establish the total positivity of these matrices…

Let $I_k = [(2k-1)^2, (2k+1)^2)$ for $k \geq 1$. Starting from the odd-composite matrix $(b_{ij})$ with $b_{ij} = (2i-1)(2j-1)$, introduced by the author in [1], we define for each odd integer $n$ the \emph{matrix multiplicity} $r(n)$, the…

For every $2n\times 2n$ real positive definite matrix $A,$ there exists a real symplectic matrix $M$ such that $M^TAM=\diag(D,D),$ where $D$ is the $n\times n$ positive diagonal matrix with diagonal entries $d_1(A)\le \cdots\le d_n(A).$ The…

Given a finite set $\{M_0,\dots,M_{d-1}\}$ of nonnegative $2\times 2$ matrices and a nonnegative column-vector $V$, we associate to each $(\omega_n)\in\{0,\dots,d-1\}^\mathbb N$ the sequence of the column-vectors…

Let $m$ be any integer $\geq 3$. We consider the polynomial equation $$X^n + a_{n-1}\cdot X^{n-1} + \dots + a_1 \cdot X + a_0 \cdot I = O,$$ over $(m \times m)$-matrices $X$ with the real entries, where $I$ is the identity matrix, $O$ is…

We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…

Zeckendorf's theorem states that every positive integer can be written uniquely as the sum of non-consecutive shifted Fibonacci numbers $\{F_n\}$, where we take $F_1=1$ and $F_2=2$. This has been generalized for any Positive Linear…

We show a $2^{n/2+o(n)}$-time algorithm that finds a (non-zero) vector in a lattice $\mathcal{L} \subset \mathbb{R}^n$ with norm at most $\tilde{O}(\sqrt{n})\cdot \min\{\lambda_1(\mathcal{L}), \det(\mathcal{L})^{1/n}\}$, where…

A left-unilateral matrix equation is an algebraic equation of the form $$ a_0+a_1 x+a_2 x^2+... +a_n x^n=0 $$ where the coefficients $a_r$ and the unknown $x$ are square matrices of the same order and all coefficients are on the left…

Given $n \times n$ matrices, $A_1, \dots, A_k$, consider the linear operator $L(A_1,\dots,A_k) \, \colon \; \operatorname{M}_n \to \operatorname{M}_n$ given by \[ L(A_1,\dots,A_k)(A_{k+1})= \sum_{\sigma\in S_{k+1}}…