Inherited LU-factorizations of matrices

Various types of LU-factorizations for nonsingular matrices, where L is a lower triangular matrix and U is an upper triangular matrix, are defined and characterized. These types of LU-factorizations are extended to the general m × n case. The more general conditions are considered in the light of the structures of [C.R. Johnson, D.D. Olesky, P. Van den Driessche, Inherited matrix entries: LU factorizations, SIAM J. Matrix Anal. Appl. 10 (1989) 99-104]. Applications to graphs and adjacency matrices are investigated. Conditions for the product of a lower and an upper triangular matrix to be the zero matrix are also obtained.     

A short proof for a generalization of Vizing's theorem

For a simple graph of maximum degree Δ, it is always possible to color the edges with Δ + 1 colors (Vizing); furthermore, if the set of vertices of maximum degree is independent, Δ colors suffice (Fournier). In this article, we give a short constructive proof of an extension of these results to multigraphs. Instead of considering several color interchanges along alternating chains (Vizing, Gupta), using counting arguments (Ehrenfeucht, Faber, Kierstead), or improving nonvalid colorings with Fournier's Lemma, the method of proof consists of using one single easy transformation, called “sequential recoloring”, to augment a partial k-coloring of the edges.     

The way of Diophantus: Some clarifications on Diophantus' method of solution

In the introduction of the Arithmetica Diophantus says that in order to solve arithmetical problems one has to “follow the way he (Diophantus) will show.” The present paper has a threefold objective. Firstly, the meaning of this sentence is discussed, the conclusion being that Diophantus had elaborated a program for handling various arithmetical problems. Secondly, it is claimed that what is analyzed in the introduction is definitions of several terms, the exhibition of their symbolism, the way one may operate with them, but, most significantly, the main stages of the program itself. And thirdly, it is argued that Diophantus' intention in the Arithmetica is to show the way the stages of his program should be practically applied in various arithmetical problems.     

Détermination des perturbations induites aux extrémités d’une ligne blindée soumise à une excitation ponctuelle de courant

This article allows the determination of the induced perturbations at the ends of the coaxial line in wide frequency band enough. The perturbation source is a current direct point injection into the cable screen in any position. For this, we have applied the theory of the state variables, with foundation of the quasi-TEM approximation, in order to simulate the coaxial line above a ground level that has a finished conductivity. This allows us to supply the current and voltage expressions at the ends of the line as their analytic forms for any conditions of charge. Next, the elaborate objective is to verify experimentally on concrete applications if the test obtained results confirm the theoretical expectations supplied by calculation code finalizing.     

Clustering of Eigenvalues on Translation Surfaces

We consider Riemannian surfaces in which there are many embedded Euclidean cylinders. We show that quantitative assumptions on the number of such cylinders provide estimates for the counting function of eigenvalues. These results in particular apply to translation surfaces. Communicated by Jens Marklof Submitted: 3/03/ 2005 Accepted: 18/11/2005