Ladder Matrix Recovery from Permutations

07/22/2022
by   Manolis C. Tsakiris, et al.
0

We give unique recovery guarantees for matrices of bounded rank that have undergone permutations of their entries. We even do this for a more general matrix structure that we call ladder matrices. We use methods and results of commutative algebra and algebraic geometry, for which we include a preparation as needed for a general audience.

READ FULL TEXT

page 2

page 4

page 5

research
06/13/2019

The rank of sparse random matrices

Generalising prior work on the rank of random matrices over finite field...
research
07/30/2023

Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity

We show that any bounded integral function f : A × B ↦{0,1, …, Δ} with r...
research
06/26/2023

On Linear spaces of of matrices bounded rank

Motivated by questions in theoretical computer science and quantum infor...
research
04/12/2016

Structured Matrix Recovery via the Generalized Dantzig Selector

In recent years, structured matrix recovery problems have gained conside...
research
07/01/2017

Geometry-Oblivious FMM for Compressing Dense SPD Matrices

We present GOFMM (geometry-oblivious FMM), a novel method that creates a...
research
02/15/2022

Bohemian Matrix Geometry

A Bohemian matrix family is a set of matrices all of whose entries are d...
research
03/12/2018

An algorithm for hiding and recovering data using matrices

We present an algorithm for the recovery of a matrix M (non-singular ∈ ...

Please sign up or login with your details

Forgot password? Click here to reset