Sofic subshifts and piecewise isometric systems

1999 ◽  
Vol 19 (6) ◽  
pp. 1485-1501 ◽  
Author(s):  
AREK GOETZ

We study the natural symbolic dynamics associated with piecewise continuous, non-invertible, dynamical systems. Our study is centered primarily on the relationship between the point-set topological properties of the partition of the system and the symbolic coding. We prove that for a class of maps locally preserving distances with regular partition, the associated symbolic dynamics cannot embed subshifts of finite type of positive entropy. Hence, in particular, almost sofic subshifts obtained from the symbolic dynamics have zero entropy. However, there are examples in Euclidean spaces of systems with non-regular partitions for which the coding maps can be surjective, particularly embedding all subshifts. For all such examples, the associated group of isometries is a subgroup of $O(\mathbb{R}, N)$.

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Silvère Gangloff

<p style='text-indent:20px;'>In this text I study the asymptotics of the complexity function of <i>minimal</i> multidimensional subshifts of finite type through their entropy dimension, a topological invariant that has been introduced in order to study zero entropy dynamical systems. Following a recent trend in symbolic dynamics I approach this using concepts from computability theory. In particular it is known [<xref ref-type="bibr" rid="b12">12</xref>] that the possible values of entropy dimension for d-dimensional subshifts of finite type are the <inline-formula><tex-math id="M1">\begin{document}$ \Delta_2 $\end{document}</tex-math></inline-formula>-computable numbers in <inline-formula><tex-math id="M2">\begin{document}$ [0, d] $\end{document}</tex-math></inline-formula>. The kind of constructions that underlies this result is however quite complex and minimality has been considered thus far as hard to achieve with it. In this text I prove that this is possible and use the construction principles that I developped in order to prove (in principle) that for all <inline-formula><tex-math id="M3">\begin{document}$ d \ge 2 $\end{document}</tex-math></inline-formula> the possible values for entropy dimensions of <inline-formula><tex-math id="M4">\begin{document}$ d $\end{document}</tex-math></inline-formula>-dimensional SFT are the <inline-formula><tex-math id="M5">\begin{document}$ \Delta_2 $\end{document}</tex-math></inline-formula>-computable numbers in <inline-formula><tex-math id="M6">\begin{document}$ [0, d-1] $\end{document}</tex-math></inline-formula>. In the present text I prove formally this result for <inline-formula><tex-math id="M7">\begin{document}$ d = 3 $\end{document}</tex-math></inline-formula>. Although the result for other dimensions does not follow directly, it is enough to understand this construction to see that it is possible to reproduce it in higher dimensions (I chose dimension three for optimality in terms of exposition). The case <inline-formula><tex-math id="M8">\begin{document}$ d = 2 $\end{document}</tex-math></inline-formula> requires some substantial changes to be made in order to adapt the construction that are not discussed here.</p>


2021 ◽  
pp. 003802612110063
Author(s):  
Steven Threadgold ◽  
David Farrugia ◽  
Julia Coffey

This article contributes to recent debates about the relationship between affective labour and class by exploring the classed distinctions enacted through affective labour in the urban night-time economy. Bringing theories of affective labour into a dialogue with Bourdieusian feminist analysis, the article explores the affective and symbolic dynamics of hospitality labour in a gentrified inner-urban neighbourhood of Melbourne, Australia. It shows how the practice of hospitality labour enacts classed distinctions and tensions emerging from the gentrification of inner-urban areas, and how the aesthetic and symbolic dimensions of class contribute to the valorisation of affect in hospitality venues. The valorisation of affect are processes in which the value attributed to an atmosphere or consumption experience is based on the forms of distinction practised within the venue, enacted in aesthetics, tastes and modes of embodiment. The article also shows how practices of class distinction – both ‘punching up’ and ‘managing down’ – are connected to the gendered politics of service work in the way that workers manage the threat of violence or sexual harassment in venues. In general, the article shows how the classed dynamics of gentrification are enacted in affective economies, and therefore how Bourdieusian analysis of class can be usefully deployed in theoretical debates about affective labour.


2014 ◽  
Vol 24 (2) ◽  
pp. 407-437 ◽  
Author(s):  
DOMINGOS DELLAMONICA ◽  
SUBRAHMANYAM KALYANASUNDARAM ◽  
DANIEL M. MARTIN ◽  
VOJTĚCH RÖDL ◽  
ASAF SHAPIRA

In this paper we prove that two local conditions involving the degrees and co-degrees in a graph can be used to determine whether a given vertex partition is Frieze–Kannan regular. With a more refined version of these two local conditions we provide a deterministic algorithm that obtains a Frieze–Kannan regular partition of any graphGin timeO(|V(G)|2).


2008 ◽  
Vol DMTCS Proceedings vol. AJ,... (Proceedings) ◽  
Author(s):  
Chris Berg ◽  
Monica Vazirani

