Related papers: Isomorphism of Hierarchical Structures
We study compositions whose parts are colored by subsequences of the Fibonacci numbers. We give explicit bijections between Fibonacci colored compositions and several combinatorial objects, including certain restricted ternary and…
This work is devoted to the study of the symmetries of (quasi)periodic architectured materials. For this purpose, the weaker symmetry criterion of indistinguishability is used. It relies on a statistical description of the mesostructure and…
This is a chapter in an upcoming book on aperiodic order. We go over different versions of tiling cohomology (\v Cech, pattern-equivariant, PV, quotient) with emphasis on the inverse limit constructions used to compute these cohomologies.…
We find and describe unexpected isomorphisms between two very different objects associated to hypersurface singularities. One object is the Milnor algebra of a function, while the other object associated to a singularity is the local ring…
A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings are sofic, that is, can be enforced by finitely many local…
Complex systems are usually represented as an intricate set of relations between their components forming a complex graph or network. The understanding of their functioning and emergent properties are strongly related to their structural…
For each type of number, structures that differ by arbitrary scaling factors and are isomorphic to one another are described. The scaling of number values in one structure, relative to the values in another structure, must be compensated…
We establish the hierarchy among twelve equivalence relations (similarities) on the class of relational structures: the equality, the isomorphism, the equimorphism, the full relation, four similarities of structures induced by similarities…
A general theme of computable structure theory is to investigate when structures have copies of a given complexity $\Gamma$. We discuss such problem for the case of equivalence structures and preorders. We show that there is a $\Pi^0_1$…
We present experiments of sandpiles on grids (square, triangular, hexagonal) and Penrose tilings. The challenging part is to program such simulator; and our javacript code is available online, ready to play! We first present some identity…
This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…
In this note we define fibrations of topological stacks and establish their main properties. We prove various standard results about fibrations (fiber homotopy exact sequence, Leray-Serre and Eilenberg-Moore spectral sequences, etc.). We…
We introduce a geometric construction which relates to the pentagram map much in the way that a logarithmic spiral relates to a circle. After introducing the construction, we establish some basic geometric facts about it, and speculate on…
A correspondence between different $Pin$-type structures on a compact surface and quadratic (linear) forms on its homology is constructed. Addition of structures is defined and expressed in terms of these quadratic forms.
Linear topological spaces with partial ordering (linear kinematics) are studied. They are defined by a set of 8 axioms implying that topology, linear structure and ordering are compatible with each other. Most of the results are valid for…
A representation theorem relates different mathematical structures by providing an isomorphism between them: that is, a one-to-one correspondence preserving their original properties. Establishing that the two structures substantially…
In this paper we will study the representations of isomorphisms between bases of topological spaces. It turns out that the perfect setting for this study is that of regular open subsets of complete metric spaces, but we have achieved some…
We provide a treatment of isomorphism within a set-theoretic formulation of dependent type theory. Type expressions are assigned their natural set-theoretic compositional meaning. Types are divided into small and large types --- sets and…
An important question in dynamical systems is the classification problem, i.e., the ability to distinguish between two isomorphic systems. In this work, we study the topological factors between a family of multidimensional substitutive…
For real application and theoretical investigation of ordinary hypergraphs and non-ordinary hypergraphs, researchers need to establish standard rules and feasible operating methods. We propose a visualization tool for investigating…