Von Koch and Thue-Morse revisited

We revisit the relation between the von Koch curve and the Thue-Morse sequence given in a recent paper of Ma and Goldener by relating their study to papers written by Coquet and Dekking at the beginning of the 80s. We also emphasize that more general links between fractal objects and automatic sequences can be found in the literature.Comment: Slight changes on the first version. Accepted by "Fractals

Shuffling cards, factoring numbers, and the quantum baker's map

It is pointed out that an exactly solvable permutation operator, viewed as the quantization of cyclic shifts, is useful in constructing a basis in which to study the quantum baker's map, a paradigm system of quantum chaos. In the basis of this operator the eigenfunctions of the quantum baker's map are compressed by factors of around five or more. We show explicitly its connection to an operator that is closely related to the usual quantum baker's map. This permutation operator has interesting connections to the art of shuffling cards as well as to the quantum factoring algorithm of Shor via the quantum order finding one. Hence we point out that this well-known quantum algorithm makes crucial use of a quantum chaotic operator, or at least one that is close to the quantization of the left-shift, a closeness that we also explore quantitatively.Comment: 12 pgs. Substantially elaborated version, including a new route to the quantum bakers map. To appear in J. Phys.

Time-to-birth prediction models and the influence of expert opinions

Preterm birth is the leading cause of death among children under five years old. The pathophysiology and etiology of preterm labor are not yet fully understood. This causes a large number of unnecessary hospitalizations due to high--sensitivity clinical policies, which has a significant psychological and economic impact. In this study, we present a predictive model, based on a new dataset containing information of 1,243 admissions, that predicts whether a patient will give birth within a given time after admission. Such a model could provide support in the clinical decision-making process. Predictions for birth within 48 h or 7 days after admission yield an Area Under the Curve of the Receiver Operating Characteristic (AUC) of 0.72 for both tasks. Furthermore, we show that by incorporating predictions made by experts at admission, which introduces a potential bias, the prediction effectiveness increases to an AUC score of 0.83 and 0.81 for these respective tasks

A Carbon Nanofilament-Bead Necklace

Carbon nanofilaments with carbon beads grown on their surfaces were successfully synthesized reproducibly by a floating catalyst CVD method. The nanofilaments hosting the pearl-like structures typically show an average diameter of about 60 nm, which mostly consists of low-ordered graphite layers. The beads with diameter range 150−450 nm are composed of hundreds of crumpled and random graphite layers. The mechanism for the formation of these beaded nanofilaments is ascribed to two nucleation processes of the pyrolytic carbon deposition, arising from a temperature gradient between different parts of the reaction chamber. Furthermore, the Raman scattering properties of the beaded nanofilaments have been measured, as well as their confocal Raman G-line images. The Raman spectra reveal that that the trunks of the nanofilaments have better graphitic properties than the beads, which is consistent with the HRTEM analysis. The beaded nanofilaments are expected to have high potential applications in composites, which should exhibit both particle- and fiber-reinforcing functions for the host matrixes

Patterns in rational base number systems

Number systems with a rational number $a/b > 1$ as base have gained interest in recent years. In particular, relations to Mahler's 3/2-problem as well as the Josephus problem have been established. In the present paper we show that the patterns of digits in the representations of positive integers in such a number system are uniformly distributed. We study the sum-of-digits function of number systems with rational base $a/b$ and use representations w.r.t. this base to construct normal numbers in base $a$ in the spirit of Champernowne. The main challenge in our proofs comes from the fact that the language of the representations of integers in these number systems is not context-free. The intricacy of this language makes it impossible to prove our results along classical lines. In particular, we use self-affine tiles that are defined in certain subrings of the ad\'ele ring $\mathbb{A}_\mathbb{Q}$ and Fourier analysis in $\mathbb{A}_\mathbb{Q}$. With help of these tools we are able to reformulate our results as estimation problems for character sums

Description of Generalized Continued Fractions by Finite Automata

