We introduce the notion of higher dimensional transition systems as a model of concurrency providing an elementary, set-theoretic formalisation of the idea of higher dimensional transition. We show an embedding of the category of higher dimensional transition systems into that of higher dimensional automata which cuts down to an equivalence when we restrict to non-degenerate automata. Moreover,...

The dual of a true concurrency schedule appears to be a false concurrency automaton, a paradox we resolved in a previous paper by extending the latter to higher dimensions. This extension may be formalized via such discrete geometries as n-categories, simplicial complexes, cubical complexes, and Chu spaces. We advocate the last as having a clear notion of event, a well-defined process algebra u...

We present a method of constructing ccc forcings: Suppose first that a continuous, commutative system of complete embeddings between countable forcings indexed along ω1 is given. Then its direct limit satisfies ccc by a well-known theorem on finite support iterations. However, this limit has size at most ω1. To get larger forcings, we do not consider linear systems but higher-dimensional system...

We define the higher dimensional hexagonal graphs as the generalization of a triangular plane tessellation, and consider it as a multiprocessor interconnection network. Nodes in a k-dimensional (k-D) hexagonal network are placed at the vertices of a k-D triangular tessellation, so that each node has up to 2k þ 2 neighbors. In this paper, we propose a simple addressing scheme for the nodes, whic...

We provide the basics of a 2-dimensional theory of automata on series-parallel biposets. We define recognizable, regular and rational sets of series-parallel biposets and study their relationship. Moreover, we relate these classes to languages of series-parallel biposets definable in monadic second-order logic.

We report on a high-speed quantum cryptography system that utilizes simultaneous entanglement in polarization and in “time-bins”. With multiple degrees of freedom contributing to the secret key, we can achieve over ten bits of random entropy per detected coincidence. In addition, we collect from multiple spots o the downconversion cone to further amplify the data rate to achieve over 10 Mbits o...

Technical results are presented on motion in N (> 4)D manifolds to clarify the physics of Kaluza-Klein theory, brane theory and string theory. The so-called canonical or warp metric in 5D effectively converts the manifold from a coordinate space to a momentum space, resulting in a new force (per unit mass) parallel to the 4D velocity. The form of this extra force is actually independent of the ...

1. Rational points. A classical conjecture of Mordell states that a curve of genus ^ 2 over the rational numbers has only a finite number of rational points. Let K be a finitely generated field over the rational numbers. Then the same statement should hold for a curve defined over K, and a specialization argument due to Néron shows in fact that this latter statement is implied by the correspond...

Three groups F ⊆ T ⊆ V , known as Thompson groups, have generated interest since R. J. Thompson introduced them in the late 1960s. Part of their initial interest was the fact that T and V supplied the first known examples of infinite, simple, finitely presented groups. Since then, other properties of the groups have been studied as well as their interaction with other areas of mathematics. The ...

In this paper we will study the number-theoretical properties of the expression v1 nkal rcka,, d(p; a I . . . . . an) = ( 1) n/2 ~ cot cot (1) k=l P P and of related finite trigonometric sums. In Eq. (I), p is a positive integer, a~ . . . . . a, are integers prime to p, and n is even (for n odd the sum is clearly equal to zero). There are two reasons for being interested in sums of this type. F...