Let A be a complex n × n matrix. Let A' be its commutant in Mₙ(ℂ), and C(A) be its centralizer in GL(n,ℂ). Consider the standard C(A)-action on ℂⁿ. We describe the C(A)-orbits via invariant subspaces of A'. For example, we count the number of C(A)-orbits as well as that of invariant subspaces of A'.
We consider the two-sided eigenproblem over max algebra. It is shown that any finite system of real intervals and points can be represented as spectrum of this eigenproblem.
For p ≤ n, let b1(n),...,bp(n) be independent random vectors in with the same distribution invariant by rotation and without mass at the origin. Almost surely these vectors form a basis for the Euclidean lattice they generate. The topic of this paper is the property of reduction of this random basis in the sense of Lenstra-Lenstra-Lovász (LLL). If is the basis obtained from b1(n),...,bp(n) by Gram-Schmidt orthogonalization, the quality of the reduction depends upon the sequence of ratios...
The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced paths in the graph that cover all the vertices of the graph, while the positive zero forcing number is an upper bound on the minimum number of induced trees in the graph needed to cover all the vertices in the graph. We show that for a block-cycle graph the zero forcing number equals...