A generalized continued fraction algorithm associates with every real number x a sequence of integers; x is rational iff the sequence is finite. For a fixed algorithm, call a sequence of integers valid if it is the result of that algorithm on some input x0. We show that, if the algorithm is sufficiently well-behaved, then the set of all valid sequences is accepted by a finite automaton. I. Introduction. It is well known that every real number x has a unique expansion as a simple continued fraction in the form

Calculations of collisions between cold alkaline earth atoms in a weak laser field

We calculate the light-induced collisional loss of laser-cooled and trapped magnesium atoms for detunings up to 50 atomic linewidths to the red of the ^1S_0-^1P_1 cooling transition. We evaluate loss rate coefficients due to both radiative and nonradiative state-changing mechanisms for temperatures at and below the Doppler cooling temperature. We solve the Schrodinger equation with a complex potential to represent spontaneous decay, but also give analytic models for various limits. Vibrational structure due to molecular photoassociation is present in the trap loss spectrum. Relatively broad structure due to absorption to the Mg_2 ^1Sigma_u state occurs for detunings larger than about 10 atomic linewidths. Much sharper structure, especially evident at low temperature, occurs even at smaller detunings due to of Mg_2 ^1Pi_g absorption, which is weakly allowed due to relativistic retardation corrections to the forbidden dipole transition strength. We also perform model studies for the other alkaline earth species Ca, Sr, and Ba and for Yb, and find similar qualitative behavior as for Mg.Comment: 20 pages, RevTex, 13 eps figures embedde

Universalities in One-electron Properties of Limit Quasi-periodic Lattices

We investigate one-electron properties of one-dimensional self-similar structures called limit quasi-periodic lattices. The trace map of such a lattice is nonconservative in contrast to the quasi-periodic case, and we can determine the structure of its attractor. It allows us to obtain the three new features of the present system: 1) The multi-fractal characters of the energy spectra are {\it universal}. 2) The supports of the $f(\alpha)$-spectra extend over the whole unit interval, $[0, 1]$. 3) There exist marginal critical states.Comment: 4 pages, 2figure

Sturmian morphisms, the braid group B_4, Christoffel words and bases of F_2

We give a presentation by generators and relations of a certain monoid generating a subgroup of index two in the group Aut(F_2) of automorphisms of the rank two free group F_2 and show that it can be realized as a monoid in the group B_4 of braids on four strings. In the second part we use Christoffel words to construct an explicit basis of F_2 lifting any given basis of the free abelian group Z^2. We further give an algorithm allowing to decide whether two elements of F_2 form a basis or not. We also show that, under suitable conditions, a basis has a unique conjugate consisting of two palindromes.Comment: 25 pages, 4 figure

Crossing Boundaries: Tapestry Within the Context of the 21st Century

International audienceGraphical model processing is a central problem in artificial intelligence. The optimization of the combined cost of a network of local cost functions federates a variety of famous problems including CSP, SAT and Max-SAT but also optimization in stochastic variants such as Markov Random Fields and Bayesian networks. Exact solving methods for these problems typically include branch and bound and local inference-based bounds.In this paper we are interested in understanding when and how dynamic programming based optimization can be used to efficiently enforce soft local consistencies on Global Cost Functions, defined as parameterized families of cost functions of unbounded arity. Enforcing local consistencies in cost function networks is performed by applying so-called Equivalence Preserving Transformations (EPTs) to the cost functions. These EPTs may transform global cost functions and make them intractable to optimize.We identify as tractable projection-safe those global cost functions whose optimization is and remains tractable after applying the EPTs used for enforcing arc consistency. We also provide new classes of cost functions that are tractable projection-safe thanks to dynamic programming.We show that dynamic programming can either be directly used inside filtering algorithms, defining polynomially DAG-filterable cost functions, or emulated by arc consistency filtering on a Berge-acyclic network of bounded-arity cost functions, defining Berge-acyclic network-decomposable cost functions. We give examples of such cost functions and we provide a systematic way to define decompositions from existing decomposable global constraints.These two approaches to enforcing consistency in global cost functions are then embedded in a solver for extensive experiments that confirm the feasibility and efficiency of our proposal