scholarly journals HIGH DIMENSIONAL ELLENTUCK SPACES AND INITIAL CHAINS IN THE TUKEY STRUCTURE OF NON-P-POINTS

2016 ◽  
Vol 81 (1) ◽  
pp. 237-263 ◽  
Author(s):  
NATASHA DOBRINEN
Keyword(s):  
Dense Subset ◽  
Equivalence Relations ◽  
High Dimensional ◽  
A Chain ◽  
Image Position ◽  
Topological Ramsey Space ◽  
Tukey Order

AbstractThe generic ultrafilter${\cal G}_2 $forced by${\cal P}\left( {\omega \times \omega } \right)/\left( {{\rm{Fin}} \otimes {\rm{Fin}}} \right)$was recently proved to be neither maximum nor minimum in the Tukey order of ultrafilters ([1]), but it was left open where exactly in the Tukey order it lies. We prove${\cal G}_2 $that is in fact Tukey minimal over its projected Ramsey ultrafilter. Furthermore, we prove that for each${\cal G}_2 $, the collection of all nonprincipal ultrafilters Tukey reducible to the generic ultrafilter${\cal G}_k $forced by${\cal P}\left( {\omega ^k } \right)/{\rm{Fin}}^{ \otimes k} $forms a chain of lengthk. Essential to the proof is the extraction of a dense subsetεkfrom (Fin⊗k)+which we prove to be a topological Ramsey space. The spacesεk,k≥ 2, form a hierarchy of high dimensional Ellentuck spaces. New Ramsey-classification theorems for equivalence relations on fronts on εkare proved, extending the Pudlák–Rödl Theorem for fronts on the Ellentuck space, which are applied to find the Tukey and Rudin–Keisler structures below${\cal G}_k $.

Sublattices and Initial Segments of the Degrees of Unsolvability

1970 ◽  
Vol 22 (3) ◽  
pp. 569-581 ◽  
Author(s):  
S. K. Thomason
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Lattice Theory ◽  
Initial Segment ◽  
Finite Lattice ◽  
Equivalence Relations ◽  
Finite Lattices ◽  
Image Position ◽  
Degrees Of Unsolvability

In this paper we shall prove that every finite lattice is isomorphic to a sublattice of the degrees of unsolvability, and that every one of a certain class of finite lattices is isomorphic to an initial segment of degrees.Acknowledgment. I am grateful to Ralph McKenzie for his assistance in matters of lattice theory.1. Representation of lattices. The equivalence lattice of the set S consists of all equivalence relations on S, ordered by setting θ ≦ θ’ if for all a and b in S, a θ b ⇒ a θ’ b. The least upper bound and greatest lower bound in are given by the ⋃ and ⋂ operations:

The statistical distribution of the length of a rubber molecule

1948 ◽  
Vol 44 (3) ◽  
pp. 342-344 ◽  
Author(s):  
P. A. P. Moran
Keyword(s):  
Normal Distribution ◽  
Degrees Of Freedom ◽  
Three Dimensional ◽  
Statistical Distribution ◽  
Equal Length ◽  
Fixed Angle ◽  
A Chain ◽  
Image Position ◽  
Three Degrees Of Freedom

A rubber molecule containing n + 1 carbon atoms may be represented by a chain of n links of equal length such that successive links are at a fixed angle to each other but are otherwise at random. The statistical distribution of the length of the molecule, that is, the distance between the first and last carbon atoms, has been considered by various authors (Treloar (1) gives references). In particular, if the first atom is kept fixed at the origin of a system of coordinates and the chain is otherwise at random, it has been conjectured that the distribution of the (n + 1)th atom will tend, as n increases, towards a three-dimensional normal distribution of the formwhere σ depends on n. Thus r2 (= x2 + y2 + z2) will be approximately distributed as σ2χ2 with three degrees of freedom.

COEXISTENCE OF LOW- AND HIGH-DIMENSIONAL SPATIOTEMPORAL CHAOS IN A CHAIN OF DISSIPATIVELY COUPLED CHUA’S CIRCUITS

1994 ◽  
Vol 04 (03) ◽  
pp. 639-674 ◽  
Author(s):  
A.L. ZHELEZNYAK ◽  
L.O. CHUA
Keyword(s):  
Phase Space ◽  
Initial Conditions ◽  
Coupling Parameter ◽  
Reaction Diffusion ◽  
Cellular Neural Network ◽  
Spatiotemporal Chaos ◽  
Matrix Phase ◽  
High Dimensional ◽  
The Matrix ◽  
A Chain

