Free and projective Banach lattices

We define and prove the existence of free Banach lattices in the category of Banach lattices and contractive lattice homomorphisms, and establish some of their fundamental properties. We give much more detailed results about their structure in the case when there are only a finite number of generators, and give several Banach lattice characterizations of the number of generators being, respectively, one, finite or countable. We define a Banach lattice P to be projective if, whenever X is a Banach lattice, J is a closed ideal in X, Q : X → X/J is the quotient map, T: P → X/J is a linear lattice homomorphism and ε > 0, there exists a linear lattice homomorphism : P → X such thatT = Q º and ∥∥ ≤ (1 + ε)∥T∥. We establish the connection between projective Banach lattices and free Banach lattices, describe several families of Banach lattices that are projective and prove that some are not.

Distinguished algebraic semantics for t-norm based fuzzy logics:Methods and algebraic equivalencies

This paper is a contribution to Mathematical fuzzy logic, in particular to the algebraic study of t-norm based fuzzy logics. In the general framework of propositional core and ?-core fuzzy logics we consider three properties of completeness with respect to any semantics of linearly ordered algebras. Useful algebraic characterizations of these completeness properties are obtained and their relations are studied. Moreover, we concentrate on five kinds of distinguished semantics for these logics-namely the class of algebras defined over the real unit interval, the rational unit interval, the hyperreals (all ultrapowers of the real unit interval), the strict hyperreals (only ultrapowers giving a proper extension of the real unit interval) and finite chains, respectively-and we survey the known completeness methods and results for prominent logics. We also obtain new interesting relations between the real, rational and (strict) hyperreal semantics, and good characterizations for the completeness with respect to the semantics of finite chains. Finally, all completeness properties and distinguished semantics are also considered for the first-order versions of the logics where a number of new results are proved. © 2009 Elsevier B.V. All rights reserved.

Tensor products of subspace lattices and rank one density

We show that, if M is a subspace lattice with the property that the rank one subspace of its operator algebra is weak* dense, L is a commutative subspace lattice and P is the lattice of all projections on a separable Hilbert space, then L⊗M⊗P is reflexive. If M is moreover an atomic Boolean subspace lattice while L is any subspace lattice, we provide a concrete lattice theoretic description of L⊗M in terms of projection valued functions defined on the set of atoms of M . As a consequence, we show that the Lattice Tensor Product Formula holds for AlgM and any other reflexive operator algebra and give several further corollaries of these results.

Entanglement properties of spin models in triangular lattices

The different quantum phases appearing in strongly correlated systems as well as their transitions are closely related to the entanglement shared between their constituents. In 1D systems, it is well established that the entanglement spectrum is linked to the symmetries that protect the different quantum phases. This relation extends even further at the phase transitions where a direct link associates the entanglement spectrum to the conformal field theory describing the former. For 2D systems much less is known. The lattice geometry becomes a crucial aspect to consider when studying entanglement and phase transitions. Here, we analyze the entanglement properties of triangular spin lattice models by also considering concepts borrowed from quantum information theory such as geometric entanglement.

Lattice-based Encryption Over Standard Lattices in Hardware

Lattice-based cryptography has gained credence recently as a replacement for current public-key cryptosystems, due to its quantum-resilience, versatility, and relatively low key sizes. To date, encryption based on the learning with errors (LWE) problem has only been investigated from an ideal lattice standpoint, due to its computation and size efficiencies. However, a thorough investigation of standard lattices in practice has yet to be considered. Standard lattices may be preferred to ideal lattices due to their stronger security assumptions and less restrictive parameter selection process. In this paper, an area-optimised hardware architecture of a standard lattice-based cryptographic scheme is proposed. The design is implemented on a FPGA and it is found that both encryption and decryption fit comfortably on a Spartan-6 FPGA. This is the first hardware architecture for standard lattice-based cryptography reported in the literature to date, and thus is a benchmark for future implementations.
Additionally, a revised discrete Gaussian sampler is proposed which is the fastest of its type to date, and also is the first to investigate the cost savings of implementing with lamda_2-bits of precision. Performance results are promising in comparison to the hardware designs of the equivalent ring-LWE scheme, which in addition to providing a stronger security proof; generate 1272 encryptions per second and 4395 decryptions per second.

