Speckle metrology employing LCTV spatial light modulators

Liquid crystal televisions have been employed as spatial light modulators in a variety of optical image processing applications. We have used such devices to develop techniques in speckle metrology for the electronic addition of speckle patterns and the display of speckle correlation, and also for the real-time display of object motion. Factors which affect the performance in terms of the useful working range and the accuracy of displacement measurement are discussed. Some modifications to the LCTV which should increase the potential of these devices as spatial light modulators, when used in both amplitude and phase modulation, are considered briefly.     

Differential equations over polynomially bounded o-minimal structures

We investigate the asymptotic behavior at of non-oscillatory solutions to differential equations a$">, where is definable in a polynomially bounded o-minimal structure. In particular, we show that the Pfaffian closure of a polynomially bounded o-minimal structure on the real field is levelled.

     

Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints

We consider a canonical Ramsey type problem. An edge‐coloring of a graph is called m‐good if each color appears at most m times at each vertex. Fixing a graph G and a positive integer m, let f(m, G) denote the smallest n such that every m‐good edge‐coloring of K_n yields a properly edge‐colored copy of G, and let g(m, G) denote the smallest n such that every m‐good edge‐coloring of K_n yields a rainbow copy of G. We give bounds on f(m, G) and g(m, G). For complete graphs G = K_t, we have c₁mt²/ln t ≤ f(m, K_t) ≤ c₂mt², and cmt³/ln t ≤ g(m, K_t) ≤ cmt³/ln t, where c₁, c₂, c, c are absolute constants. We also give bounds on f(m, G) and g(m, G) for general graphs G in terms of degrees in G. In particular, we show that for fixed m and d, and all sufficiently large n compared to m and d, f(m, G) = n for all graphs G with n vertices and maximum degree at most d. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2003     

Photoemission studies of clean and oxygen-covered Pt 6(111) × (100)

Employing the enhanced sensitivity obtained by using synchrotron radiation near the Cooper minimum for the 5d valence electrons, we have located the oxygen 2p and 2s levels for oxygen chemisorbed on a Pt 6(111) × (100) crystal. We find the oxygen 2p level located ?6 eV with a FWHM of 3 eV and the 2s at ?21.6 eV. A factor of four difference in saturation coverage is measured between temperatures of 300 and 120 K, but the position and width of the 2p level is independent of temperature. We observe also the 1b₁ orbital of weakly adsorbed H₂O molecules, which has pure O 2p parentage; from the intensity of this orbital, we are able to suggest why it is difficult to observe the oxygen 2p signal at low photon energies. In addition, we note a strong preferential attenuation in the Pt states near E_f for the adsorbed H₂O in spite of the weak nature of the bond.     

Non-Cayley Vertex-Transitive Graphs of Order Twice the Product of Two Odd Primes

For a positive integer n, does there exist a vertex-transitive graph Γ on n vertices which is not a Cayley graph, or, equivalently, a graph Γ on n vertices such that Aut Γ is transitive on vertices but none of its subgroups are regular on vertices? Previous work (by Alspach and Parsons, Frucht, Graver and Watkins, Marusic and Scapellato, and McKay and the second author) has produced answers to this question if n is prime, or divisible by the square of some prime, or if n is the product of two distinct primes. In this paper we consider the simplest unresolved case for even integers, namely for integers of the form n = 2pq, where 2 < q < p, and p and q are primes. We give a new construction of an infinite family of vertex-transitive graphs on 2pq vertices which are not Cayley graphs in the case where p ≡ 1 (mod q). Further, if p ? 1 (mod q), p ≡ q ≡ 3(mod 4), and if every vertex-transitive graph of order pq is a Cayley graph, then it is shown that, either 2pq = 66, or every vertex-transitive graph of order 2pq admitting a transitive imprimitive group of automorphisms is a Cayley graph.     

Unsolvable Problems About Small Cancellation and Word Hyperbolic Groups

We apply a construction of Rips to show that a number of algorithmicproblems concerning certain small cancellation groups and, inparticular, word hyperbolic groups, are recursively unsolvable.Given any integer k > 2, there is no algorithm to determinewhether or not any small cancellation group can be generatedby either two elements or more than k elements. There is a smallcancellation group E such that there is no algorithm to determinewhether or not any finitely generated subgroup of E is all ofE, or is finitely presented, or has a finitely generated secondintegral homology group.