Large Intervals in the Clone Lattice

نویسنده

  • MARTIN GOLDSTERN
چکیده

We give three examples of large intervals in the lattice of (local) clones on an infinite set X, by exhibiting clones C1, C2, C3 such that: (1) the interval [C1, O] in the lattice of local clones is (as a lattice) isomorphic to {0, 1, 2, . . .} under the divisibility relation, (2) the interval [C2, O] in the lattice of local clones is isomorphic to the congruence lattice of an arbitrary semilattice, (3) the interval [C3, O] in the lattice of all clones is isomorphic to the lattice of all filters on X. These examples explain the difficulty of obtaining a satisfactory analysis of the clone lattice on infinite sets. In particular, (1) shows that the lattice of local clones is not dually atomic.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

STRUCTURAL ANALYSIS AND STRUCTURAL OPTIMIZATION OF SELF-SUPPORTING TRUSS TOWERS TO SUPPORT A LARGE WIND TURBINE

This article aims to study the self-supporting truss towers used to support large wind turbines. The goal is to evaluate and validate numerically by finite element method the structural analysis when the lattice structures of the towers of wind turbines are subjected to static loads and these from common usage. With this, it is expected to minimize the cost of transportation and installation of...

متن کامل

The Minimal Clones above the Permutations

We determine the atoms of the interval of the clone lattice consisting of those clones which contain all permutations, on an infinite base set. This is equivalent to the description of the atoms of the lattice of transformation monoids above the permutations. 1. The problem and the result Let X be an infinite set of cardinality κ = אα, let O be the set of all finitary operations on X, and for a...

متن کامل

Weak Bases of Boolean Co-Clones

Universal algebra has proven to be a useful tool in the study of constraint satisfaction problems (CSP) since the complexity, up to logspace reductions, is determined by the clone of the constraint language. But two CSPs corresponding to the same clone may still differ substantially with respect to worst-case time complexity, which makes clones ill-suited when comparing running times of CSP pro...

متن کامل

Algebraic Lattices Are Complete Sublattices of the Clone Lattice over an Infinite Set

The clone lattice Cl(X) over an infinite set X is a complete algebraic lattice with 2 compact elements. We show that every algebraic lattice with at most 2 compact elements is a complete sublattice of Cl(X). 1. How complicated is the clone lattice? Fix a base set X and denote for all n ≥ 1 the set of all n-ary operations on X by O(n). Then O = ⋃ n≥1 O (n) is the set of all functions on X which ...

متن کامل

METAHEURISTIC-BASED SIZING AND TOPOLOGY OPTIMIZATION AND RELIABILITY ASSESSMENT OF SINGLE-LAYER LATTICE DOMES

Economy and safety are two important components in structural design process and stablishing a balance between them indeed results in improved structural performance specially in large-scale structures including space lattice domes. Topology optimization of geometrically nonlinear single-layer lamella, network, and geodesic lattice domes is implemented using enhanced colliding-bodies optimizati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002