On Jordan's measurements

The Jordan measure, the Jordan curve theorem, as well as the other generic references to Camille Jordan's (1838-1922) achievements highlight that the latter can hardly be reduced to the "great algebraist" whose masterpiece, the Trait\'e des substitutions et des equations alg\'ebriques, unfolded the group-theoretical content of \'Evariste Galois's work. The present paper appeals to the database of the reviews of the Jahrbuch \"uber die Fortschritte der Mathematik (1868-1942) for providing an overview of Jordan's works. On the one hand, we shall especially investigate the collective dimensions in which Jordan himself inscribed his works (1860-1922). On the other hand, we shall address the issue of the collectives in which Jordan's works have circulated (1860-1940). Moreover, the time-period during which Jordan has been publishing his works, i.e., 1860-1922, provides an opportunity to investigate some collective organizations of knowledge that pre-existed the development of object-oriented disciplines such as group theory (Jordan-H\"older theorem), linear algebra (Jordan's canonical form), topology (Jordan's curve), integral theory (Jordan's measure), etc. At the time when Jordan was defending his thesis in 1860, it was common to appeal to transversal organizations of knowledge, such as what the latter designated as the "theory of order." When Jordan died in 1922, it was however more and more common to point to object-oriented disciplines as identifying both a corpus of specialized knowledge and the institutionalized practices of transmissions of a group of professional specialists

On the Size of Finite Rational Matrix Semigroups

Let $n$ be a positive integer and $\mathcal M$ a set of rational $n \times n$-matrices such that $\mathcal M$ generates a finite multiplicative semigroup. We show that any matrix in the semigroup is a product of matrices in $\mathcal M$ whose length is at most $2^{n (2 n + 3)} g(n)^{n+1} \in 2^{O(n^2 \log n)}$, where $g(n)$ is the maximum order of finite groups over rational $n \times n$-matrices. This result implies algorithms with an elementary running time for deciding finiteness of weighted automata over the rationals and for deciding reachability in affine integer vector addition systems with states with the finite monoid property