A monoidal algebraic model for rational SO(2)-spectra

The category of rational SO(2)--equivariant spectra admits an algebraic model. That is, there is an abelian category A(SO(2)) whose derived category is equivalent to the homotopy category of rational$SO(2)--equivariant spectra. An important question is: does this algebraic model capture the smash product of spectra? The category A(SO(2)) is known as Greenlees' standard model, it is an abelian category that has no projective objects and is constructed from modules over a non--Noetherian ring. As a consequence, the standard techniques for constructing a monoidal model structure cannot be applied. In this paper a monoidal model structure on A(SO(2)) is constructed and the derived tensor product on the homotopy category is shown to be compatible with the smash product of spectra. The method used is related to techniques developed by the author in earlier joint work with Roitzheim. That work constructed a monoidal model structure on Franke's exotic model for the K_(p)--local stable homotopy category. A monoidal Quillen equivalence to a simpler monoidal model category that has explicit generating sets is also given. Having monoidal model structures on the two categories removes a serious obstruction to constructing a series of monoidal Quillen equivalences between the algebraic model and rational SO(2)--equivariant spectra.

Mathematical prerequisites for learning statistics in Psychology: Assessing core skills of numeracy and mathematical reasoning among undergraduates.

This study sought to extend earlier work by Mulhern and Wylie (2004) to investigate a UK-wide sample of psychology undergraduates. A total of 890 participants from eight universities across the UK were tested on six broadly defined components of mathematical thinking relevant to the teaching of statistics in psychology - calculation, algebraic reasoning, graphical interpretation, proportionality and ratio, probability and sampling, and estimation. Results were consistent with Mulhern and Wylie's (2004) previously reported findings. Overall, participants across institutions exhibited marked deficiencies in many aspects of mathematical thinking. Results also revealed significant gender differences on calculation, proportionality and ratio, and estimation. Level of qualification in mathematics was found to predict overall performance. Analysis of the nature and content of errors revealed consistent patterns of misconceptions in core mathematical knowledge , likely to hamper the learning of statistics.

Natural three-qubit interactions in one-way quantum computing

We address the effects of natural three-qubit interactions on the computational power of one-way quantum computation. A benefit of using more sophisticated entanglement structures is the ability to construct compact and economic simulations of quantum algorithms with limited resources. We show that the features of our study are embodied by suitably prepared optical lattices, where effective three-spin interactions have been theoretically demonstrated. We use this to provide a compact construction for the Toffoli gate. Information flow and two-qubit interactions are also outlined, together with a brief analysis of relevant sources of imperfection.

WAVES IN 2D ANISOTROPIC L-C LATTICE METAMATERIALS:PHENOMENOLOGY AND PROPERTIES

Anisotropic metamaterials composed of 2D periodic infi- nite and finite periodic lattices of lumped inductor (L) and capacitor (C) circuits have been explored. The unique features of wave channeling on such anisotropic lattices and scattering at their interfaces and edges are reviewed and illustrated by the examples of the specific arrangements. The lattice unit cells composed of inductors and capacitors (basic mesh) as well as of assemblies comprised of double series, double parallel, and mixed parallel-series L-C circuits are discussed.

Polynomials on Banach spaces with unconditional bases

We study the classes of homogeneous polynomials on a Banach space with unconditional Schauder basis that have unconditionally convergent monomial expansions relative to this basis. We extend some results of Matos, and we show that the homogeneous polynomials with unconditionally convergent expansions coincide with the polynomials that are regular with respect to the Banach lattices structure of the domain.