Related papers: A survey of clones on infinite sets
Code clone detection is involved with detecting duplicated fragments of code within a code base. Detecting these clones is useful for maintenance operations which require editing the clones. The tools developed are expected to be robust…
To convert a fractional solution to an instance of a constraint satisfaction problem into a solution, a rounding scheme is needed, which can be described by a collection of symmetric operations with one of each arity. An intriguing…
Permutation clones generalise permutation groups and clone theory. We investigate permutation clones defined by relations, or equivalently, the automorphism groups of powers of relations. We find many structural results on the lattice of…
We investigate finitary functions from $\mathbb{Z}_{n}$ to $\mathbb{Z}_{n}$ for a squarefree number $n$. We show that the lattice of all clones on the squarefree set $\mathbb{Z}_{p_1\cdots p_m}$ which contain the addition of…
It is known that a countable $\omega$-categorical structure interprets all finite structures primitively positively if and only if its polymorphism clone maps to the clone of projections on a two-element set via a continuous clone…
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
In this paper we introduce the concept of completeness of sets. We study this property on the set of integers. We examine how this property is preserved as we carry out various operations compatible with sets. We also introduce the problem…
In this paper we show that if X is an infinite compactum cleavable over an ordinal, then X must be homeomorphic to an ordinal. X must also therefore be a LOTS. This answers two fundamental questions in the area of cleavability. We also…
It is shown that the set of all finitary consequence operators defined on any nonempty language is a join-complete lattice. This result is applied to various collections of physical theories to obtain an unrestricted supremum unification.
We introduce the notions of kernel map and kernel set of a bounded linear operator on a Hilbert space relative to a subspace lattice. The characterization of the kernel maps and kernel sets of finite rank operators leads to showing that…
In this paper we extend the notion of a Lorentz cone. We call a closed convex set isotone projection set with respect to a pointed closed convex cone if the projection onto the set is isotone (i.e., monotone) with respect to the order…
A closure endomorphism of a Hilbert algebra A is a mapping that is simultaneously an endomorphism of and a closure operator on A. It is known that the set CE of all closure endomorphisms of A is a distributive lattice where the meet of two…
In order to better understand the structure of closed collections of reversible gates, we investigate the lattice of closed sets and the maximal members of this lattice. In this note, we find the maximal closed sets over a finite alphabet.…
A residuated lattice is defined to be integrally closed if it satisfies the equations x\x = e and x/x = e. Every integral, cancellative, or divisible residuated lattice is integrally closed, and, conversely, every bounded integrally closed…
Solution sets of systems of homogeneous linear equations over fields are characterized as being subspaces, i.e., sets that are closed under linear combinations. Our goal is to characterize solution sets of systems of equations over…
By definition, the intersection of finitely many open sets of any topological space is open. Nachbin observed that, more generally, the intersection of compactly many open sets is open. Moreover, Nachbin applied this to obtain elegant…
Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a…
Cloning is a general approach to create new functionality within variants as well as new system variants. It is a fast, flexible, intuitive, and economical approach to evolve systems in the short run. However, in the long run, the…
We give a formal treatment of simple type theories, such as the simply-typed $\lambda$-calculus, using the framework of abstract clones. Abstract clones traditionally describe first-order structures, but by equipping them with additional…
An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…