Related papers: Counting Dope Matrices

We consider the algebra of invariants of $d$-tuples of $n\times n$ matrices under the action of the orthogonal group by simultaneous conjugation over an infinite field of characteristic $p$ different from two. It is well-known that this…

The problem of Distance Edge Labeling is a variant of Distance Vertex Labeling (also known as $L_{2,1}$ labeling) that has been studied for more than twenty years and has many applications, such as frequency assignment. The Distance Edge…

Given a $(k+1)$-tuple $A, B_1,...,B_k$ of $(m\times n)$-matrices with $m\le n$ we call the set of all $k$-tuples of complex numbers $\{\la_1,...,\la_k\}$ such that the linear combination $A+\la_1B_1+\la_2B_2+...+\la_kB_k$ has rank smaller…

Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…

We study the algorithmic problem of multiplying large matrices that are rectangular. We prove that the method that has been used to construct the fastest algorithms for rectangular matrix multiplication cannot give algorithms with…

We show that the maximal determinant D(n) for $n \times n$ ${\pm 1}$-matrices satisfies $R(n) := D(n)/n^{n/2} \ge \kappa_d > 0$. Here $n^{n/2}$ is the Hadamard upper bound, and $\kappa_d$ depends only on $d := n-h$, where $h$ is the maximal…

We characterize the biorthogonal ensembles that are both a multiple orthogonal polynomial ensemble and a polynomial ensemble of derivative type (also called a P\'olya ensemble). We focus on the notions of multiplicative and additive…

Let $m,n\geq 3$, $(m-1)(n-1)+2\leq p\leq mn$, and $u=mn-p$. The set $\mathbb{R}^{u\times n\times m}$ of all real tensors with size $u\times n\times m$ is one to one corresponding to the set of bilinear maps $\mathbb{R}^m\times…

The author has recently presented two different expressions for lambda_d(p) of the monomer-dimer problem involving a power series in p, the first jointly with Shmuel Friedland. These two expressions are certainly equal, but this has not yet…

The problem of classifying tuples of nilpotent matrices over a field under simultaneous conjugation is considered "hopeless". However, for any given matrix order over a finite field, the number of concerned orbits is always finite. This…

We investigate the relationship between several enumeration complexity classes and focus in particular on problems having enumeration algorithms with incremental and polynomial delay (IncP and DelayP respectively). We show that, for some…

Motivated by problems of comparative genomics and paleogenomics, in [Chauve et al., 2009], the authors introduced the Gapped Consecutive-Ones Property Problem (k,delta)-C1P: given a binary matrix M and two integers k and delta, can the…

We use a variety of computational tools to obtain a degree-$\binom{m + n - 2}{m - 1}$ polynomial equation conjecturally satisfied by the top-left entry of the Sinkhorn limit of a positive $m \times n$ matrix. The degree of this equation has…

We classify $n$-representation infinite algebras $\Lambda$ of type \~A. This type is defined by requiring that $\Lambda$ has higher preprojective algebra $\Pi_{n+1}(\Lambda) \simeq k[x_1, \ldots, x_{n+1}] \ast G$, where $G \leq…

A list $\Lambda =\{\lambda _{1},\ldots ,\lambda _{n}\}$ of complex numbers (repeats allowed) is said to be \textit{realizable} if it is the spectrum of an entrywise nonnegative matrix $A$. $\Lambda $ is \textit{diagonalizably realizable} if…

Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…

Let $\mathcal{A}$ be a unital algebra, $\delta$ be a linear mapping from $\mathcal{A}$ into itself and $m$, $n$ be fixed integers. We call $\delta$ an (\textit{m, n})-derivable mapping at $Z$, if…

Let $d(N )$ (resp. $p(N )$) be the number of summands in the determinant (resp. permanent) of an $N\times N$ circulant matrix $A = (a_{ij} )$ given by $a_{ij} = X_{i+j}$ where $i + j$ should be considered $\mod N$ . This short note is…

For a prime p, a Diophantine m-tuple in $\mathbb{F}_p$ is a set of m nonzero elements of $\mathbb{F}_p$ with the property that the product of any two of its distinct elements is one less than a square. In this paper, we present formulas for…

We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…