SearcharxivSearch

arXiv subjects

Henryk Fukś

Publications and source records attributed to Henryk Fukś.

At least 19 recordsLinked to original sources

Analysis of the asymptotic density of endogamous diploid cellular automata

We investigate the asymptotic behaviour of diploid Elementary Cellular Automata (ECA), that is, the stochastic mixtures between two ECAs. In this model, each cell independently applies one rule with probability $λ$ and the other rule with probability $ 1 - λ$. Focusing on the endogamous diploids where the two ECAs are related by the reflection or conjugation symmetry, we analyse how the density varies as function of $λ$, the ``degree of mixing'' of these two rules. We propose a classification into six distinct classes depending on the profile of the density vs. $λ$ curve. We take various examples for each class and we analyse to which extent the local structure approximation succeeds to predict the asymptotic density. Our results show that for rules in which the asymptotic density depends linearly on $λ$, the local structure approximation reproduces the exact dependence of the density on $λ$. For rules with differentiable but nonlinear dependence, the approximation either becomes exact at a finite order or converges rapidly to the exact solution as the order increases. For rules with first-order phase transitions, finite-order approximations progressively approach a sharp transition profile with increasing order. In contrast, for rules exhibiting a second-order phase transition, even high-order approximations fail to capture the qualitative features of the transition. (no bifurcation is observed). Finally, we give examples of two diploid rules for which we succeed to compute the density at each time step.

nlin.CG

Mathematics in the liturgical books of the Catholic Church: phases of the ecclesiastical moon

We use contemporary mathematical notation to describe the method for determining the age of the ecclesiastical moon as mandated by pope Gregory XIII and elaborated in the book of Christopher Clavius \emph{Romani calendarii explicatio}. The algorithm is first introduced by using the tabular method employed by liturgical books such as the Roman Missal, Breviary and Martyrology. Then we construct the recurrence equation for the epacts, derive its solution, and give a simple expression for the age of the moon on a given day of the year. We also consider the problems which can occur at the transition from December 31 to January 1 of the next year, when there could be a ``jump'' in moon's age ("saltus lunae") in years when epact corrections are applied. We propose a simple solution which fixes these problems. A summary of the formulae and listing of the implementation of relevant functions in Python is provided in the last section.

math.HO

Ternary cellular automata induced by semigroups of order 3 are solvable

The minimal number of inputs in the local function of a non-trivial cellular automaton is two. Such a function can be viewed as as a kind of binary operation. If this operation is associative, it forms, together with the set of states, a semigroup. There are 18 semigroups of order 3 up to equivalence, and they define 18 cellular automata rules with three states. We investigate these rules with respect to solvability and show that all of them are solvable, meaning that the state of a given cell after $n$ iterations can be expressed by an explicit formula. We derive the relevant formulae for all 18 rules using some additional properties possessed by particular semigroups of order 3, such as commutativity and idempotence.

nlin.CG

Approximating dynamics of a number-conserving cellular automaton by a finite-dimensional dynamical system

The local structure theory for cellular automata (CA) can be viewed as an finite-dimensional approximation of infinitely-dimensional system. While it is well known that this approximation works surprisingly well for some cellular automata, it is still not clear why it is the case, and which CA rules have this property. In order to shed some light on this problem, we present an example of a four input CA for which probabilities of occurrence of short blocks of symbols can be computed exactly. This rule is number conserving and possesses a blocking word. Its local structure approximation correctly predicts steady-state probabilities of small length blocks, and we present a rigorous proof of this fact, without resorting to numerical simulations. We conjecture that the number-conserving property together with the existence of the blocking word are responsible for the observed perfect agreement between the finite-dimensional approximation and the actual infinite-dimensional dynamical system.

nlin.CG

The story of geometry told by coins

In three articles published in CNJ in 2012 and 2016 , we discussed some links between mathematical sciences, coin minting and numismatics. This article is a continuation of this cycle. It tells the story of selected important developments in the history of geometry using modern commemorative coins as a background and illustration.

math.HO

Solving the initial value problem for cellular automata by pattern decomposition