Spatiotemporal dynamics of a one-dimensional cellular neural network (CNN) made of Chua’s circuits which mimics a reaction-diffusion medium is considered. An approach is presented to analyse the properties of this reaction-diffusion CNN through the characteristics of the attractors of an associated infinite-dimensional dynamical system with a matrix phase space. Using this approach, the spatiotemporal correlation dimension of the CNN’s spatiotemporal patterns is computed over various ranges of the diffusion coupling parameter, length of the chain, and initial conditions. It is shown that in a finite-dimensional projection of the matrix phase space of the CNN, both low- and high-dimensional attractors corresponding to different initial conditions coexist.

scholarly journals FINITARY REDUCIBILITY ON EQUIVALENCE RELATIONS

2016 ◽  
Vol 81 (4) ◽  
pp. 1225-1254 ◽  
Author(s):  
RUSSELL MILLER ◽  
KENG MENG NG
Keyword(s):  
Equivalence Relation ◽  
Equivalence Relations ◽  
Arithmetical Hierarchy ◽  
Natural Equivalence ◽  
Image Position ◽  
The Way

AbstractWe introduce the notion of finitary computable reducibility on equivalence relations on the domainω. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular, whereas no equivalence relation can be${\rm{\Pi }}_{n + 2}^0$-complete under computable reducibility, we show that, for everyn, there does exist a natural equivalence relation which is${\rm{\Pi }}_{n + 2}^0$-complete under finitary reducibility. We also show that our hierarchy of finitary reducibilities does not collapse, and illustrate how it sharpens certain known results. Along the way, we present several new results which use computable reducibility to establish the complexity of various naturally defined equivalence relations in the arithmetical hierarchy.

STONE SPACE OF CYLINDRIC ALGEBRAS AND TOPOLOGICAL MODEL SPACES

2016 ◽  
Vol 81 (3) ◽  
pp. 1069-1086
Author(s):  
CHARLES C. PINTER
Keyword(s):  
Boolean Algebra ◽  
Model Theory ◽  
Representation Theorem ◽  
Stone Space ◽  
Equivalence Relations ◽  
Cylindric Algebra ◽  
Cylindric Algebras ◽  
Locally Finite ◽  
Abstract Model Theory ◽  
Image Position

AbstractThe Stone representation theorem was a milestone for the understanding of Boolean algebras. From Stone’s theorem, every Boolean algebra is representable as a field of sets with a topological structure. By means of this, the structural elements of any Boolean algebra, as well as the relations between them, are represented geometrically and can be clearly visualized. It is no different for cylindric algebras: Suppose that ${\frak A}$ is a cylindric algebra and ${\cal S}$ is the Stone space of its Boolean part. (Among the elements of the Boolean part are the diagonal elements.) It is known that with nothing more than a family of equivalence relations on ${\cal S}$ to represent quantifiers, ${\cal S}$ represents the full cylindric structure just as the Stone space alone represents the Boolean structure. ${\cal S}$ with this structure is called a cylindric space.Many assertions about cylindric algebras can be stated in terms of elementary topological properties of ${\cal S}$. Moreover, points of ${\cal S}$ may be construed as models, and on that construal ${\cal S}$ is called a model space. Certain relations between points on this space turn out to be morphisms between models, and the space of models with these relations hints at the possibility of an “abstract” model theory. With these ideas, a point-set version of model theory is proposed, in the spirit of pointless topology or category theory, in which the central insight is to treat the semantic objects (models) homologously with the corresponding syntactic objects so they reside together in the same space.It is shown that there is a new, purely algebraic way of introducing constants in cylindric algebras, leading to a simplified proof of the representation theorem for locally finite cylindric algebras. Simple rich algebras emerge as homomorphic images of cylindric algebras. The topological version of this theorem is especially interesting: The Stone space of every locally finite cylindric algebra ${\frak A}$ can be partitioned into subspaces which are the Stone spaces of all the simple rich homomorphic images of ${\frak A}$. Each of these images completely determines a model of ${\frak A}$, and all denumerable models of ${\frak A}$ appear in this representation.The Stone space ${\cal S}$ of every cylindric algebra can likewise be partitioned into closed sets which are duals of all the types in ${\frak A}$. This fact yields new insights into miscellaneous results in the model theory of saturated models.

A ratio limit theorem for (sub) Markov chains on {1,2, …} with bounded jumps

