A random version of Sperner's theorem

Let $\mathcal{P}(n)$ denote the power set of $[n]$, ordered by inclusion, and let $\mathcal{P}(n,p)$ be obtained from $\mathcal{P}(n)$ by selecting elements from $\mathcal{P}(n)$ independently at random with probability $p$. A classical result of Sperner asserts that every antichain in $\mathcal{P}(n)$ has size at most that of the middle layer, $\binom{n}{\lfloor n/2 \rfloor}$. In this note we prove an analogous result for $\mathcal{P} (n,p)$: If $pn \rightarrow \infty$ then, with high probability, the size of the largest antichain in $\mathcal{P}(n,p)$ is at most $(1+o(1)) p \binom{n}{\lfloor n/2 \rfloor}$. This solves a conjecture of Osthus who proved the result in the case when $pn/\log n \rightarrow \infty$. Our condition on $p$ is best-possible. In fact, we prove a more general result giving an upper bound on the size of the largest antichain for a wider range of values of $p$.Comment: 7 pages. Updated to include minor revisions and publication dat

Finite Boolean Algebras for Solid Geometry using Julia's Sparse Arrays

The goal of this paper is to introduce a new method in computer-aided geometry of solid modeling. We put forth a novel algebraic technique to evaluate any variadic expression between polyhedral d-solids (d = 2, 3) with regularized operators of union, intersection, and difference, i.e., any CSG tree. The result is obtained in three steps: first, by computing an independent set of generators for the d-space partition induced by the input; then, by reducing the solid expression to an equivalent logical formula between Boolean terms made by zeros and ones; and, finally, by evaluating this expression using bitwise operators. This method is implemented in Julia using sparse arrays. The computational evaluation of every possible solid expression, usually denoted as CSG (Constructive Solid Geometry), is reduced to an equivalent logical expression of a finite set algebra over the cells of a space partition, and solved by native bitwise operators.Comment: revised version submitted to Computer-Aided Geometric Desig

The Contextual Character of Modal Interpretations of Quantum Mechanics

In this article we discuss the contextual character of quantum mechanics in the framework of modal interpretations. We investigate its historical origin and relate contemporary modal interpretations to those proposed by M. Born and W. Heisenberg. We present then a general characterization of what we consider to be a modal interpretation. Following previous papers in which we have introduced modalities in the Kochen-Specker theorem, we investigate the consequences of these theorems in relation to the modal interpretations of quantum mechanics.Comment: 21 pages, no figures, preprint submitted to SHPM

Compatible Quantum Theory

Formulations of quantum mechanics can be characterized as realistic, operationalist, or a combination of the two. In this paper a realistic theory is defined as describing a closed system entirely by means of entities and concepts pertaining to the system. An operationalist theory, on the other hand, requires in addition entities external to the system. A realistic formulation comprises an ontology, the set of (mathematical) entities that describe the system, and assertions, the set of correct statements (predictions) the theory makes about the objects in the ontology. Classical mechanics is the prime example of a realistic physical theory. The present realistic formulation of the histories approach originally introduced by Griffiths, which we call 'Compatible Quantum Theory (CQT)', consists of a 'microscopic' part (MIQM), which applies to a closed quantum system of any size, and a 'macroscopic' part (MAQM), which requires the participation of a large (ideally, an infinite) system. The first (MIQM) can be fully formulated based solely on the assumption of a Hilbert space ontology and the noncontextuality of probability values, relying in an essential way on Gleason's theorem and on an application to dynamics due in large part to Nistico. The microscopic theory does not, however, possess a unique corpus of assertions, but rather a multiplicity of contextual truths ('c-truths'), each one associated with a different framework. This circumstance leads us to consider the microscopic theory to be physically indeterminate and therefore incomplete, though logically coherent. The completion of the theory requires a macroscopic mechanism for selecting a physical framework, which is part of the macroscopic theory (MAQM). Detailed definitions and proofs are presented in the appendice

Lattice Gas Automata for Reactive Systems

Reactive lattice gas automata provide a microscopic approachto the dynamics of spatially-distributed reacting systems. After introducing the subject within the wider framework of lattice gas automata (LGA) as a microscopic approach to the phenomenology of macroscopic systems, we describe the reactive LGA in terms of a simple physical picture to show how an automaton can be constructed to capture the essentials of a reactive molecular dynamics scheme. The statistical mechanical theory of the automaton is then developed for diffusive transport and for reactive processes, and a general algorithm is presented for reactive LGA. The method is illustrated by considering applications to bistable and excitable media, oscillatory behavior in reactive systems, chemical chaos and pattern formation triggered by Turing bifurcations. The reactive lattice gas scheme is contrasted with related cellular automaton methods and the paper concludes with a discussion of future perspectives.Comment: to appear in PHYSICS REPORTS, 81 revtex pages; uuencoded gziped postscript file; figures available from [email protected] or [email protected]