Related papers: Sorting in Lattices
Drawing inspiration from Emmy Noether'set-theoretic foundations for algebra and Charles Ehresmann's topology without points, we adopt a new order-theoretic approach to ideal theory. For this we emphasize the order of divisibility in…
It is known that the set of permutations, under the pattern containment ordering, is not a partial well-order. Characterizing the partially well-ordered closed sets (equivalently: down sets or ideals) in this poset remains a wide-open…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
One of the fundamental problem in the theory of sorting is to find the pessimistic number of comparisons sufficient to sort a given number of elements. Currently 16 is the lowest number of elements for which we do not know the exact value.…
This paper treats the variation of sets. We attempt to formulate convergence and continuity of set-valued functions in a different way from the theories on sequences of sets and correspondence. In the final section, we also attempt to…
Many latent (factorized) models have been proposed for recommendation tasks like collaborative filtering and for ranking tasks like document or image retrieval and annotation. Common to all those methods is that during inference the items…
We introduce the concept of basis for a lattice. This basis plays a vital role to determine the completeness and consistency of the lattice. Weighted lattices are introduced and its complexity is formulated. Some axiomatic systems,…
We study a sorting machine consisting of two stacks in series where the first stack has the added restriction such that entries in the stack must be in decreasing order from top to bottom. We give the basis of the class of permutations that…
It is well-known that relatively pseudocomplemented lattices can serve as an algebraic semantics of intuitionistic logic. To extend the concept of relative pseudocomplementation to non-distributive lattices, the first author introduced…
This paper discusses about a sorting algorithm which uses the concept of buckets where each bucket represents a certain number of digits. A two dimensional data structure is used where one dimension represents buckets i. e; number of digits…
A method of embedding partially ordered sets into linear spaces is presented. The problem of finding all orthocomplementations in a finite lattice is reduced to a linear programming problem.
We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…
A root system in which all roots have same norm is known as a simply laced root system. We present a simple method of classifying all simply laced root systems.
In this paper we introduce a new neural architecture for sorting unordered sequences where the correct sequence order is not easily defined but must rather be inferred from training data. We refer to this architecture as OrderNet and…
A new complexity measure named as Lattice Complexity is presented for finite symbolic sequences. This measure is based on the symbolic dynamics of one-dimensional iterative maps and Lempel-Ziv Complexity. To make Lattice Complexity…
We consider two orthogonal points of view on finite permutations, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or seen as bijections (corresponding to the algebraic point of…
The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…
A mixed lattice is a partially ordered set with two mixed partial orderings that are linked by asymmetric upper and lower envelopes. These notions generalize the join and meet operations of a lattice. In the present paper, we study…
We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…
If a partition of a lattice in R^d is selfsimilar, it is called lattice substitution system (LSS). Such sets represent nonperiodic, but highly ordered structures. An important property of such structures is, whether they are model sets or…