1995 ◽  
Vol 27 (3) ◽  
pp. 652-691 ◽  
Author(s):  
Harry Kesten
Keyword(s):  
Harmonic Function ◽  
Invariant Measure ◽  
Probability Measure ◽  
Markov Chains ◽  
Positive Matrices ◽  
Ratio Limit Theorems ◽  
Ratio Limit ◽  
A Chain ◽  
Image Position ◽  
Quasi Stationary Distribution

We consider positive matrices Q, indexed by {1,2, …}. Assume that there exists a constant 1 L < ∞ and sequences u1< u2< · ·· and d1d2< · ·· such that Q(i, j) = 0 whenever i < ur < ur + L < j or i > dr + L > dr > j for some r. If Q satisfies some additional uniform irreducibility and aperiodicity assumptions, then for s > 0, Q has at most one positive s-harmonic function and at most one s-invariant measure µ. We use this result to show that if Q is also substochastic, then it has the strong ratio limit property, that is for a suitable R and some R–1-harmonic function f and R–1-invariant measure µ. Under additional conditions µ can be taken as a probability measure on {1,2, …} and exists. An example shows that this limit may fail to exist if Q does not satisfy the restrictions imposed above, even though Q may have a minimal normalized quasi-stationary distribution (i.e. a probability measure µ for which R–1µ = µQ).The results have an immediate interpretation for Markov chains on {0,1,2, …} with 0 as an absorbing state. They give ratio limit theorems for such a chain, conditioned on not yet being absorbed at 0 by time n.

scholarly journals Corners Over Quasirandom Groups

2017 ◽  
Vol 26 (6) ◽  
pp. 944-951
Author(s):  
PAVEL ZORIN-KRANICH
Keyword(s):  
Dense Subset ◽  
Formula Group ◽  
Image Position

Let G be a finite D-quasirandom group and A ⊂ Gk a δ-dense subset. Then the density of the set of side lengths g of corners $$ \{(a_{1},\dotsc,a_{k}),(ga_{1},a_{2},\dotsc,a_{k}),\dotsc,(ga_{1},\dotsc,ga_{k})\} \subset A $$ converges to 1 as D → ∞.

scholarly journals BINARY PRIMITIVE HOMOGENEOUS SIMPLE STRUCTURES

2017 ◽  
Vol 82 (1) ◽  
pp. 183-207 ◽  
Author(s):  
VERA KOPONEN
Keyword(s):  
Algebraic Closure ◽  
The Other ◽  
Equivalence Relations ◽  
Complete Theory ◽  
Future Research ◽  
Random Structure ◽  
Homogeneous Structures ◽  
Image Position

AbstractSuppose that ${\cal M}$ is countable, binary, primitive, homogeneous, and simple. We prove that the SU-rank of the complete theory of ${\cal M}$ is 1 and hence 1-based. It follows that ${\cal M}$ is a random structure. The conclusion that ${\cal M}$ is a random structure does not hold if the binarity condition is removed, as witnessed by the generic tetrahedron-free 3-hypergraph. However, to show that the generic tetrahedron-free 3-hypergraph is 1-based requires some work (it is known that it has the other properties) since this notion is defined in terms of imaginary elements. This is partly why we also characterize equivalence relations which are definable without parameters in the context of ω-categorical structures with degenerate algebraic closure. Another reason is that such characterizations may be useful in future research about simple (nonbinary) homogeneous structures.

Maximal branching processes and ‘long-range percolation’

1970 ◽  
Vol 7 (01) ◽  
pp. 89-98
Author(s):  
John Lamperti
Keyword(s):  
Probability Distribution Function ◽  
Branching Process ◽  
Branching Processes ◽  
Random Variables ◽  
Random Variable ◽  
Independent Random Variables ◽  
Transition Matrices ◽  
A Chain ◽  
Image Position ◽  
The Right

In the first part of this paper, we will consider a class of Markov chains on the non-negative integers which resemble the Galton-Watson branching process, but with one major difference. If there are k individuals in the nth “generation”, and are independent random variables representing their respective numbers of offspring, then the (n + 1)th generation will contain max individuals rather than as in the branching case. Equivalently, the transition matrices Pij of the chains we will study are to be of the form where F(.) is the probability distribution function of a non-negative, integervalued random variable. The right-hand side of (1) is thus the probability that the maximum of i independent random variables distributed by F has the value j. Such a chain will be called a “maximal branching process”.

Sign in / Sign up

Export Citation Format

Share Document