Generalized optical logic elements - GOLEs

A Generalized Optical Logic Element or GOLE is device that performs any of the 16 Boolean logic operations on signals in an optical beam with very fast switching among functions. The advantages of a generalized or universal gate in manufacturing are obvious. Extremely flexible functioning becomes possible if the GOLE functionality is switched in response to earlier computations. Likewise Field Programmable Gate Arrays or FPGAs can be used to fix the GOLE functions, making one of the most powerful and flexible processor units ever designed - called a Field GOLE. Such systems can be made in bulk optics to utilize Spatial Light Modulator or SLM capabilities, but integrated optics on silicon will be the choice for most applications. GOLEs can be generalized in several ways to become Fredkin gates and generalized Fredkin gates. They can also be cascaded similarly to electronic gates.     

The probability of generating a soluble subgroup of a finite group

It is proved that for finite groups G, the probability thattwo randomly chosen elements of G generate a soluble subgrouptends to zero as the index of the largest soluble normal subgroupof G tends to infinity.     

Is life improbable?

E. P. Wigner's argument that the probability of the existence of self-reproducing units, e.g., organisms, is zero according to standard quantum theory is stated and analyzed. Theorems are presented which indicate that Wigner's mathematical result in fact should not be interpreted as asserting the improbability of self-reproducing units.     

Expedient synthesis of villosin and its isomer (E)-labda-8(17),12,14-trien-15(16)-olide

The synthesis of the title compounds has been achieved in concise, highly regiocontrolled fashion from commercially available (+)-sclareolide. In addition, we offer evidence that the structure of a newly reported natural product from Zingiber ottensii is incorrect.     

On then-cutset property

For a partially ordered setP and an elementx ofP, a subsetS ofP is called a cutset forx inP if every element ofS is noncomparable tox and every maximal chain ofP meets {x}∪S. We letc(P) denote the smallest integerk such that every elementx ofP has a cutsetS with ‖S‖?k: Ifc(P)?n we say thatP has then-cutset property. Our results bear on the following question: givenP, what is the smallestn such thatP can be embedded in a partially ordered set having then-cutset property? As usual, 2 ⁿ denotes the Boolean lattice of all subsets of ann-element set, andB _n denotes the set of atoms and co-atoms of 2 ⁿ . We establish the following results: (i) a characterization, by means of forbidden configurations, of whichP can be embedded in a partially ordered set having the 1-cutset property; (ii) ifP contains a copy of 2 ⁿ , thenc(P)?2^[n/2]?1; (iii) for everyn>3 there is a partially ordered setP containing 2 ⁿ such thatc(P)<c(2 ⁿ ); (iv) for every positive integern there is a positive integerN such that, ifB _m is contained in a partially ordered set having then-cutset property, thenm?N.     

Infinite products for power series

An algorithm is introduced and shown to lead to a unique infinite product representation for a given formal power series A(z) with A(0) = 1. The infinite product is , where all b_n ≠ 0, r_n , and r_n+1 > r_n. The degree of approximation by the polynomial (1 + b₁z^r₁) · · · (1 + b_nz^r_n) is also considered.     

A C-symplectic free -manifold with contractible orbits and

An interesting question in symplectic geometry concerns whether or not a closed symplectic manifold can have a free symplectic circle action with orbits contractible in the manifold. Here we present a c-symplectic example, thus showing that the problem is truly geometric as opposed to topological. Furthermore, we see that our example is the only known example of a c-symplectic manifold having non-trivial fundamental group and Lusternik-Schnirelmann category precisely half its dimension.