Related papers: Tighter Undecidability Bounds for Matrix Mortality…

The low-rank matrix completion problem asks whether a given real matrix with missing values can be completed so that the resulting matrix has low rank or is close to a low-rank matrix. The completed matrix is often required to satisfy…

This article studies two notions of generalized matroid representations motivated by algorithmic information theory and cryptographic secret sharing. The first (entropic representability) involves discrete random variables, while the second…

The Semialgebraic Orbit Problem is a fundamental reachability question that arises in the analysis of discrete-time linear dynamical systems such as automata, Markov chains, recurrence sequences, and linear while loops. An instance of the…

Distributed matrix multiplication is widely used in several scientific domains. It is well recognized that computation times on distributed clusters are often dominated by the slowest workers (called stragglers). Recent work has…

We introduce the notion of Universally Decodable Matrices of Genus g (UDMG), which for g=0 reduces to the notion of Universally Decodable Matrices (UDM) introduced in [8]. A UDMG is a set of L matrices over a finite field, each with K rows,…

The continuous evolution of a wide variety of systems, including continuous-time Markov chains and linear hybrid automata, can be described in terms of linear differential equations. In this paper we study the decision problem of whether…

In this paper we study colorings (or tilings) of the two-dimensional grid $\mathbb{Z}^2$. A coloring is said to be valid with respect to a set $P$ of $n\times m$ rectangular patterns if all $n\times m$ sub-patterns of the coloring are in…

In this paper we consider a number of natural decision problems involving k-regular sequences. Specifically, they arise from - lower and upper bounds on growth rate; in particular boundedness, - images, - regularity (recognizability by a…

Let $d>1$ be an integer and $K_0$ a perfect field such that $char(K_0)$ does not divide $d$. Let $n>d$ be an integer that is prime to $d$. Let $f(x)\in K_0[x]$ be a degree $n$ monic polynomial without repeated roots, and $\mathcal{C}_{f,d}$…

In this note, we give a necessary and sufficient condition for a matrix A in M to be finitely G-determined, where M is the ring of 2 x 2 matrices whose entries are formal power series over an infinite field, and G is a group acting on M by…

In a celebrated paper of 1893, Hadamard established the maximal determinant theorem, which establishes an upper bound on the determinant of a matrix with complex entries of norm at most $1$. His paper concludes with the suggestion that…

We study the Matrix Multiplication Verification Problem (MMV) where the goal is, given three $n \times n$ matrices $A$, $B$, and $C$ as input, to decide whether $AB = C$. A classic randomized algorithm by Freivalds (MFCS, 1979) solves MMV…

In the propositional modal (and algebraic) treatment of two-variable first-order logic equality is modelled by a `diagonal' constant, interpreted in square products of universal frames as the identity (also known as the `diagonal')…

We investigate the manifold $\cal{M}$ of (real) quadratic forms in n > 1 variables having a multiple eigenvalue. In addition to known facts, we prove that 1) $\cal{M}$ is irreducible, 2) in the case of n = 3, scalar matrices and only them…

Recent experiments show that the top-right corner element ($U_{e3}$) of the PMNS, like that ($V_{ub}$) of the CKM, matrix is small but nonzero, and suggest further via unitarity that it is smaller than the bottom-left corner element…

The following two decision problems capture the complexity of comparing integers or rationals that are succinctly represented in product-of-exponentials notation, or equivalently, via arithmetic circuits using only multiplication and…

We study problems related to colouring bottomless rectangles. One of our main results shows that for any positive integers $m, k$, there is no semi-online algorithm that can $k$-colour bottomless rectangles with disjoint boundaries in…

We show that under some widely believed assumptions, there are no higher-order algorithms for basic tasks in computational mathematics such as: Computing integrals with neural network integrands, computing solutions of a Poisson equation…

We prove the undecidability of MSO on $\omega$-words extended with the second-order predicate $U_1(X)$ which says that the distance between consecutive positions in a set $X \subseteq \mathbb{N}$ is unbounded. This is achieved by showing…

We show that the Identity Problem is decidable in polynomial time for finitely generated sub-semigroups of the group $\mathsf{UT}(4, \mathbb{Z})$ of $4 \times 4$ unitriangular integer matrices. As a byproduct of our proof, we also show the…