A Blind Permutation Similarity Algorithm

03/26/2020
by   Eric Barszcz, et al.
0

This paper introduces a polynomial blind algorithm that determines when two square matrices, A and B, are permutation similar. The shifted and translated matrices (A+β I+γ J) and (B+β I+γ J) are used to color the vertices of two square, edge weighted, rook's graphs. Then the orbits are found by repeated symbolic squaring of the vertex colored and edge weighted adjacency matrices. Multisets of the diagonal symbols from non-permutation similar matrices are distinct within a few iterations, typically four or less.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/15/2020

Complete Edge-Colored Permutation Graphs

We introduce the concept of complete edge-colored permutation graphs as ...
10/04/2018

The Four Point Permutation Test for Latent Block Structure in Incidence Matrices

Transactional data may be represented as a bipartite graph G:=(L ∪ R, E)...
03/17/2017

Roots multiplicity without companion matrices

We show a method for constructing a polynomial interpolating roots' mult...
11/27/2021

A polynomial kernel for vertex deletion into bipartite permutation graphs

A permutation graph can be defined as an intersection graph of segments ...
10/22/2020

Vertex deletion into bipartite permutation graphs

A permutation graph can be defined as an intersection graph of segments ...
06/09/2019

Graph Independence Testing

Identifying statistically significant dependency between variables is a ...
04/10/2017

DeepPermNet: Visual Permutation Learning

We present a principled approach to uncover the structure of visual data...