Algebra Commons^™

François Viète, Between Analysis And Cryptanalysis, Marco Panza

MPP Published Research

François Viète is considered the father both of modern algebra and of modern cryptanalysis. The paper outlines Viète's major contributions in these two mathematical fields and argues that, despite an obvious parallel between them, there is an essential difference. Viète's 'new algebra' relies on his reform of the classical method of analysis and synthesis, in particular on a new conception of analysis and the introduction of a new formalism. The procedures he suggests to decrypt coded messages are particular forms of analysis based on the use of formal methods. However, Viète's algebraic analysis is not an analysis in the same …

Matrix-J-Unitary Non-Commutative Rational Formal Power Series, Daniel Alpay, D. S. Kalyuzhnyi-Verbovetzkii

Mathematics, Physics, and Computer Science Faculty Articles and Research

Formal power series in N non-commuting indeterminates can be considered as a counterpart of functions of one variable holomorphic at 0, and some of their properties are described in terms of coefficients. However, really fruitful analysis begins when one considers for them evaluations on N-tuples of n × n matrices (with n = 1, 2, . . .) or operators on an infinite-dimensional separable Hilbert space. Moreover, such evaluations appear in control, optimization and stabilization problems of modern system engineering.

In this paper, a theory of realization and minimal factorization of rational matrix-valued functions which are J-unitary on the imaginary …

Coalgebras And Their Logics, Alexander Kurz

Engineering Faculty Articles and Research

"Transition systems pervade much of computer science. This article outlines the beginnings of a general theory of specification languages for transition systems. More specifically, transition systems are generalised to coalgebras. Specification languages together with their proof systems, in the following called (logical or modal) calculi, are presented by the associated classes of algebras (e.g., classical propositional logic by Boolean algebras). Stone duality will be used to relate the logics and their coalgebraic semantics."