Related papers: On linearly ordered sets of chain components
It is known by the Conley's theorem that the chain recurrent set $CR(\phi)$ of a deterministic flow $\phi$ on a compact metric space is the complement of the union of sets $B(A)-A$, where $A$ varies over the collection of attractors and…
A chain poset, by definition, consists of chains of ordered elements in a poset. We study the chain posets associated to two posets: the Boolean algebra and the poset of isotropic flags. We prove that, in both cases, the chain posets…
Conley in \cite{Con} constructed a complete Lyapunov function for a flow on compact metric space which is constant on orbits in the chain recurrent set and is strictly decreasing on orbits outside the chain recurrent set. This indicates…
In order theory, partially ordered sets are only equipped with one relation which decides the entire structure/Hasse diagram of the set. In this paper, we have presented how partially ordered sets can be studied under simultaneous partially…
A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…
Let $(X,\le)$ be a {\em non-empty strictly inductive poset}, that is, a non-empty partially ordered set such that every non-empty chain $Y$ has a least upper bound lub$(Y)\in X$, a chain being a subset of $X$ totally ordered by $\le$. We…
The consecutive pattern poset is the infinite partially ordered set of all permutations where $\sigma\le\tau$ if $\tau$ has a subsequence of adjacent entries in the same relative order as the entries of $\sigma$. We study the structure of…
Chaotic attractors, chaotic saddles and periodic orbits are examples of chain-recurrent sets. Using arbitrary small controls, a trajectory starting from any point in a chain-recurrent set can be steered to any other in that set. The…
For an arbitrary dynamical system there is a strong relationship between global dynamics and the order structure of an appropriately constructed Priestley space. This connection provides an order-theoretic framework for studying global…
The Conley index theory is a powerful topological tool for describing the basic structure of dynamical systems. One important feature of this theory is the attractor-repeller decomposition of isolated invariant sets. In this decomposition,…
We consider a very weak chain condition for a poset, that is the absence of subsets which are order isomorphic to the set of real numbers in their natural ordering; we study generalised radical groups in which this finiteness condition is…
This is a self-contained tour of the Conley index and connection matrices. The starting point is Conley's fundamental theorem of dynamical systems. There is a short stop at the necessary topological background, before we proceed to the…
Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…
We use recent developments in local entropy theory to prove that chaos in dynamical systems implies the existence of complicated structure in the underlying space. Earlier Mouron proved that if $X$ is an arc-like continuum which admits a…
We consider databases in which each attribute takes values from a partially ordered set (poset). This allows one to model a number of interesting scenarios arising in different applications, including quantitative databases, taxonomies, and…
A poset is Macaulay if its partial order and an additional total order interact well. Analogously, a ring is Macaulay if the partial order defined on its monomials by division interacts nicely with any total monomial order. We investigate…
Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…
We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…
Given a compact metric space (X; \varrho) and a continuous function f:X\rightarrow X, we study the dynamics of the induced map \bar{f} on the hyperspace of the compact subsets of X. We show how the chain recurrent set of f and its…
A topological dynamical system $(X,f)$ induces two natural systems, one is on the probability measure spaces and other one is on the hyperspace. We introduce a concept for these two spaces, which is called entropy order, and prove that it…