904 research outputs found
Integrable Combinatorics
We review various combinatorial problems with underlying classical or quantum
integrable structures. (Plenary talk given at the International Congress of
Mathematical Physics, Aalborg, Denmark, August 10, 2012.)Comment: 21 pages, 16 figures, proceedings of ICMP1
Massively sub-wavelength guiding of electromagnetic waves
Open Access journalRecently a new form of ultra-thin flexible waveguide consisting of a conducting comb-like structure with a thickness of the order of 1/600(th) of the operating wavelength was presented. However, whilst the thickness of the guide was massively sub-wavelength, the remaining dimensions (the height and period of the comb) were much longer. In this paper we propose, and experimentally verify, that a modified guiding geometry consisting of a chain of ultra-thin conducting spirals allows guiding of electromagnetic waves with wavelengths that are many times (40+) longer than any characteristic dimension of the guide, enabling super-sub-wavelength guiding and localisation of electromagnetic energy.Engineering and Physical Sciences Research Council (EPSRC
Local Statistics and Shuffling for Dimers on a Square-Hexagon Lattice
We study the dimer model on special subgraphs of the square hexagon lattice
called "tower graphs" of size . Using integrable probability techniques, we
confirm that as , the local statistics are translation
invariant Gibbs measures, as conjectured by Kenyon-Okounkov-Sheffield. We also
present a 2+1-dimensional discrete time growth process, whose time
distribution is exactly the dimer model on the size tower, and we compute
the current of this growth process and confirm that the model belongs to the
Anisotropic KPZ universality class.Comment: 30 pages, 17 figure
Modeling and manufacturability assessment of bistable quantum-dot cells
We have investigated the behavior of bistable cells made up of four quantum
dots and occupied by two electrons, in the presence of realistic confinement
potentials produced by depletion gates on top of a GaAs/AlGaAs heterostructure.
Such a cell represents the basic building block for logic architectures based
on the concept of Quantum Cellular Automata (QCA) and of ground state
computation, which have been proposed as an alternative to traditional
transistor-based logic circuits. We have focused on the robustness of the
operation of such cells with respect to asymmetries deriving from fabrication
tolerances. We have developed a 2-D model for the calculation of the electron
density in a driven cell in response to the polarization state of a driver
cell. Our method is based on the one-shot Configuration-Interaction technique,
adapted from molecular chemistry. From the results of our simulations, we
conclude that an implementation of QCA logic based on simple ``hole-arrays'' is
not feasible, because of the extreme sensitivity to fabrication tolerances. As
an alternative, we propose cells defined by multiple gates, where geometrical
asymmetries can be compensated for by adjusting the bias voltages. Even though
not immediately applicable to the implementation of logic gates and not
suitable for large scale integration, the proposed cell layout should allow an
experimental demonstration of a chain of QCA cells.Comment: 26 pages, Revtex, 13 figures, title and some figures changed and
minor revision
Proceedings of JAC 2010. Journées Automates Cellulaires
The second Symposium on Cellular Automata “Journ´ees Automates Cellulaires” (JAC 2010) took place in Turku, Finland, on December 15-17, 2010. The first two conference days were held in the Educarium building of the University of Turku, while the talks of the third day were given onboard passenger ferry boats in the beautiful Turku archipelago, along the route Turku–Mariehamn–Turku. The conference was organized by FUNDIM, the Fundamentals of Computing and Discrete Mathematics research center at the mathematics department of the University of Turku.
The program of the conference included 17 submitted papers that were selected by the international program committee, based on three peer reviews of each paper. These papers form the core of these proceedings. I want to thank the members of the program committee and the external referees for the excellent work that have done in choosing the papers to be presented in the conference. In addition to the submitted papers, the program of JAC 2010 included four distinguished invited speakers: Michel Coornaert (Universit´e de Strasbourg, France), Bruno Durand (Universit´e de Provence, Marseille, France), Dora Giammarresi (Universit` a di Roma Tor Vergata, Italy) and Martin Kutrib (Universit¨at Gie_en, Germany). I sincerely thank the invited speakers for accepting our invitation to come and give a plenary talk in the conference. The invited talk by Bruno Durand was eventually given by his co-author Alexander Shen, and I thank him for accepting to make the presentation with a short notice. Abstracts or extended abstracts of the invited presentations appear in the first part of this volume.
The program also included several informal presentations describing very recent developments and ongoing research projects. I wish to thank all the speakers for their contribution to the success of the symposium. I also would like to thank the sponsors and our collaborators: the Finnish Academy of Science and Letters, the French National Research Agency project EMC (ANR-09-BLAN-0164), Turku Centre for Computer Science, the University of Turku, and Centro Hotel. Finally, I sincerely thank the members of the local organizing committee for making the conference possible.
These proceedings are published both in an electronic format and in print. The electronic proceedings are available on the electronic repository HAL, managed by several French research agencies. The printed version is published in the general publications series of TUCS, Turku Centre for Computer Science. We thank both HAL and TUCS for accepting to publish the proceedings.Siirretty Doriast
Arctic octahedron in three-dimensional rhombus tilings and related integer solid partitions
Three-dimensional integer partitions provide a convenient representation of
codimension-one three-dimensional random rhombus tilings. Calculating the
entropy for such a model is a notoriously difficult problem. We apply
transition matrix Monte Carlo simulations to evaluate their entropy with high
precision. We consider both free- and fixed-boundary tilings. Our results
suggest that the ratio of free- and fixed-boundary entropies is
, and can be interpreted as the ratio of the
volumes of two simple, nested, polyhedra. This finding supports a conjecture by
Linde, Moore and Nordahl concerning the ``arctic octahedron phenomenon'' in
three-dimensional random tilings
Noncooperative algorithms in self-assembly
We show the first non-trivial positive algorithmic results (i.e. programs
whose output is larger than their size), in a model of self-assembly that has
so far resisted many attempts of formal analysis or programming: the planar
non-cooperative variant of Winfree's abstract Tile Assembly Model.
This model has been the center of several open problems and conjectures in
the last fifteen years, and the first fully general results on its
computational power were only proven recently (SODA 2014). These results, as
well as ours, exemplify the intricate connections between computation and
geometry that can occur in self-assembly.
In this model, tiles can stick to an existing assembly as soon as one of
their sides matches the existing assembly. This feature contrasts with the
general cooperative model, where it can be required that tiles match on
\emph{several} of their sides in order to bind.
In order to describe our algorithms, we also introduce a generalization of
regular expressions called Baggins expressions. Finally, we compare this model
to other automata-theoretic models.Comment: A few bug fixes and typo correction
- …