1,773 research outputs found
Subshifts, MSO Logic, and Collapsing Hierarchies
We use monadic second-order logic to define two-dimensional subshifts, or
sets of colorings of the infinite plane. We present a natural family of
quantifier alternation hierarchies, and show that they all collapse to the
third level. In particular, this solves an open problem of [Jeandel & Theyssier
2013]. The results are in stark contrast with picture languages, where such
hierarchies are usually infinite.Comment: 12 pages, 5 figures. To appear in conference proceedings of TCS 2014,
published by Springe
Quasiperiodicity and non-computability in tilings
We study tilings of the plane that combine strong properties of different
nature: combinatorial and algorithmic. We prove existence of a tile set that
accepts only quasiperiodic and non-recursive tilings. Our construction is based
on the fixed point construction; we improve this general technique and make it
enforce the property of local regularity of tilings needed for
quasiperiodicity. We prove also a stronger result: any effectively closed set
can be recursively transformed into a tile set so that the Turing degrees of
the resulted tilings consists exactly of the upper cone based on the Turing
degrees of the later.Comment: v3: the version accepted to MFCS 201
Return times, recurrence densities and entropy for actions of some discrete amenable groups
Results of Wyner and Ziv and of Ornstein and Weiss show that if one observes
the first k outputs of a finite-valued ergodic process, then the waiting time
until this block appears again is almost surely asymptotic to , where
is the entropy of the process. We examine this phenomenon when the allowed
return times are restricted to some subset of times, and generalize the results
to processes parameterized by other discrete amenable groups.
We also obtain a uniform density version of the waiting time results: For a
process on symbols, within a given realization, the density of the initial
-block within larger -blocks approaches , uniformly in ,
as tends to infinity. Again, similar results hold for processes with other
indexing groups.Comment: To appear in Journal d'Analyse Mathematiqu
On the density of periodic configurations in strongly irreducible subshifts
Let be a residually finite group and let be a finite set. We prove
that if is a strongly irreducible subshift of finite type
containing a periodic configuration then periodic configurations are dense in
. The density of periodic configurations implies in particular that every
injective endomorphism of is surjective and that the group of automorphisms
of is residually finite. We also introduce a class of subshifts , including all strongly irreducible subshifts and all irreducible sofic
subshifts, in which periodic configurations are dense
Reformas, instituições e políticas de saúde no Brasil (1930-1945)
O objetivo geral desse artigo é descrever e analisar de modo sucinto as principais mudanças institucionais e tendências políticas no setor de saúde durante o Primeiro Governo Vargas, em particular na gestão de Gustavo Capanema, no Ministério da Educação e Saúde (1934-1945). Um aspecto enfatizado no artigo é a relação entre as reformas da saúde e as mudanças e ideologia do regime político instaurado em 1930, indicando permanências e rupturas em relação ao período republicano anterior, assim como os impactos dessas reformas sobre a saúde pública no Brasil contemporâneo
- …