Related papers: Matrices autosimilaires
In this paper we give a simple, short, and self-contained proof for a non-trivial upper bound on the probability that a random $\pm 1$ symmetric matrix is singular.
We describe classes of toric varieties of codimension 2 which are either minimally defined by 3 binomial equations over any algebraically closed field, or are set-theoretic complete intersections in exactly one positive characteristic.
We apply the bi-moment determinant method to compute a representation of the matrix product algebra -- a quadratic algebra satisfied by the operators $\mathbf{d}$ and $\mathbf{e}$ -- for the five parameter ($\alpha$, $\beta$, $\gamma$,…
Consideration of a question of E. R. Berlekamp led Carlitz, Roselle, and Scoville to give a combinatorial interpretation of the entries of certain matrices of determinant~1 in terms of lattice paths. Here we generalize this result by…
Let (t_n) be the classical Thue-Morse sequence defined by t_n = s_2(n) (mod 2), where s_2 is the sum of the bits in the binary representation of n. It is well known that for any integer k>=1 the frequency of the letter "1" in the…
Let M be a factor of type II_\infty or II_1 having separable predual and let M-bar be the algebra of affiliated \tau-measureable operators. We characterize the commutator space [I,J] for sub-(M,M)-bimodules I and J of M-bar.
We prove that for writing the 3 by 3 permanent polynomial as a determinant of a matrix consisting only of zeros, ones, and variables as entries, a 7 by 7 matrix is required. Our proof is computer based and uses the enumeration of bipartite…
Commutative analogues of Clifford algebras are algebras defined in the same way as Clifford algebras except that their generators commute with each other, in contrast to Clifford algebras in which the generators anticommute. In this paper,…
Modular data are commonly studied in mathematics and physics. A modular datum defines a finite-dimensional representation of the modular group $SL_2(\mathbb{Z})$. In this paper, we show that there is a one-to-one correspondence between…
Two matrices are said to be principal minor equivalent if they have equal corresponding principal minors of all orders. We give a characterization of principal minor equivalence and a deterministic polynomial time algorithm to check if two…
A binary tensor consists of $2^n$ entries arranged into hypercube format $2 \times 2 \times \cdots \times 2$. There are $n$ ways to flatten such a tensor into a matrix of size $2 \times 2^{n-1}$. For each flattening, $M$, we take the…
Pfaffians of matrices with entries z[i,j]/(x\_i+x\_j), or determinants of matrices with entries z[i,j]/(x\_i-x\_j), where the antisymmetrical indeterminates z[i,j] satisfy the Pl\"ucker relations, can be identified with a trace in an…
Matrix pencils, or pairs of matrices, may be used in a variety of applications. In particular, a pair of matrices (E,A) may be interpreted as the differential equation E x' + A x = 0. Such an equation is invariant by changes of variables,…
We consider the variety of $(p+1)$-tuples of matrices $A_j$ (resp. $M_j$) from given conjugacy classes $c_j\subset gl(n,{\bf C})$ (resp. $C_j\subset GL(n,{\bf C})$) such that $A_1+... +A_{p+1}=0$ (resp. $M_1... M_{p+1}=I$). This variety is…
An $n$ by $n$ skew-symmetric type $(-1,1)$-matrix $K=[k_{i,j}]$ has $1$'s on the main diagonal and $\pm 1$'s elsewhere with $k_{i,j}=-k_{j,i}$. The largest possible determinant of such a matrix $K$ is an interesting problem. The literature…
We give an excluded-minor characterization for the class of matroids M in which M\e or M/e is binary for all e in E(M). This class is closely related to the class of matroids in which every member is binary or can be obtained from a binary…
In this work, the determinants of matrices constructed by evaluating homogeneous bivariate polynomials at pairs of vectors are investigated. For a polynomial $p(x,y)=\sum\limits_{i=0}^k \alpha_i x^{k-i}y^i$, an explicit factorization of the…
Simple-minded systems of objects in a stable module category are defined by common properties with the set of simple modules, whose images under stable equivalences do form simple-minded systems. Over a representation-finite self-injective…
In this note, we present a systematic method to explicitly compute the determinants and inverses for some generalized Hilbert matrices associated with orthogonal systems with explicit representations. We expressed the determinant, the…
We evaluate determinants of "spiral" matrices, which are matrices in which entries are spiralling from the centre of the matrices towards the outside, with prescribed increments from one entry to the next depending on whether one moves…