International audience In this paper we give an alternate combinatorial description of the "$(\ell,0)$-Carter partitions''. Our main theorem is the equivalence of our combinatoric and the one introduced by James and Mathas ($\textit{A q-analogue of the Jantzen-Schaper theorem}$). The condition of being an $(\ell,0)$-Carter partition is fundamentally related to the hook lengths of the partition. The representation-theoretic significance of their combinatoric on an $\ell$-regular partition is that it indicates the irreducibility of the corresponding Specht module over the finite Hecke algebra. We use our result to find a generating series which counts the number of such partitions, with respect to the statistic of a partition's first part. We then apply our description of these partitions to the crystal graph $B(\Lambda_0)$ of the basic representation of $\widehat{\mathfrak{sl}_{\ell}}$, whose nodes are labeled by $\ell$-regular partitions. Here we give a fairly simple crystal-theoretic rule which generates all $(\ell,0)$-Carter partitions in the graph of $B(\Lambda_0)$. Dans cet article, nous donnons une description combinatoire alternative des partitions "$(\ell,0)$-Carter". Notre théorème principal est une équivalence entre notre combinatoire et celle introduite par James et Mathas ($\textit{A q-analogue of the Jantzen-Schaper theorem}$). La propriété $(\ell,0)$-Carter est fondamentalement liée aux longueurs des équerres de la partition. En terme de théorie des représentations, leur combinatoire pour une partition $\ell$-régulière permet de déterminer l'irréducibilité du module de Specht spécialisé sur l’algèbre de Hecke finie. Nous utilisons notre résultat pour déterminer leur série génératrice en fonction de la taille de la première part. Nous utilisons ensuite notre description de ces partitions au graphe cristallin $B(\Lambda _0)$ de la représentation basique de $\widehat{\mathfrak{sl}_{\ell}}$, dont les nœuds sont étiquetés par les partitions $\ell$-régulières. Nous donnons une règle cristalline relativement simple permettant d'engendrer toutes les partitions $\ell$-régulières $(\ell,0)$-Carter dans le graphe de $B(\Lambda _0)$.


2016 ◽  
Vol 93 (3) ◽  
pp. 410-419 ◽  
Author(s):  
ERIC BOLL ◽  
DAVID PENNISTON

Let $b_{\ell }(n)$ denote the number of $\ell$-regular partitions of $n$. In this paper we establish a formula for $b_{13}(3n+1)$ modulo $3$ and use this to find exact criteria for the $3$-divisibility of $b_{13}(3n+1)$ and $b_{13}(3n)$. We also give analogous criteria for $b_{7}(3n)$ and $b_{7}(3n+2)$.


2019 ◽  
Vol 295 (3-4) ◽  
pp. 1385-1404
Author(s):  
Gabriel Fuhrmann ◽  
Maik Gröger

AbstractWe show how geometric methods from the general theory of fractal dimensions and iterated function systems can be deployed to study symbolic dynamics in the zero entropy regime. More precisely, we establish a dimensional characterization of the topological notion of amorphic complexity. For subshifts with discrete spectrum associated to constant length substitutions, this characterization allows us to derive bounds for the amorphic complexity by interpreting the subshift as the attractor of an iterated function system in a suitable quotient space. As a result, we obtain the general finiteness and positivity of amorphic complexity in this setting and provide a closed formula in case of a binary alphabet.


2016 ◽  
Vol 37 (4) ◽  
pp. 1187-1210 ◽  
Author(s):  
JOSHUA FRISCH ◽  
OMER TAMUZ

Let$G$be a finitely generated amenable group. We study the space of shifts on$G$over a given finite alphabet $A$. We show that the zero entropy shifts are generic in this space, and that, more generally, the shifts of entropy$c$are generic in the space of shifts with entropy at least $c$. The same is shown to hold for the space of transitive shifts and for the space of weakly mixing shifts. As applications of this result, we show that, for every entropy value$c\in [0,\log |A|]$, there is a weakly mixing subshift of$A^{G}$with entropy $c$. We also show that the set of strongly irreducible shifts does not form a$G_{\unicode[STIX]{x1D6FF}}$in the space of shifts, and that all non-trivial, strongly irreducible shifts are non-isolated points in this space.


1991 ◽  
Vol 01 (02) ◽  
pp. 287-308 ◽  
Author(s):  
ROBERT L. DEVANEY

In this paper we describe some of the dynamical behavior of the complex exponential λ exp z. For various values of λ, this family exhibits chaotic behavior on the entire complex plane. For other values, the dynamics are relatively tame. We show how to analyze this behavior via symbolic dynamics and investigate the structural instability at various parameter values. Finally, we describe the relationship between the parameter space for the exponential family and the related families of polynomials given by [Formula: see text].


2012 ◽  
Vol 1 (1) ◽  
pp. 39
Author(s):  
Muhammad Wakhid Musthofa ◽  
Ari Suparwanto

In this paper the observability of continuous descriptor system of the form Ex(t)= Ax(t) Bu(t), x(0)=x0 will be studied, where  E,A, and B are constant matrices that may be singular and u(t) is piecewise continuous function which is differentiated (m-1) times, where m is the degree of nilpotency system. Two definitions about observability of descriptor systems  along with their characterizations given by Dai and Yip will be both discussed, then further the relationship and comparison between these characterizations will be presented.


Sign in / Sign up

Export Citation Format

Share Document