Ultrashort optical pulses have a variety of applications, one of which is the development of optical time-devision multiplexing (OTDM) networks. Data is encoded in these short optical pulses (typically a few picoseconds in length) which are then interleaved in time to provide very high data rates on a single wavelength. Wavelengthdivision multiplexing (WDM) uses multiple channels by interleavin...

The design, production and characterization of tailored printable optical filters for visible optical communications are demonstrated. As result, the average color difference between the specified and the produced filters is 32.6, quantified in terms of CIELAB coordinates.

We use mode multiplexing and demultiplexing in apodized aperiodically poled lithium niobate waveguides to enable characterization of picosecond optical pulses in a collinear but background-free way using autocorrelation and second-harmonic frequency-resolved optical gating.

We show that the norm graph constructed in [13] with n vertices about 1 2n 2−1/t edges, which contains no copy of Kt,(t−1)!+1, does not contain a copy of Kt+1,(t−1)!−1.

In this paper we investigate the closure ~-* under substitution-composition of a family of graphs ~,, defined by a set Lr of forbidden configurations. We first prove that ~-* can be defined by a set L~* of forbidden subgraphs. Next, using a counterexample we show that ~* is not necessarily a finite set, even when .~ is finite. We then give a sufficient condition for ~* to be finite and a simple...

Logical structures for modeling agents’ reasoning about unawareness are presented where it can hold simultaneously that: (i) agents’ beliefs about whether they are fully aware need not be veracious with partitional information; and (ii) the agent is fully aware if and only if she is aware of a fixed domain of formulae. In light of (ii), all states are deemed “possible”. Semantics operate in two...

We characterise t-perfect plane triangulations by forbidden induced subgraphs. As a consequence, we obtain that a plane triangulation is h-perfect if and only if it is perfect.

A circle graph is the intersection graph of a family of chords on a circle. There is no known characterization of circle graphs by forbidden induced subgraphs that do not involve the notions of local equivalence or pivoting operations. We characterize circle graphs by a list of minimal forbidden induced subgraphs when the graph belongs to one of the following classes: linear domino graphs, P4-t...

In this note, we prove that all 2× 2 monotone grid classes are finitely based, i.e., defined by a finite collection of minimal forbidden permutations. This follows from a slightly more general result about certain 2× 2 having two monotone cells in the same row.