相关论文: On blockers in bounded posets

In this paper, we study partitions of positive integers into distinct quasifibonacci numbers. A digraph and poset structure is constructed on the set of such partitions. Furthermore, we discuss the symmetric and recursive relations between…

We describe structure of locally finite groups of finite centraliser dimension.

We discuss a class of linear representations of the product poset of totally ordered sets $P= T_1 \times \cdots \times T_n$ which decompose into interval representations for block intervals. These can be characterised in terms of a…

We prove a number of dualities between posets and (pseudo)bases of open sets in locally compact Hausdorff spaces. In particular, we show that (1) Relatively compact basic sublattices are finitely axiomatizable. (2) Relatively compact basic…

The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…

The Schouten bracket (or antibracket) plays a central role in the Poisson formalism and the Batalin-Vilkovisky quantization of gauge systems. There are several (in)equivalent ways to realize this concept on jet spaces. In this paper, we…

We consider lattices of regular sets of non negative integers, i.e. of sets definable in Presbuger arithmetic. We prove that if such a lattice is closed under decrement then it is also closed under many other functions: quotients by an…

We establish monotone bijections between the Farey sequences of order m and the halfsequences of Farey subsequences associated with the rank m elements of the Boolean lattice of subsets of a 2m-set. We also present a few related…

A finite ranked poset is called a symmetric chain order if it can be written as a disjoint union of rank-symmetric, saturated chains. If $P$ is any symmetric chain order, we prove that $P^n/\mathbb{Z}_n$ is also a symmetric chain order,…

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,…

In this paper we describe a novel a procedure to build a linear order from an arbitrary poset which (i) preserves the original ordering and (ii) allows to extend monotonic and antitonic mappings defined over the original poset to monotonic…

We consider the posets of equivalence relations on finite sets under the standard embedding ordering and under the consecutive embedding ordering. In the latter case, the relations are also assumed to have an underlying linear order, which…

We describe the basic lattice structures of attractors and repellers in dynamical systems. The structure of distributive lattices allows for an algebraic treatment of gradient-like dynamics in general dynamical systems, both invertible and…

An antichain $\mathcal{A}$ in a poset $\mathcal{P}$ is a subset of $\mathcal{P}$ in which no two elements are comparable. Sperner showed that the maximal antichain in the Boolean lattice, $\mathcal{B}_n = \left\{ 0 < 1 \right\}^n$, is the…

M.S. Rao recently investigated some sorts of special filters in distributive pseudocomplemented lattices. In our paper we extend this study to lattices which need neither be distributive nor pseudocomplemented. For this sake we define a…

The existence of bound states in quantum mechanics with no classical counterpart has been a subject of interest for a long time. Cross-wires and cavities connected to infinite leads are typical examples in which open geometries with bulges…

We study three different poset structures on the set of all compositions. In the first case, the covering relation consists of inserting a part of size one to the left or to the right, or increasing the size of some part by one. The…

Recently a new kind of approximation to continuum topological spaces has been introduced, the approximating spaces being partially ordered sets (posets) with a finite or at most a countable number of points. The partial order endows a poset…

Lattices with a basis can host crystallographic defects which share the same topological charge (e.g.~the Burgers vector $\vec b$ of a dislocation) but differ in their microscopic structure of the core. We demonstrate that in insulators…

It is known when we call a poset P, a $\mathcal{P}$-chain permutational poset, given a subset of permutations $\mathcal{P}$ of the symmetric group $S_{n}$. In this work, we use the same idea to study subsets of words of length $n$, that are…