相关论文: Factor maps between tiling dynamical systems
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum dominating set problem and the maximum matching problem in…
Let $M$ be a model set meeting two simple conditions: (1) the internal space $H$ is a product of $R^n$ and a finite group, and (2) the window $W$ is a finite union of disjoint polyhedra. Then any point pattern with finite local complexity…
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…
In this paper we present a variant of the Calculus of Looping Sequences (CLS for short) with global and local rewrite rules. While global rules, as in CLS, are applied anywhere in a given term, local rules can only be applied in the…
We prove several results concerning cycle tilings and $H$-factors in digraphs. We provide a minimum semi-degree condition for forcing a digraph to contain a given spanning collection of vertex-disjoint orientations of cycles. Our result is…
Essential to the description of a quantum system are its local degrees of freedom, which enable the interpretation of subsystems and dynamics in the Hilbert space. While a choice of local tensor factorization of the Hilbert space is often…
Nonlinear dynamical systems subjected to a combination of noise and time-varying forcing can exhibit sudden changes, critical transitions or tipping points where large or rapid dynamic effects arise from changes in a parameter that are…
In a finite volume system, we prove a no-go theorem on a Leibniz rule with a care of locality argument on latttice. The new possibility on the Leibniz rule solutions on lattice is discussed. Although the new solution admits a local…
This paper presents a detailed symbolic approach to the study of self-similar tilings. It uses properties of addresses associated with graph-directed iterated function systems to establish conjugacy properties of tiling spaces. Tiles may be…
Experiments observing the liquid surface in a vertically oscillating container have indicated that modeling the dynamics of such systems require maps that admit states at infinity. In this paper we investigate the bifurcations in such a…
To understand an aperiodic tiling (or a quasicrystal modeled on an aperiodic tiling), we construct a space of similar tilings, on which the group of translations acts naturally. This space is then an (abstract) dynamical system. Dynamical…
Density matrices are powerful mathematical tools for the description of closed and open quantum systems. Recently, methods for the direct computation of density matrix elements in scalar quantum field theory were developed based on thermo…
In this paper, we study conditions for the existence of an embedding $\widetilde{f} \colon P \to Q \times \mathbb{R}$ such that $f = \mathrm{pr}_Q \circ \widetilde{f}$, where $f \colon P \to Q$ is a piecewise linear map between polyhedra.…
The dynamics of a linear dynamical system over a finite field can be described by using the elementary divisors of the corresponding matrix. It is natural to extend the investigation to a general finite commutative ring. In a previous…
Kautz and de Bruijn graphs have a high degree of connectivity which makes them ideal candidates for massively parallel computer network topologies. In order to realize a practical computer architecture based on these graphs, it is useful to…
We describe a dynamic programming algorithm for computing the marginal distribution of discrete probabilistic programs. This algorithm takes a functional interpreter for an arbitrary probabilistic programming language and turns it into an…
In this paper, we study the fibers of "automorphic word maps", a certain generalization of word maps, on finite groups and on nonabelian finite simple groups in particular. As an application, we derive a structural restriction on finite…
Tilings and tiling systems are an abstract concept that arise both as a computational model and as a dynamical system. In this paper, we characterize the sets of periods that a tiling system can produce. We prove that up to a slight…
We prove that every flat nonlinear discrete-time system can be decomposed by coordinate transformations into a smaller-dimensional subsystem and an endogenous dynamic feedback. For flat continuous-time systems, no comparable result is…
The number of distinguishable inherent structures of a liquid is the key component to understanding the thermodynamics of glass formers. In the case of hard potential systems such as hard discs, spheres and ellipsoids, an inherent structure…