Related papers: Factor maps between tiling dynamical systems
In this paper we study the topological characteristic factors along cubes of minimal systems. It is shown that up to proximal extensions the pro-nilfactors are the topological characteristic factors along cubes of minimal systems. In…
In typical non-idempotent intersection type systems, proof normalization is not confluent. In this paper we introduce a confluent non-idempotent intersection type system for the lambda-calculus. Typing derivations are presented using proof…
In this paper, we develop several structure theorems concerning commuting transformations and minimal $\mathbb{R}$-flows. Specifically, we show that if $(X,S)$, $(X,T)$ are minimal systems with $S$ and $T$ being commutative, then they…
We study fibrations in the category of cubespaces/nilspaces. We show that a fibration of finite degree $f \colon X\rightarrow Y$ between compact ergodic gluing cubespaces (in particular nilspaces) factors as a (possibly countable) tower of…
The Local-to-Global-Principle used in the proof of convexity theorems for momentum maps has been extracted as a statement of pure topology enriched with a structure of convexity. We extend this principle to not necessarily closed maps…
Software and hardware architectures are prone to modifications. We demonstrate how a mathematically founded powerful refinement calculus for a class of architectures, namely pipe and filter architectures, can be used to modify a system in a…
A folklore result due to M.W. Hirsch states that most competitive maps admit a carrying simplex, i.e., an invariant hypersurface which attracts all nontrivial orbits. The common approach in the study of these maps is to focus on the…
It was recently shown that the nonseparable density operators for a bipartite system are trace norm dense if either factor space has infinite dimension. We show here that non-local states -- i.e., states whose correlations cannot be…
This paper introduces a simple type system for combinatory logic in which combinators have at most one type, whose polymorphism is revealed by application. The combinatory types exactly describe the structure of their values, which may be…
A tiling is a cover of R^d by tiles such as polygons that overlap only on their borders. A patch is a configuration consisting of finitely many tiles that appears in tilings. From a tiling, we can construct a dynamical system which encodes…
We examine overlapping clustering schemes with functorial constraints, in the spirit of Carlsson--Memoli. This avoids issues arising from the chaining required by partition-based methods. Our principal result shows that any clustering…
We consider a multi-dimensional billiard system in an (n+1)-dimensional Euclidean space, the direct product of the "horizontal" hyperplane and the "vertical" line. The hypersurface that determines the system is assumed to be smooth and…
We consider domino tilings of three-dimensional cubiculated manifolds with or without boundary, including subsets of Euclidean space and three-dimensional tori. In particular, we are interested in the connected components of the space of…
We introduce a cohomology theory for spatial super- product systems and compute the $2-$cocycles for some basic examples called as Clifford super-product systems, thereby distinguish them up to isomorphism. This consequently proves that a…
Piecewise smooth systems are intensively studied today in many application areas, such as economics, finance, engineering, biology, and ecology. In this work, we consider a class of one-dimensional piecewise linear discontinuous maps with a…
In a region $R$ consisting of unit squares, a domino is the union of two adjacent squares and a (domino) tiling is a collection of dominoes with disjoint interior whose union is the region. The flip graph $\mathcal{T}(R)$ is defined on the…
According to a fundamental result in quantum computing, any unitary transformation on a composite system can be generated using so-called 2-local unitaries that act only on two subsystems. Beyond its importance in quantum computing, this…
Linear constraints for a matrix polytope with no fractional vertex are investigated as intersecting research among permutation codes, rank modulations, and linear programming methods. By focusing the discussion to the block structure of…
A new family of decagonal quasiperiodic tilings are constructed by the use of generalized point substitution processes, which is a new substitution formalism developed by the author [N. Fujita, Acta Cryst. A 65, 342 (2009)]. These tilings…
Following the work of Louisa and Michael Barnsley on results in tops of iterated function systems, we extend their work to graph-directed iterated function systems by investigating the relationship between top addresses and shift spaces.…