The concept of underdetermined recursive leastsquares (URLS) adaptive filtering is introduced. In particular, the URLS algorithm is derived and shown to be a direct consequence of the principle of minimal disturbance. By exploiting the Hankel structure of the filter input matrix, the fast transversal filter (FTF) version of the URLS algorithm (URLS-FTF) is derived including sliding window and g...

This thesis presents a unified theory for the design and analysis of recursive algorithms for the adaptation of transversal digital filters. First, the widely used error minimization approach to algorithm design is investigated and it is shown not to allow a coherent derivation of practical algorithms from an optimality criterion. The reason is found in the incompatibility of the assumption of ...

In this paper, we prove Kirchberg-type inequalities for any Kähler spin foliation. Their limiting-cases are then characterized as being transversal minimal Einstein foliations. The key point is to introduce the transversal Kählerian twistor operators.

A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique-transversal number and clique-independence number of G are the sizes of a minimum clique-transversal and a maximum clique-independent set of G, respectively. A graph G is clique-perfect if the sizes of a minimum cliqu...

A transversal matroid M can be represented by a collection of sets, called a presentation of M , whose partial transversals are the independent sets of M . Minimal presentations are those for which removing any element from any set gives a presentation of a different matroid. We study the connections between (single-element) transversal extensions of M and extensions of presentations of M . We ...