Ingleton [8, p. 123] raised the question of characterizing the class of transversal matroids that are representable over some particular field F. He noted that when F = GF(2), this problem had already been solved by de Sousa and Welsh [6] who showed that the class of binary transversal matroids coincides with the class of graphic transversal matroids. The latter class had earlier been character...

Matroids are discrete structures that capture independence under many different flavours. Our focus here is split between affine independence and transversal set theory. It was proved by Edmonds and Fulkerson in 1965 that the set of partial transversals of a set system are the independent sets of a matroid. A first attractive feature of these matroids (thus called transversal matroids) is that ...

A latin transversal in a square matrix of order n is a set of entries, no two in the same row or column, which are pairwise distinct. A longstanding conjecture of Ryser states that every Latin square with odd order has a latin transversal. Some results on the existence of a large partial latin transversal can be found in [11,6,16]. Mainly motivated by Ryser’s conjecture, Erdős and Spencer [8] p...

A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V −S is adjacent to a vertex in S. A dominating set which intersects every maximum independent set in G is called an independent transversal dominating set. The minimum cardinality of an independent transversal dominating set is called the independent transversal domination number of G and is denoted by γ...

For each constant k, we present a linear time algorithm that, given a planar graph G, either finds a minimum odd cycle vertex transversal in G or guarantees that there is no transversal of size at most k.

Multiple reception antenna assisted Space Division Multiple Access (SDMA) techniques designed for wireless Orthogonal Frequency Division Multiplexing (OFDM) systems have recently drawn wide interests. These techniques facilitate the implementation of effective multi-user detection algorithms at the receiver. A prerequisite of their operation is the availability of an estimate of the channels’ f...

This paper studies several adaptive noise cancellation algorithms and their effectiveness in improving the quality of speech degraded by additive acoustic noise in mobile communications. The first part of this paper describes a personal computer system which was used to acquire test data and implement the algorithms. The algorithms studied include Least Mean Squares (LMS), Recursive Least Squar...

The transmission behaviour of a distributed Bragg reector (DBR) with surface dielectric gratings on top and bottom is studied. The transmission shows a comb-like spectrum in the DBR band gap, which is explained in the Fano picture. The number density of the transmission peaks increases with increasing number of cells of the DBR, while the ratio of the average full width at half maximum to the c...

This paper shows that it is possible for an adaptive transversal prediction filter to outperform the fixed Wiener predictor of the same length for narrowband input signal embedded in Added White Gaussian Noise (AWGN). The error transfer function approach, which takes into account of the correlation of predictor error feedback and input signal, is derived for stationary and chirped input signals...

The usefulness of SNR as a figure of merit to quantify the narrowband interference rejection capability of a DS receiver is examined. The interference considered is a peaked autoregressive Gaussian process. The probability of error and SNR estimates of a Kalman, a modified Kalman, and a nonlinear filter proposed in [2] are obtained by simulation. Based on this simulation study and the available...