Combinatorial commutation properties for reordering a sequence consisting of two kinds of steps, and for separating the well-foundedness of their combination into well-foundedness of each, are investigated. A weak commutation property, called “jumping”, along with a weakened version of the lifting property, called “escaping” and requiring only an eventual lifting, are used for proving wellfound...

We provide a complete spectral characterization of the double commutation method for general Sturm-Liouville operators which inserts any finite number of prescribed eigenvalues into spectral gaps of a given background operator. Moreover, we explicitly determine the transformation operator which links the background operator to its doubly commuted version (resulting in extensions and considerabl...

A method and system are proposed for a transient-free commutation of a resonant-mode array of inductors. A single capacitor is used to tune the entire array, and triacs are used to commutate the inductors. To avoid the transients, the tuning capacitor is electrically locked when it stores the whole energy of the excited circuit. This prevents the capacitor from discharge during the fast, 0.1 ms...

In this paper we consider the notion of commutation for a pair of continuous and convex Hamiltonians, given in terms of commutation of their Lax– Oleinik semigroups. This is equivalent to the solvability of an associated multi– time Hamilton–Jacobi equation. We examine the weak KAM theoretic aspects of the commutation property and show that the two Hamiltonians have the same weak KAM solutions ...

In any cable or power line communications, impulse noise is known to be the most difficult noise to filter. In particular, non periodic asynchronous impulse noise is impossible to predict. Under such noise conditions, the OFDM symbol generally used in PLC is corrupted. To overcome this problem, the signal-to-noise ratio is generally improved by detecting and/or filtering the noise. This leads h...