For many cellular automata, it is possible to express the state of a given cell after $n$ iterations as an explicit function of the initial configuration. We say that for such rules the solution of the initial value problem can be obtained. In some cases, one can construct the solution formula for the initial value problem by analyzing the spatiotemporal pattern generated by the rule and decomposing it into simpler segments which one can then describe algebraically. We show an example of a rule when such approach is successful, namely elementary rule 156. Solution of the initial value problem for this rule is constructed and then used to compute the density of ones after $n$ iterations, starting from a random initial condition. We also show how to obtain probabilities of occurrence of longer blocks of symbols.

nlin.CG

Cellular automaton model of self-healing

We propose a simple cellular automaton model of a self-healing system and investigate its properties. In the model, the substrate is a two-dimensional checkerboard configuration which can be damaged by changing values of a finite number of sites. The cellular automaton we consider is a checkerboard voting rule, a binary rule with Moore neighbourhood which is topologically conjugate to majority voting rule. For a single color damage (when only cells in the same state are modified), the rule always fixes the damage. For a general damage, when it is localized inside a $3 \times 3$ square, the rule also fixes it always. When the damage is inside of a larger $n \times n$ square, the efficiency of the rule in fixing the damage becomes smaller than $100\%$, but it remains better than $98\%$ for $n \leq 5$ and better than $75 \%$ for $n\leq 7$. We show that in the limit of infinite $n$ the efficiency tends to zero.

nlin.CG

Remembering Nino Boccara (1931--2018)

In commemoration of the fifth anniversary since Nino Boccara's departure, this article offers some personal recollections and provides insight into his life and accomplishments. Detailed bibliography of his works is included together with commentary highlighting his major achievements.

physics.hist-ph

Four state deterministic cellular automaton rule emulating random diffusion

We show how to construct a deterministic nearest-neighbour cellular automaton (CA) with four states which emulates diffusion on a one-dimensional lattice. The pseudo-random numbers needed for directing random walkers in the diffusion process are generated with the help of rule 30. This CA produces density profiles which agree very well with solutions of the diffusion equation, and we discuss this agreement for two different boundary and initial conditions. We also show how our construction can be generalized to higher dimensions.

nlin.CG

Deterministic cellular automata resembling diffusion

We investigate number conserving cellular automata with up to five inputs and two states with the goal of comparing their dynamics with diffusion. For this purpose, we introduce the concept of decompression ratio describing expansion of configurations with finite support. We find that a large number of number-conserving rules exhibit abrupt change in the decompression ratio when the density of the initial pattern is increasing, somewhat analogous to the second order phase transition. The existence of this transition is formally proved for rule 184. Small number of rules exhibit infinite decompression ratio, and such rules may be useful for "engineering" of CA rules which are good models of diffusion, although they will most likely require more than two states.

nlin.CG

Mensurae Universales Magnitudinum ac Temporum by Adam Adamandy Kochański -- Latin text with annotated English translation

Annotated parallel text in Latin and English of the paper of Adam Adamandy Kochański "Mensurae universales magnitudinum ac temporum", Acta Eruditorum, p. 259--266, May 1687, in which he presents some ideas of how to establish universal measure of length and time. The Latin text closely follows the original text published in Acra Eruditorum. Punctuation, capitalization, and mathematical notation have been preserved. The translation is as faithful as possible, often literal, and it is mainly intended to be of help to those who wish to study the original Latin text. Footnotes and figures in the appendix have been added by the translator.

math.HO

Dynamics of large scale networks following a merger

We study the dynamic network of relationships among avatars in the massively multiplayer online game Planetside 2. In the spring of 2014, two separate servers of this game were merged, and as a result, two previously distinct networks were combined into one. We observed the evolution of this network in the seven month period following the merger and report our observations. We found that some structures of original networks persist in the combined network for a long time after the merger. As the original avatars are gradually removed, these structures slowly dissolve, but they remain observable for a surprisingly long time. We present a number of visualizations illustrating the post-merger dynamics and discuss time evolution of selected quantities characterizing the topology of the network.

cs.SI

Explicit solution of the Cauchy problem for cellular automaton rule 172

