Related papers: Tighter Undecidability Bounds for Matrix Mortality…

We resolve three long-standing open problems, namely the (algorithmic) decidability of network coding, the decidability of conditional information inequalities, and the decidability of conditional independence implication among random…

We investigate the distillability problem in quantum information in $\bbC^d\ox\bbC^d$. A special case of the problem has been reduced to proving a matrix inequality when $d=4$. We investigate the inequality for two families of non-normal…

The capability of discretization of matrix elements in the problem of quadratic functional minimization with linear member built on matrix in N-dimensional configuration space with discrete coordinates is researched. It is shown, that…

Let the columns of a $p \times q$ matrix $M$ over any ring be partitioned into $n$ blocks, $M = [M_1, ..., M_n]$. If no $p \times p$ submatrix of $M$ with columns from distinct blocks $M_i$ is invertible, then there is an invertible $p…

For a positive integer $N$, we define the N-rank of a non singular integer $d\times d$ matrix $A$ to be the maximum integer $r$ such that there exists a minor of order $r$ whose determinant is not divisible by $N$. Given a positive integer…

We study several decision problems for counter systems with guards defined by convex polyhedra and updates defined by affine transformations. In general, the reachability problem is undecidable for such systems. Decidability can be achieved…

Matroid theory provides a unifying framework for studying dependence across combinatorics, geometry, and applications ranging from rigidity to statistics. In this work, we study circuit varieties of matroids, defined by their minimal…

Let $k,d,\lambda\geqslant1$ be integers with $d\geqslant\lambda $. Let $m(k,d,\lambda)$ be the maximum positive integer $n$ such that every set of $n$ points (not necessarily in general position) in $\mathbb{R}^{d}$ has the property that…

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…

A proposal for the matrix model formulation of the M-theory on a space with a boundary is given. A general machinery for modding out a symmetry in M(atrix) theory is used for a Z_2 symmetry changing the sign of the X_1 coordinate. The…

Let $n$ be a positive integer and $X = [x_{ij}]_{1 \leq i, j \leq n}$ be an $n \times n$\linebreak \noindent sized matrix of independent random variables having joint uniform distribution $$\hbox{Pr} {x_{ij} = k \hbox{for} 1 \leq k \leq n}…

In this paper, we study the complexity of computing the determinant of a matrix over a non-commutative algebra. In particular, we ask the question, "over which algebras, is the determinant easier to compute than the permanent?" Towards…

There are many types of automata and grammar models that have been studied in the literature, and for these models, it is common to determine whether certain problems are decidable. One problem that has been difficult to answer throughout…

Although high-order Maxwell integral equation solvers provide significant advantages in terms of speed and accuracy over corresponding low-order integral methods, their performance significantly degrades in presence of non-smooth…

Higher-order beta-matching is the following decision problem: given two simply typed lambda-terms, can the first term be instantiated to be beta-equivalent to the second term? This problem was formulated by Huet in the 1970s and shown…

In this work we start the investigation of tight complexity bounds for connectivity problems parameterized by cutwidth assuming the Strong Exponential-Time Hypothesis (SETH). Van Geffen et al. posed this question for odd cycle transversal…

We consider the Calder\'on problem for systems with unknown zeroth and first order terms, and improve on previously known results. More precisely, let $(M, g)$ be a compact Riemannian manifold with boundary, let $A$ be a connection matrix…

A long-standing open question in Integer Programming is whether integer programs with constraint matrices with bounded subdeterminants are efficiently solvable. An important special case thereof are congruency-constrained integer programs…

We consider the algebraic Riccati equation for which the four coefficient matrices form an M-matrix K. When K is a nonsingular M-matrix or an irreducible singular M-matrix, the Riccati equation is known to have a minimal nonnegative…

A question of interest in Linear Algebra is whether all n x n complex matrices can be unitarily tridiagonalised. The answer for all n not equal to 4 (affirmative or negative) has been known for a while, whereas the case n=4 seems to have…