On the rank of Z_2-matrices with free entries on the diagonal

04/21/2021
by   Eugene Kogan, et al.
0

For an n × n matrix M with entries in ℤ_2 denote by R(M) the minimal rank of all the matrices obtained by changing some numbers on the main diagonal of M. We prove that for each non-negative integer k there is a polynomial in n algorithm deciding whether R(M) ≤ k (whose complexity may depend on k). We also give a polynomial in n algorithm computing a number m such that m/2 ≤ R(M) ≤ m. These results have applications to graph drawings on non-orientable surfaces.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/09/2023

Two-State Spin Systems with Negative Interactions

We study the approximability of computing the partition functions of two...
research
03/18/2023

Computing a compact local Smith McMillan form

We define a compact local Smith-McMillan form of a rational matrix R(λ) ...
research
05/27/2020

Simultaneous Diagonalization of Incomplete Matrices and Applications

We consider the problem of recovering the entries of diagonal matrices {...
research
09/02/2022

Optimal Diagonal Preconditioning: Theory and Practice

Preconditioning has been a staple technique in optimization and machine ...
research
01/12/2018

Computing permanents of complex diagonally dominant matrices and tensors

We prove that for any λ > 1, fixed in advance, the permanent of an n × n...
research
12/22/2020

Towards a short proof of the Fulek–Kynčl criterion for modulo 2 embeddability of graphs to surfaces

A connected graph K has a modulo 2 embedding to the sphere with g handle...
research
03/17/2020

Diagonal Preconditioning: Theory and Algorithms

Diagonal preconditioning has been a staple technique in optimization and...

Please sign up or login with your details

Forgot password? Click here to reset