Related papers: Equivalent matrices up to permutations
Computational problem certificates are additional data structures for each output, which can be used by a-possibly randomized-verification algorithm that proves the correctness of each output. In this paper, we give an algorithm that…
We propose variations of the class of hidden monomial cryptosystems in order to make it resistant to all known attacks. We use identities built upon a single bivariate polynomial equation with coefficients in a finite field. Indeed, it can…
The assumed hardness of the Linear Code Equivalence problem (LCE) lies at the core of the security of the LESS signature scheme and other signature schemes with advanced functionalities. The LCE problem asks to determine whether two linear…
We introduce a randomized algorithm for computing the minimal-norm solution to an underdetermined system of linear equations. Given an arbitrary full-rank m x n matrix A with m<n, any m x 1 vector b, and any positive real number epsilon…
The Code Equivalence problem is that of determining whether two given linear codes are equivalent to each other up to a permutation of the coordinates. This problem has a direct reduction to a nonabelian hidden subgroup problem (HSP),…
Nowadays, equivalence problems are widely used in cryptography, most notably to establish cryptosystems such as digital signatures, with MEDS, LESS, PERK as the most recent ones. However, in the context of matrix codes, only the code…
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…
Given two matroids $\mathcal{M}_{1} = (E, \mathcal{B}_{1})$ and $\mathcal{M}_{2} = (E, \mathcal{B}_{2})$ on a common ground set $E$ with base sets $\mathcal{B}_{1}$ and $\mathcal{B}_{2}$, some integer $k \in \mathbb{N}$, and two cost…
In 1991, Z\'emor proposed a hash function which provides data security using the difficulty of writing a given matrix as a product of generator matrices. Tillich and Z\'emor subsequently provided an algorithm finding short collisions for…
We introduce efficient $(1+\varepsilon)$-approximation algorithms for the binary matrix factorization (BMF) problem, where the inputs are a matrix $\mathbf{A}\in\{0,1\}^{n\times d}$, a rank parameter $k>0$, as well as an accuracy parameter…
We consider the linear least squares problem with linear equality constraints (LSE problem) formulated as $\min_{x\in\mathbb{R}^{n}}\|Ax-b\|_2 \ \mathrm{s.t.} \ Cx = d$. Although there are some classical methods available to solve this…
We study solutions of a quadratic matrix equation arising in Riemannian geometry. Let $S$ be a real symmetric $n\times n$-matrix with zeros on the diagonal and let $\theta$ be a real number. We construct nonzero solutions $(S,\theta)$ of…
Hierarchical matrices (usually abbreviated ${\mathcal H}$-matrices) are frequently used to construct preconditioners for systems of linear equations. Since it is possible to compute approximate inverses or $LU$ factorizations in ${\mathcal…
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…
The Smith reduction is a basic tool when analyzing integer matrices up to equivalence, and the Kannan-Bachem (KB) algorithm is the first polynomial algorithm computing such a reduction. Using this algorithm in complicated situations where…
We theoretically propose a symmetric encryption scheme based on Restricted Boltzmann Machines that functions as a probabilistic Enigma device, encoding information in the marginal distributions of visible states while utilizing bias…
The symmetries, especially those related to the $R$-transformation, of the reflection equation(RE) for two-component systems are analyzed. The classification of solutions to the RE for eight-, six- and seven-vertex type $R$-matrices is…
Motivated in part by a problem of combinatorial optimization and in part by analogies with quantum computations, we consider approximations of orthogonal matrices U by ``non-commutative convex combinations'' A of permutation matrices of the…
Let $T$ be a matrix whose entries are linear forms over the noncommutative variables $x_1, x_2, \ldots, x_n$. The noncommutative Edmonds' problem (NSINGULAR) aims to determine whether $T$ is invertible in the free skew field generated by…
We introduce a numerical strategy to efficiently solve the out-of-equilibrium Dyson equation in the transient regime. By discretizing the equation into a compact matrix form and applying state-of-the-art matrix compression techniques, we…