Cellular automata (CA) are fully discrete alternatives to partial differential equations (PDE). For PDEs, one often considers the Cauchy problem, or initial value problem: find the solution of the PDE satisfying a given initial condition. For many PDEs of the first order in time, it is possible to find explicit formulae for the solution at the time $t>0$ if the solution is known at $t=0$. Can something similar be achieved for CA? We demonstrate that this is indeed possible in some cases, using elementary CA rule 172 as an example. We derive an explicit expression for the state of a given cell after $n$ iteration of the rule 172, assuming that states of all cells are known at $n=0$. We then show that this expression ("solution of the CA") can be used to obtain an expected value of a given cell after $n$ iterations, provided that the initial condition is drawn from a Bernoulli distribution. This can be done for both finite and infinite lattices, thus providing an interesting test case for investigating finite size effects in CA.

nlin.CG

Orbits of Bernoulli Measures in Cellular Automata

We discuss how to construct shift-invariant probability measures over the space of bisequences of symbols, and how to describe such measures in terms of block probabilities. We then define cellular automata as maps in the space of measures and discuss orbits of shift-invariant probability measures under these maps. Subsequently, the local structure approximation is discussed as a method to approximate orbits of Bernoulli measures under the action of cellular automata. The final sections presents some known examples of cellular automata, both deterministic and probabilistic, for which elements of the orbit of the Bernoulli measure (probabilities of short blocks) can be determined exactly.

nlin.CG

Evaluating the Quality of Local Structure Approximation Using Elementary Rule 14

Cellular automata (CA) can be viewed as maps in the space of probability measures. Such maps are normally infinitely-dimensional, and in order to facilitate investigations of their properties, especially in the context of applications, finite-dimensional approximations have been proposed. The most commonly used one is known as the local structure theory, developed by H. Gutowitz et al. in 1987. In spite of the popularity of this approximation in CA research, examples of rigorous evaluations of its accuracy are lacking. In an attempt to fill this gap, we construct a local structure approximation for rule 14, and study its dynamics in a rigorous fashion, without relying on numerical experiments. We then compare the outcome with known exact results.

nlin.CG

An example of a deterministic cellular automaton exhibiting linear-exponential convergence to the steady state

In a recent paper [arXiv:1506.06649 [nlin.CG]], we presented an example of a 3-state cellular automaton which exhibits behaviour analogous to degenerate hyperbolicity often observed in finite-dimensional dynamical systems. We also calculated densities of 0, 1 and 2 after n iterations of this rule, using finite state machines to conjecture patterns present in preimage sets. Here, we re-derive the same formulae in a rigorous way, without resorting to any semi-empirical methods. This is done by analysing the behaviour of continuous clusters of symbols and by considering their interactions.

nlin.CG

Construction of local structure maps for cellular automata

The paper formalizes and extends the idea of local structure approximation for cellular automata originally proposed by Gutowitz et. al. We start with a review of the construction of a probability measure on the set of bi-infinite strings over a finite alphabet of $N$ symbols. We then demonstrate that for a shift-invariant probability measure, probabilities of all blocks of length up to $k$ can be expressed by $(N-1)N^{k-1}$ linearly independent block probabilities. Two choices of these independent blocks are discussed in detail, one in which we choose the longest possible blocks ("long form") and one in which we choose the shortest possible blocks ("short form"). We then proceed to review the method which allows to approximate probabilities of blocks longer than $k$ by blocks of length $k$ or less. This approximation, known as Bayesian extension or Markov measure, is then used to construct approximate orbits of shift-invariant probability measures under the action of probabilistic or deterministic cellular automaton. We show that the aforementioned approximate orbit is completely determined by an $(N-1)N^{k-1}$-dimensional map. When the short form of block probabilities is used, this map takes particularly simple form, often revealing important features of a particular cellular automaton.

nlin.CG

Mathematical formulae on coins, parts I and II

In the article "The Tale of Two Queens and Two Towering Figures" published in CNJ in 2012 (CNJ vol. 57 No. 5, pp. 304-315), we discussed the contributions of Copernicus and Newton to coin minting and monetary reforms, as well as the commemoration of their achievements on contemporary coins. In the current article we will examine more explicit aspects of the relationship between mathematical sciences and numismatics, namely the presence of mathematical formulae on coins. We will survey examples of coins depicting mathematical formulae, ranging from some universally recognizable ones to more advanced symbolic expressions which are known only to specialists.

math.HO