Yaroslav Shitov

According to our database, Yaroslav Shitov authored at least 34 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

A large minimal blocker for 123-avoiding permutations.

Yaroslav Shitov

Discret. Math., 2025

On the nonnegative ranks of matrices in Puiseux series fields.

Yaroslav Shitov

Adv. Appl. Math., 2025

2024

Further $\exists {\mathbb {R}}$-Complete Problems with PSD Matrix Factorizations.

Yaroslav N. Shitov

Found. Comput. Math., August, 2024

More on Tensors with Different Rank and Symmetric Rank.

Yaroslav Shitov

SIAM J. Matrix Anal. Appl., March, 2024

2023

Linear mappings preserving the completely positive rank.

Yaroslav Shitov

Eur. J. Comb., 2023

2022

The Subrank of a Complex Symmetric Tensor Can Exceed its Symmetric Subrank.

Yaroslav N. Shitov

SIAM J. Appl. Algebra Geom., 2022

2021

The Waring Rank of the 3 x 3 Permanent.

Yaroslav Shitov

SIAM J. Appl. Algebra Geom., 2021

Nonnegative rank depends on the field.

Yaroslav Shitov

Math. Program., 2021

A sign pattern with all diagonal entries nonzero whose minimal rank realizations are not diagonalizable over ℂ.

Yaroslav Shitov

Discret. Math., 2021

2020

Factoring a band matrix over a semiring.

Yaroslav Shitov

Fuzzy Sets Syst., 2020

2019

Quantum Version of Wielandt's Inequality Revisited.

Mateusz Michalek, Yaroslav Shitov

IEEE Trans. Inf. Theory, 2019

An Improvement to a Recent Upper Bound for Synchronizing Words of Finite Automata.

Yaroslav Shitov

J. Autom. Lang. Comb., 2019

Euclidean Distance Matrices and Separations in Communication Complexity Theory.

Yaroslav Shitov

Discret. Comput. Geom., 2019

2018

Matrices of Bounded Psd Rank are Easy to Detect.

Yaroslav Shitov

SIAM J. Optim., 2018

A Counterexample to Comon's Conjecture.

Yaroslav Shitov

SIAM J. Appl. Algebra Geom., 2018

On the complexity of graph coloring with additional local conditions.

Yaroslav Shitov

Inf. Process. Lett., 2018

2017

A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length.

Yaroslav Shitov

Theor. Comput. Sci., 2017

On the complexity of failed zero forcing.

Yaroslav Shitov

Theor. Comput. Sci., 2017

The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions.

Yaroslav Shitov

SIAM Rev., 2017

The Complexity of Positive Semidefinite Matrix Factorization.

Yaroslav Shitov

SIAM J. Optim., 2017

Coloring the Power Graph of a Semigroup.

Yaroslav Shitov

Graphs Comb., 2017

Column subset selection is NP-complete.

Yaroslav Shitov

CoRR, 2017

Low-Rank Matrix Approximation in the Infinity Norm.

Nicolas Gillis, Yaroslav Shitov

CoRR, 2017

2016

The Diameter of Chess Grows Exponentially.

Yaroslav Shitov

Am. Math. Mon., 2016

A matrix ring with commuting graph of maximal diameter.

Yaroslav Shitov

J. Comb. Theory A, 2016

A short proof that NMF is NP-hard.

Yaroslav Shitov

CoRR, 2016

2015

Tropical lower bounds for extended formulations.

Yaroslav Shitov

Math. Program., 2015

Mixtures of star trees and deficiency graphs.

Yaroslav Shitov

Eur. J. Comb., 2015

2014

Detecting matrices of combinatorial rank three.

Yaroslav Shitov

J. Comb. Theory A, 2014

An upper bound for nonnegative rank.

Yaroslav Shitov

J. Comb. Theory A, 2014

How many Boolean polynomials are irreducible?

Yaroslav Shitov

Int. J. Algebra Comput., 2014

Sign patterns of rational matrices with large rank.

Yaroslav Shitov

Eur. J. Comb., 2014

2013

When do the r-by-r minors of a matrix form a tropical basis?

Yaroslav Shitov

J. Comb. Theory A, 2013

On the complexity of Boolean matrix ranks.

Yaroslav Shitov

CoRR, 2013