We report a method to generate phase-only diffractive beam splitters allowing asymmetry of the target diffracted orders, as well as providing a tailored phase difference between the diffracted orders. We apply a well-established design method that requires the determination of a set of numerical parameters, and avoids the use of image iterative algorithms. As a result, a phase lookup table is d...

We analyze the on-line chain partitioning problem as a two-person game. One person builds an order one point at a time. The other person responds by making an irrevocable assignment of the new point to a chain of a chain partition. Kierstead gave a strategy showing that width k orders can be on-line chain partitioned into (5 k ?1)=4 chains. We rst prove that width two orders can be partitioned ...

We present a direct proof of the consistency of the existence of a five element basis for the uncountable linear orders. Our argument is based on the approach of Larson, Koenig, Moore and Velickovic and simplifies the original proof of Moore.

1. INTRODUCTION. The object of this paper is to make an observation connecting Goldbach's conjecture, the crystallographic restriction, and the orders of the elements of the symmetric group. First recall that for an element g of a group G the order Ord(g) of g is defined to be the smallest natural number such that g

The purpose of this note is to demonstrate that a weak form of club guessing on ω1 implies the existence of an Aronszajn line with no Countryman suborders. An immediate consequence is that the existence of a five element basis for the uncountable linear orders does not follow from the forcing axiom for ω-proper forcings.

We develop a method of reducing the size of quantum minors in the algebra of quantum matrices Oq(Mn). We use the method to show that the quantum determinantal factor rings of Oq(Mn(C)) are maximal orders, for q an element of C transcendental over Q. 2000 Mathematics subject classification: 16P40, 16W35, 20G42.

We construct a solvable group G of order 5 648 590 729 620 such that the set of element orders of G coincides with that of the simple group S4(3). This completes the determination of finite simple groups isospectral to solvable groups.

We present a direct proof of the consistency of the existence of a five element basis for the uncountable linear orders. Our argument is based on the approach of Larson, Koenig, Moore and Velickovic and simplifies the original proof of Moore.

We propose a probabilistic version of the Markowitz portfolio problem with proportional transaction costs. We derive equivalent convex reformulations, and analyze their computational efficiency for solving large (up to 2000 securities) portfolio problems. There is a great disparity in the solution times. The time differential between formulations can reach several orders of magnitude for the la...

, The WWW is two orders of magnitude larger than the largest corpora. Although noisy, web text presents language as it is used, and statistics derived from the Web can have practical uses in many NLP applications. For this reason, the WWW should be seen and studied as any other computationally available linguistic resource. In this article, we illustrate this by showing that an Example-Based ap...