Related papers: Lattice Structures for Attractors I
We compare various concepts of attractor in the context of non-autonomous dynamical systems. Then, we prove an appropriate version of the Pliss reduction principle for non-autonomous differential systems with rapidly oscillating…
Shaken optical lattices permit to coherently modify the tunneling of particles in a controllable manner. We introduce a general relation between the geometry of shaken lattices and their admissible effective dynamics. Using three different…
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…
We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part (arXiv:2501.15657), we discused…
High dimensional integrals are abundant in many fields of research including quantum physics. The aim of this paper is to develop efficient recursive strategies to tackle a class of high dimensional integrals having a special product…
In the latest developments in the theory of skew lattices, distributivity has been one of the main topics of study. The largest classes of examples of such algebras are distributive. Unlike what happens in lattices, the properties of…
We show that real tight frames that generate lattices must be rational, and use this observation to describe a construction of lattices from vertex transitive graphs. In the case of irreducible group frames, we show that the corresponding…
In this paper we give a complete characterization of those knotted toroidal sets that can be realized as attractors for both discrete and continuous dynamical systems globally defined in $\mathbb{R}^3$. We also see that the techniques used…
Covering-based rough set theory is a useful tool to deal with inexact, uncertain or vague knowledge in information systems. Geometric lattice has widely used in diverse fields, especially search algorithm design which plays important role…
We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part (arXiv:2501.15657), we discused…
This paper investigates the structure-property relations of thin-walled lattices under dynamic longitudinal compression, characterized by their cross-sections and heights. These relations elucidate the interactions of different geometric…
In this work we study the Boolean Networks of different geometric shape and lattice organization. It was revealed that no only a spatial shape but also type of lattice are very important for definition of the structure-dynamics relation.…
New aspects of a relation between lattice and dislocation structures are examined within a physically transparent theoretical scheme. Predicted features originating from the lattice discreteness include: (i) multiple core dislocation…
If $L$ is a finite lattice, we show that there is a natural topological lattice structure on the geometric realization of its order complex $\Delta(L)$ (definition recalled). Lattice-theoretically, the resulting object is a subdirect…
We present a simple off-lattice hard-disc model that exhibits glassy dynamics. The inherent structures are enumerated exactly, transitions between metabasins are well understood, and the particle configurations that act to facilitate…
Bistability is a ubiquitous phenomenon in life sciences. In this paper, two kinds of bistable structures in dynamical systems are studied: One is two one-point attractors, another is a one-point attractor accompanied by a cycle attractor.…
The paper studies ways in which the sets of a partition of a lattice in $\RR^n$ become regular model sets. The main theorem gives equivalent conditions which assure that a matrix substitution system on a lattice in $\RR^n$ gives rise to…
We describe the orbit structure for the action of the centralizer group of a linear operator on a finite-dimensional complex vector space. The main application is to the classification of solutions to a system of first-order ODEs with…
We study bases of the lattice generated by the cycles of an undirected graph, defined as the integer linear combinations of the 0/1-incidence vectors of cycles. We prove structural results for this lattice, including explicit formulas for…
The paper shows that there is a deep structure on certain sets of bisimilar Probabilistic Automata (PA). The key prerequisite for these structures is a notion of compactness of PA. It is shown that compact bisimilar PA form lattices. These…