A perfectly one-factorable (P1F) regular graph G is a graph admitting a partition of the edge-set into one-factors such that the union of any two of them is a Hamiltonian cycle. We consider the case in which G is a cubic graph. The existence of a P1F cubic graph is guaranteed for each admissible value of the number of vertices. We give conditions for determining P1F graphs within a subfamily of...

The polyspectrum modeling problem using linear or quadratic filters is investigated. In the linear case, we show that, if the output pth-order cumulant function of a filter, driven by a white noise, is of finite extent, then the filter necessarily has a finite extent impulse response. Next, we establish expressions of the output polyspectrum of a quadratic filter, driven by a Gaussian white noi...

The use of Nyquist f i l ters in data transmission systems is important in avoiding intersymbol interference. Moreover, the Nyquist f i l ters should be factorable into lowpass transmitter/receiver f i l ter pairs. Here, the design problem is formulated so as t o generate zero-phase FIR lowpass Nyquist f i l ters that can be sp l i t in to min imum and maximum phase par ts . Two factorable mtni...

We study both experimentally and theoretically the generation of photon pairs by spontaneous four-wave mixing (SFWM) in standard birefringent optical fibers. The ability to produce a range of two-photon spectral states, from highly correlated (entangled) to completely factorable, by means of cross-polarized birefringent phase matching, is explored. A simple model is developed to predict the spe...