English
Related papers

Related papers: The hat polykite as an Iterated Function System

200 papers

We study the polyregular string-to-string functions, which are certain functions of polynomial output size that can be described using automata and logic. We describe a system of combinators that generates exactly these functions. Unlike…

Logic in Computer Science · Computer Science 2023-04-27 Mikołaj Bojańczyk

Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite linear orders) and…

Discrete Mathematics · Computer Science 2023-06-22 Murray Tannock , Michael Albert

We consider two families of planar self-similar tilings of different nature: the tilings consisting of translated copies of the fractal sets defined by an iterated function system, and the tilings obtained as a geometrical realization of a…

Dynamical Systems · Mathematics 2020-03-17 Nicolas Bédaride , Arnaud Hilion , Timo Jolivet

The dynamical equations of clarinet-like systems are known to be reducible to a non-linear iterated map within reasonable approximations. This leads to time oscillations that are represented by square signals, analogous to the Raman regime…

Chaotic Dynamics · Physics 2010-09-21 Pierre-André Taillard , Jean Kergomard , Franck Laloë

Several important conjectures in Fractal Geometry can be summarised as follows: If the dimension of a self-similar measure in $\mathbb{R}$ does not equal its expected value, then the underlying iterated function system contains an exact…

Dynamical Systems · Mathematics 2019-09-13 Simon Baker

We briefly review the standard methods used to construct quasiperiodic tilings, such as the projection, the inflation, and the grid method. A number of sample Mathematica programs, implementing the different approaches for one- and…

Materials Science · Physics 2007-05-23 Uwe Grimm , Michael Schreiber

The focus of the paper is the behavior under iterations of the filtered and local Floer homology of a Hamiltonian on a symplectically aspherical manifold. The Floer homology of an iterated Hamiltonian comes with a natural cyclic group…

Symplectic Geometry · Mathematics 2020-09-29 Erman Cineli , Viktor L. Ginzburg

In this paper we generalize notions of iterated integral with regard to an unpredictable process. We establish a formula of integration by parts, the existence of a continuous modification and give an expression of the increasing process.

Probability · Mathematics 2012-02-21 Ludovic Valet

Conway hemirings are Conway semirings without a multiplicative unit. We also define iteration hemirings as Conway hemirings satisfying certain identities associated with the finite groups. Iteration hemirings are iteration semirings without…

Formal Languages and Automata Theory · Computer Science 2013-08-01 M. Droste , Z. Esik , W. Kuich

The periodic tiling conjecture asserts that any finite subset of a lattice $\mathbb{Z}^d$ which tiles that lattice by translations, in fact tiles periodically. In this work we disprove this conjecture for sufficiently large $d$, which also…

Combinatorics · Mathematics 2024-09-10 Rachel Greenfeld , Terence Tao

We give a general method for rounding linear programs that combines the commonly used iterated rounding and randomized rounding techniques. In particular, we show that whenever iterated rounding can be applied to a problem with some slack,…

Data Structures and Algorithms · Computer Science 2019-07-19 Nikhil Bansal

Let $X$ be a measure space with a measure-preserving action $(g,x) \mapsto g \cdot x$ of an abelian group $G$. We consider the problem of understanding the structure of measurable tilings $F \odot A = X$ of $X$ by a measurable tile $A…

Dynamical Systems · Mathematics 2023-02-28 Jan Grebík , Rachel Greenfeld , Václav Rozhoň , Terence Tao

In nature, there are many phenomena with both irregularity and uncertainty. Therefore, a fuzzy-valued fractal interpolation is more useful for modeling them than fuzzy interpolation or fractal interpolation. We construct fractal…

General Mathematics · Mathematics 2025-08-05 CholHui Yun , Hyang Choe , MiGyong Ri

An aperiodic tile set was first constructed by R.Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics ranging from logic (the Entscheidungsproblem) to physics…

Computational Complexity · Computer Science 2010-01-27 Bruno Durand , Andrei Romashchenko , Alexander Shen

We study implications of expansiveness and pointwise periodicity for certain groups and semigroups of transformations. Among other things we prove that every pointwise periodic finitely generated group of cellular automata is necessarily…

Dynamical Systems · Mathematics 2017-06-30 Tom Meyerovitch , Ville Salo

This document presents a combinatorial framework for analyzing assembly systems using generating functions. We explore the theory through concrete examples, such as linear polymers, and develop recursive equations to characterize valid…

Combinatorics · Mathematics 2025-01-22 Andrés Ortiz-Muñoz

This paper is about the tiling dynamical systems approach to the study of aperiodic order. We compare and contrast four related types of systems: ordinary (one-dimensional) symbolic systems, one-dimensional tiling systems, multidimensional…

Dynamical Systems · Mathematics 2021-04-07 Natalie Priebe Frank

In this paper, we introduce the periodic tiling (PT) property for finite abelian groups. A finite abelian group is said to have the PT property if every non-periodic set that tiles the group by translation admits a periodic tiling…

Group Theory · Mathematics 2025-09-23 Shilei Fan , Tao Zhang

We generalize the notion of (geometric) substitution rule to obtain overlapping substitutions. Our motivating example is the substitution presented in Ziherl, Dotera and Bekku \cite{DBZ}, which features a substitution matrix with…

Combinatorics · Mathematics 2025-12-23 Shigeki Akiyama , Yasushi Nagai , Shu-Qin Zhang

Interrupt Timed Automata (ITA) form a subclass of stopwatch automata where reachability and some variants of timed model checking are decidable even in presence of parameters. They are well suited to model and analyze real-time operating…

Formal Languages and Automata Theory · Computer Science 2015-04-20 Béatrice Bérard , Serge Haddad , Claudine Picaronny , Mohab Safey El Din , Mathieu Sassolas
‹ Prev 1 3 4 5 6 7 10 Next ›