Glória Cravo

TL;DR: The possible eigenvalues, the characteristic polynomial, the invariants, or the number of nontrivial invariant polynomials of a square matrix, over a field, when some of its entries are prescribed and the others vary is described.

TL;DR: In this paper, the possible eigenvalues of a pk×pk matrix, partitioned into k×k blocks of size p×p when 2k−3 blocks are fixed and the others vary, are described.

TL;DR: In this paper, it was shown that the characteristic polynomials of a pk×pk matrix can be arbitrarily prescribed over a field F with n−1 arbitrary entries, except if all the non-principal entries of a row or column are prescribed equal to zero and the characteristic does not have a root in F.

TL;DR: A formal framework, based on control flow graphs theory, to verify the correctness of workflows is presented, in which workflows are modeled with tri-logic acyclic directed graphs and the formalism developed allows to verify one important property, the logical termination of workflow.

TL;DR: In this article, the possible eigenvalues of C when some of its blocks are fixed and the other blocks vary are studied, where the blocks C i,j ∈ F p i×p j, i, j ∈ {1, 2, 3}.