Biology helps you to win a game

We present a game of interacting agents which mimics the complex dynamics found in many natural and social systems. These agents modify their strategies periodically, depending on their performances using genetic crossover mechanisms, inspired by biology. We study the performances of the agents under different conditions, and how they adapt themselves. In addition the dynamics of the game is investigated.Comment: 4 pages including 6 figures. Uses REVTeX4. Submitted for Conference Proceedings of the "Unconventional Applications of Statistical Physics", Kolkat

One Dimensional Kondo Lattice Model Studied by the Density Matrix Renormalization Group Method

Recent developments of the theoretical investigations on the one-dimensional Kondo lattice model by using the density matrix renormalization group (DMRG) method are discussed in this review. Short summaries are given for the zero-temperature DMRG, the finite-temperature DMRG, and also its application to dynamic quantities. Away from half-filling, the paramagnetic metallic state is shown to be a Tomonaga-Luttinger liquid with the large Fermi surface. For the large Fermi surface its size is determined by the sum of the densities of the conduction electrons and the localized spins. The correlation exponent K_rho of this metallic phase is smaller than 1/2. At half-filling the ground state is insulating. Excitation gaps are different depending on channels, the spin gap, the charge gap and the quasiparticle gap. Temperature dependence of the spin and charge susceptibilities and specific heat are discussed. Particularly interesting is the temperature dependence of various excitation spectra, which show unusual properties of the Kondo insulators.Comment: 18 pages, 23 Postscript figures, REVTe

Using Borehole Logging and Electron Backscatter Diffraction to Orient an Ice Core from Upper Fremont Glacier, Wyoming, USA

While glacier fabric reflects the accumulated strain, detailed azimuthal information is required to link the microstructure to the flow, and this is not easily gathered at depth. Borehole logging provides a way to obtain a log of azimuthal orientation of tilted stratigraphic features that can be used to orient the core with respect to glacier flow. We demonstrate this using acoustic borehole logs and the ice core from a 162 m borehole in Upper Fremont Glacier, Wind River Range, Wyoming, USA. We measured the dip of tilted dust and bubble layers in the actual ice core, identified them on the borehole log, then used their strike to orient the core sections containing them. We examined the crystal orientation fabric of our samples, using electron backscatter diffraction in a scanning electron microscope. When we compared the orientation of the tilted layers in some samples with the fabric, we found that the normal to the foliation and the c-axes maxima both pointed in the direction of maximum shear stress. This illustrates the usefulness of borehole logs for orienting ice cores after removal from the borehole, and for developing a better understanding of fabric development

Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees

In phylogenetics, a central problem is to infer the evolutionary relationships between a set of species $X$; these relationships are often depicted via a phylogenetic tree -- a tree having its leaves univocally labeled by elements of $X$ and without degree-2 nodes -- called the "species tree". One common approach for reconstructing a species tree consists in first constructing several phylogenetic trees from primary data (e.g. DNA sequences originating from some species in $X$), and then constructing a single phylogenetic tree maximizing the "concordance" with the input trees. The so-obtained tree is our estimation of the species tree and, when the input trees are defined on overlapping -- but not identical -- sets of labels, is called "supertree". In this paper, we focus on two problems that are central when combining phylogenetic trees into a supertree: the compatibility and the strict compatibility problems for unrooted phylogenetic trees. These problems are strongly related, respectively, to the notions of "containing as a minor" and "containing as a topological minor" in the graph community. Both problems are known to be fixed-parameter tractable in the number of input trees $k$, by using their expressibility in Monadic Second Order Logic and a reduction to graphs of bounded treewidth. Motivated by the fact that the dependency on $k$ of these algorithms is prohibitively large, we give the first explicit dynamic programming algorithms for solving these problems, both running in time $2^{O(k^2)} \cdot n$, where $n$ is the total size of the input.Comment: 18 pages, 1 figur

Implementing Shor's algorithm on Josephson Charge Qubits

We investigate the physical implementation of Shor's factorization algorithm on a Josephson charge qubit register. While we pursue a universal method to factor a composite integer of any size, the scheme is demonstrated for the number 21. We consider both the physical and algorithmic requirements for an optimal implementation when only a small number of qubits is available. These aspects of quantum computation are usually the topics of separate research communities; we present a unifying discussion of both of these fundamental features bridging Shor's algorithm to its physical realization using Josephson junction qubits. In order to meet the stringent requirements set by a short decoherence time, we accelerate the algorithm by decomposing the quantum circuit into tailored two- and three-qubit gates and we find their physical realizations through numerical optimization.Comment: 12 pages, submitted to Phys. Rev.

