21 citations · 41 across the 14 of their papers we have counts for
9 papers · 1 filter
Counterexamples on spectra of sign patterns
Yaroslav Shitov
An sign pattern , which is a matrix with entries , is called spectrally arbitrary if any monic real polynomial of degree can be realized as a characterist…
How hard is the tensor rank?
Yaroslav Shitov
We investigate the computational complexity of tensor rank, a concept that plays fundamental role in different topics of modern applied mathematics. For tensors over any integral d…
Which semifields are exact?
Yaroslav Shitov
Every (left) linear function on a subspace of a finite-dimensional vector space over a (skew) field can be extended to a (left) linear function on the whole space. This paper explo…
On the complexity of failed zero forcing
Yaroslav Shitov
Let be a simple graph whose vertices are partitioned into two subsets, called filled vertices and empty vertices. A vertex is said to be forced by a filled vertex if $v…
Euclidean distance matrices and separations in communication complexity theory
Yaroslav Shitov
A Euclidean distance matrix is defined by , where is a real vector. We prove that cannot be written as a sum of $\left[2\sqrt…
Coloring the power graph of a semigroup
Yaroslav Shitov
Let be a semigroup. The vertices of the power graph are the elements of , and two elements are adjacent if and only if one of them is a power of the other.…