Recent developments in microbial techniques (such as PCR, GE, FISH) have allowed researchers to detect, identify and quantify microorganisms without the limitation of culture-dependent methods. This has given both engineers and scientists a more fundamental understanding about systems containing microorganisms. These techniques can be used to monitor bacteria in wastewater treatment systems, so...

The higher rank numerical range is useful for constructing quantum error correction code for a noisy quantum channel. It is known that if a normal matrix A ∈ Mn has eigenvalues a1, . . . , an, then its rank-k numerical range Λk(A) is the intersection of convex polygons with vertices aj1 , . . . , ajn−k+1 , where 1 ≤ j1 < · · · < jn−k+1 ≤ n. In this paper, it is shown that the higher rank numeri...

We study the higher-order nonlinear dispersive equation ∂tu+ ∂ 2j+1 x u = ∑ 0≤j1+j2≤2j aj1,j2∂ j1 x u∂ j2 x u, x, t ∈ R. where u is a real(or complex-) valued function. We show that the associated initial value problem is well posed in weighted Besov and Sobolev spaces for small initial data. We also prove ill-posedness results when a0,k 6= 0 for some k > j, in the sense that this equation cann...

Given integers d 1, and g 2, a g-addition chain for d is a sequence of integers a0 = 1, a1, a2, . . . , ar 1, ar = d where ai = aj1 +aj2 + · · ·+ajk , with 2  k  g, and 0  j1  j2  · · ·  jk  i 1. The length of a g-addition chain is r, the number of terms following 1 in the sequence. We denote by lg(d) the length of a shortest addition chain for d. Many results have been established in th...

We give the first computer free proof of the uniqueness of groups of type Ly. We also show that certain simpicial complexes associated to the Lyons group Ly have the same homotopy type as the Quillen complex for Ly at the prime 3; we show this complex is simply connected, and we calculate its homology. Finally we supply simplified proofs of some properties of groups of type Ly, such as the grou...

The higher rank numerical range is closely connected to the construction of quantum error correction code for a noisy quantum channel. It is known that if a normal matrix A ∈ Mn has eigenvalues a1, . . . , an, then its higher rank numerical range Λk(A) is the intersection of convex polygons with vertices aj1 , . . . , ajn−k+1 , where 1 ≤ j1 < · · · < jn−k+1 ≤ n. In this paper, it is shown that ...