English
Related papers

Related papers: Factor maps between tiling dynamical systems

200 papers

Sandpile dynamics are considered on graphs constructed from periodic plane and space tilings by assigning a growing piece of the tiling either torus or open boundary conditions. A general method of obtaining the Green's function of the…

Probability · Mathematics 2021-05-25 Robert Hough , Hyojeong Son

Starting with a substitution tiling, we demonstrate a method for constructing infinitely many new substitution tilings. Each of these new tilings is derived from a graph iterated function system and the tiles have fractal boundary. We show…

Dynamical Systems · Mathematics 2016-09-19 Natalie Priebe Frank , Samuel B. G. Webster , Michael F. Whittaker

A wide class of machine learning algorithms can be reduced to variable elimination on factor graphs. While factor graphs provide a unifying notation for these algorithms, they do not provide a compact way to express repeated structure when…

Machine Learning · Statistics 2019-05-20 Fritz Obermeyer , Eli Bingham , Martin Jankowiak , Justin Chiu , Neeraj Pradhan , Alexander Rush , Noah Goodman

Building on the work of the fourth author in math.AG/9904074, we prove the weak factorization conjecture for birational maps in characteristic zero: a birational map between complete nonsingular varieties over an algebraically closed field…

Algebraic Geometry · Mathematics 2007-05-23 Dan Abramovich , Kalle Karu , Kenji Matsuki , Jarosław Włodarczyk

By combining methods of kinetic and density functional theory, we present a description of molecular fluids which accounts for their microscopic structure and thermodynamic properties as well as for the hydrodynamic behavior. We focus on…

Mesoscale and Nanoscale Physics · Physics 2015-05-18 Umberto Marini Bettolo Marconi , Simone Melchionna

I investigate a class of dynamical systems in which finite pieces of spacetime contain finite amounts of information. Most of the guiding principles for designing these systems are drawn from general relativity: the systems are…

High Energy Physics - Theory · Physics 2007-05-23 David Hillman

Algebraic topology studies topological spaces with the help of tools from abstract algebra. The main focus of this paper is to show that many concepts from algebraic topology can be conveniently expressed in terms of (normal) factor graphs.…

Information Theory · Computer Science 2018-07-16 Ali Al-Bashabsheh , Pascal O. Vontobel

Programs written in dynamic languages make heavy use of features --- run-time type tests, value-indexed dictionaries, polymorphism, and higher-order functions --- that are beyond the reach of type systems that employ either purely syntactic…

Programming Languages · Computer Science 2011-09-16 Ravi Chugh , Patrick M. Rondon , Ranjit Jhala

We know that tilesets that can tile the plane always admit a quasi-periodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicity function is one way to measure the regularity of a quasi-periodic…

Cellular Automata and Lattice Gases · Physics 2010-12-07 Alexis Ballier , Emmanuel Jeandel

We consider the structure of Pisot substitution tiling spaces, in particular, the structure of those spaces for which the translation action does not have pure discrete spectrum. Such a space is always a measurable m-to-one cover of an…

Dynamical Systems · Mathematics 2013-01-31 Marcy Barge

Does the interaction graph of a finite dynamical system can force this system to have a "complex" dynamics ? In other words, given a finite interval of integers $A$, which are the signed digraphs $G$ such that every finite dynamical system…

Discrete Mathematics · Computer Science 2016-03-09 Maximilien Gadouleau , Adrien Richard

In this note we give a simple unifying proof of the undecidability of several diagrammatic properties of term rewriting systems that include: local confluence, strong confluence, diamond property, subcommutative property, and the existence…

Logic in Computer Science · Computer Science 2019-10-22 António Malheiro , Paulo Guilherme Santos

We study a class of $\Z^{d}$-substitutive subshifts, including a large family of constant-length substitutions, and homomorphisms between them, i.e., factors modulo isomorphisms of $\Z^{d}$. We prove that any measurable factor map and even…

Dynamical Systems · Mathematics 2023-02-27 Christopher Cabezas

Girth-regular graphs with equal girth, regular degree and chromatic index are studied for the determination of 1-factorizations with each 1-factor intersecting every girth cycle. Applications to hamiltonian decomposability and to…

Combinatorics · Mathematics 2025-10-15 Italo J. Dejter

In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains. This set of patterns can be analyzed in…

Other Computer Science · Computer Science 2008-02-21 Alexis Ballier , Bruno Durand , Emmanuel Jeandel

Until recently, it was an important open problem in Fractal Geometry to determine whether there exists an iterated function system acting on $\mathbb{R}$ with no exact overlaps for which cylinders are super-exponentially close at all small…

Dynamical Systems · Mathematics 2020-07-23 Simon Baker

The phenomenon of turbulence is investigated in the context of globally coupled maps. The local dynamics is given by the Chat\'e-Manneville minimal map previously used in studies of spatiotemporal intermittency in locally coupled map…

chao-dyn · Physics 2009-10-28 M. G. Cosenza , A. Parravano

The aim of this paper is to give a new link between integrable systems and minimal surface theory. The dressing operation uses the associated family of flat connections of a harmonic map to construct new harmonic maps. Since a minimal…

Differential Geometry · Mathematics 2014-09-19 Katrin Leschke , Katsuhiro Moriya

In this paper we use fixed point tilings to answer a question posed by Michael Hochman and show that every one-dimensional effectively closed subshift can be implemented by a local rule in two dimensions. The proof uses the fixed-point…

Logic in Computer Science · Computer Science 2010-03-17 Bruno Durand , Andrei Romashchenko , Alexander Shen

Special functions, coding theory and $t$-designs have close connections and interesting interplay. A standard approach to constructing $t$-designs is the use of linear codes with certain regularity. The Assmus-Mattson Theorem and the…

Information Theory · Computer Science 2019-07-31 Chunming Tang , Cunsheng Ding , Maosheng Xiong