114 research outputs found
Dold sequences, periodic points, and dynamics
In this survey we describe how the so-called Dold congruence arises in
topology, and how it relates to periodic point counting in dynamical systems.Comment: 38 pages; surve
MFCS\u2798 Satellite Workshop on Cellular Automata
For the 1998 conference on Mathematical Foundations of Computer
Science (MFCS\u2798) four papers on Cellular Automata were accepted as
regular MFCS\u2798 contributions. Furthermore an MFCS\u2798 satellite
workshop on Cellular Automata was organized with ten additional talks.
The embedding of the workshop into the conference with its
participants coming from a broad spectrum of fields of work lead to
interesting discussions and a fruitful exchange of ideas.
The contributions which had been accepted for MFCS\u2798 itself may be
found in the conference proceedings, edited by L. Brim, J. Gruska and
J. Zlatuska, Springer LNCS 1450. All other (invited and regular)
papers of the workshop are contained in this technical report. (One
paper, for which no postscript file of the full paper is available, is
only included in the printed version of the report).
Contents:
F. Blanchard, E. Formenti, P. Kurka: Cellular automata in the Cantor,
Besicovitch and Weyl Spaces
K. Kobayashi: On Time Optimal Solutions of the Two-Dimensional Firing
Squad Synchronization Problem
L. Margara: Topological Mixing and Denseness of Periodic Orbits for
Linear Cellular Automata over Z_m
B. Martin: A Geometrical Hierarchy of Graph via Cellular Automata
K. Morita, K. Imai: Number-Conserving Reversible Cellular Automata and
Their Computation-Universality
C. Nichitiu, E. Remila: Simulations of graph automata
K. Svozil: Is the world a machine?
H. Umeo: Cellular Algorithms with 1-bit Inter-Cell Communications
F. Reischle, Th. Worsch: Simulations between alternating CA,
alternating TM and circuit families
K. Sutner: Computation Theory of Cellular Automat
Iterated function systems and permutation representations of the Cuntz algebra
We study a class of representations of the Cuntz algebras O_N, N=2,3,...,
acting on L^2(T) where T=R/2\pi Z. The representations arise in wavelet theory,
but are of independent interest. We find and describe the decomposition into
irreducibles, and show how the O_N-irreducibles decompose when restricted to
the subalgebra UHF_N\subset O_N of gauge-invariant elements; and we show that
the whole structure is accounted for by arithmetic and combinatorial properties
of the integers Z. We have general results on a class of representations of O_N
on Hilbert space H such that the generators S_i as operators permute the
elements in some orthonormal basis for H. We then use this to extend our
results from L^2(T) to L^2(T^d), d>1 ; even to L^2(\mathbf{T}) where \mathbf{T}
is some fractal version of the torus which carries more of the algebraic
information encoded in our representations.Comment: 84 pages, 11 figures, AMS-LaTeX v1.2b, full-resolution figures
available at ftp://ftp.math.uiowa.edu/pub/jorgen/PermRepCuntzAlg in eps files
with the same names as the low-resolution figures included her
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization
International audienceThe Cologne-Twente Workshop (CTW) on Graphs and Combinatorial Optimization started off as a series of workshops organized bi-annually by either Köln University or Twente University. As its importance grew over time, it re-centered its geographical focus by including northern Italy (CTW04 in Menaggio, on the lake Como and CTW08 in Gargnano, on the Garda lake). This year, CTW (in its eighth edition) will be staged in France for the first time: more precisely in the heart of Paris, at the Conservatoire National d’Arts et Métiers (CNAM), between 2nd and 4th June 2009, by a mixed organizing committee with members from LIX, Ecole Polytechnique and CEDRIC, CNAM
Large bichromatic point sets admit empty monochromatic 4-gons
We consider a variation of a problem stated by ErdËťos
and Szekeres in 1935 about the existence of a number
fES(k) such that any set S of at least fES(k) points in
general position in the plane has a subset of k points
that are the vertices of a convex k-gon. In our setting
the points of S are colored, and we say that a (not necessarily
convex) spanned polygon is monochromatic if
all its vertices have the same color. Moreover, a polygon
is called empty if it does not contain any points of
S in its interior. We show that any bichromatic set of
n ≥ 5044 points in R2 in general position determines
at least one empty, monochromatic quadrilateral (and
thus linearly many).Postprint (published version
- …