Interaction of quasilocal harmonic modes and boson peak in glasses

The direct proportionality relation between the boson peak maximum in glasses, $\omega_b$, and the Ioffe-Regel crossover frequency for phonons, $\omega_d$, is established. For several investigated materials $\omega_b = (1.5\pm 0.1)\omega_d$. At the frequency $\omega_d$ the mean free path of the phonons $l$ becomes equal to their wavelength because of strong resonant scattering on quasilocal harmonic oscillators. Above this frequency phonons cease to exist. We prove that the established correlation between $\omega_b$ and $\omega_d$ holds in the general case and is a direct consequence of bilinear coupling of quasilocal oscillators with the strain field.Comment: RevTex, 4 pages, 1 figur

Ageing and cognition in men with fragile X syndrome

Background Fragile X syndrome (FXS) is the most common inherited cause of intellectual disability. The aim of our longitudinal study was to describe ageing-related cognitive changes in men with FXS. Method A neuropsychologist determined the raw scores (RSs) of 19 men with FXS twice with the Leiter International Performance Scale at an average interval of 22 years. The ages of the participants at baseline ranged from 16 to 50 (mean 27) years. Results At follow-up, the RSs improved in two men, remained the same in two men and declined in 15 men. Overall, the RS of the study group deteriorated by an average 4 points in RSs (p <.001). Conclusion Cognitive ageing in men with FXS started earlier than that in men in the general population; in many cases, cognitive ageing in men with FXS began before middle age, usually without any medical or other underlying cause.Peer reviewe

On analog quantum algorithms for the mixing of Markov chains

The problem of sampling from the stationary distribution of a Markov chain finds widespread applications in a variety of fields. The time required for a Markov chain to converge to its stationary distribution is known as the classical mixing time. In this article, we deal with analog quantum algorithms for mixing. First, we provide an analog quantum algorithm that given a Markov chain, allows us to sample from its stationary distribution in a time that scales as the sum of the square root of the classical mixing time and the square root of the classical hitting time. Our algorithm makes use of the framework of interpolated quantum walks and relies on Hamiltonian evolution in conjunction with von Neumann measurements. There also exists a different notion for quantum mixing: the problem of sampling from the limiting distribution of quantum walks, defined in a time-averaged sense. In this scenario, the quantum mixing time is defined as the time required to sample from a distribution that is close to this limiting distribution. Recently we provided an upper bound on the quantum mixing time for Erd\"os-Renyi random graphs [Phys. Rev. Lett. 124, 050501 (2020)]. Here, we also extend and expand upon our findings therein. Namely, we provide an intuitive understanding of the state-of-the-art random matrix theory tools used to derive our results. In particular, for our analysis we require information about macroscopic, mesoscopic and microscopic statistics of eigenvalues of random matrices which we highlight here. Furthermore, we provide numerical simulations that corroborate our analytical findings and extend this notion of mixing from simple graphs to any ergodic, reversible, Markov chain.Comment: The section concerning time-averaged mixing (Sec VIII) has been updated: Now contains numerical plots and an intuitive discussion on the random matrix theory results used to derive the results of arXiv:2001.0630

Supershells in Metal Clusters: Self-Consistent Calculations and their Semiclassical Interpretation

To understand the electronic shell- and supershell-structure in large metal clusters we have performed self-consistent calculations in the homogeneous, spherical jellium model for a variety of different materials. A scaling analysis of the results reveals a surprisingly simple dependence of the supershells on the jellium density. It is shown how this can be understood in the framework of a periodic-orbit-expansion by analytically extending the well-known semiclassical treatment of a spherical cavity to more realistic potentials.Comment: 4 pages, revtex, 3 eps figures included, for additional information see http://radix2.mpi-stuttgart.mpg.de/koch/Diss

LNCS

We provide a procedure for detecting the sub-segments of an incrementally observed Boolean signal ω that match a given temporal pattern ϕ. As a pattern specification language, we use timed regular expressions, a formalism well-suited for expressing properties of concurrent asynchronous behaviors embedded in metric time. We construct a timed automaton accepting the timed language denoted by ϕ and modify it slightly for the purpose of matching. We then apply zone-based reachability computation to this automaton while it reads ω, and retrieve all the matching segments from the results. Since the procedure is automaton based, it can be applied to patterns specified by other formalisms such as timed temporal logics reducible to timed automata or directly encoded as timed automata. The procedure has been implemented and its performance on synthetic examples is demonstrated