SearcharxivSearch

arXiv subjects

Alejandro Maass

Publications and source records attributed to Alejandro Maass.

At least 19 recordsLinked to original sources

Topological weak mixing for certain linear involutions of hyperelliptic type

A linear involution is an injective piecewise isometry defined on a pair of disjoint intervals. They are defined by a combinatorial data given by a generalized permutation and a length vector. As it was done for interval exchange transformations, it is conjectured that, except for some combinatorial data, a typical linear involution is measure-theoretically weakly mixing. In this direction, one may first explore the question of topological weak mixing for topological models of linear involutions. In this article we prove topological weak mixing for the natural symbolic codings of typical linear involutions defined by some generalized permutations of hyperelliptic type. We consider the generalized permutation \[ \sigma_{s,r} = \begin{pmatrix} 0 & A & 1 & 2 & \cdots & s & A & s+1 & s+2 & \cdots & s+r \\ s+r & \cdots & s+2 & s+1 & B & s & \cdots & 2 & 1 & B & 0 \end{pmatrix}. \] We prove that the natural symbolic coding of a typical linear involution defined by a generalized permutation in the Rauzy class of $\sigma_{s,r}$ is topologically weakly mixing, provided that it has at least a simple letter and its associated genus is sufficiently large.

math.DS

A pointwise ergodic theorem along return times of rapidly mixing systems

We introduce a new class of sparse sequences that are ergodic and pointwise universally $L^2$-good for ergodic averages. That is, sequences along which the ergodic averages converge almost surely to the projection to invariant functions. These sequences are generated randomly as return or hitting times in systems exhibiting a rapid correlation decay. This can be seen as a natural variant of Bourgain's Return Times Theorem. As an example, we obtain that for any $a\in (0,1/2)$, the sequence $\left\{n\in\mathbb{N}:\ 2^ny\mod{1}\in (0,n^{-a})\right\}$ is ergodic and pointwise universally $L^2$-good for Lebesgue almost every $y\in [0,1]$. Our approach builds on techniques developed by Frantzikinakis, Lesigne, and Wierdl in their study of sequences generated by independent random variables, which we adapt to the non-independent case.

math.DS

On recurrence for $\mathbb{Z}^d$-Weyl systems

We study the topological recurrence phenomenon of actions of locally compact abelian groups on compact metric spaces. In the case of $\mathbb{Z}^d$-actions we develop new techniques to analyze Bohr recurrence sets. These techniques include finding and manipulating correlations between the coordinates of the set of recurrence. Using this, we show that Bohr recurrence sets are recurrence sets for $\mathbb{Z}^d$-Weyl systems. This family encompasses, for example, all $\mathbb{Z}^d$-affine nilsystems. To our knowledge, this is the first result towards a positive answer to Katznelson question in the case of $\mathbb{Z}^d$-actions.

math.DS

On partial rigidity of $\mathcal{S}$-adic subshifts

We develop combinatorial tools to study partial rigidity within the class of minimal $\mathcal{S}$-adic subshifts. By leveraging the combinatorial data of well-chosen Kakutani-Rokhlin partitions, we establish a necessary and sufficient condition for partial rigidity. Additionally, we provide an explicit expression to compute the partial rigidity rate and an associated partial rigidity sequence. As applications, we compute the partial rigidity rate for a variety of constant length substitution subshifts, such as the Thue-Morse subshift, where we determine a partial rigidity rate of 2/3. We also exhibit non-rigid substitution subshifts with partial rigidity rates arbitrarily close to 1 and as a consequence, using products of the aforementioned substitutions, we obtain that any number in $[0, 1]$ is the partial rigidity rate of a system.

math.DS

A geometric framework for asymptoticity and expansivity in topological dynamics

We develop a geometric framework to address asymptoticity and nonexpansivity in topological dynamics. Our framework can be applied when the acting group is second countable and locally compact. As an application, we show extensions of Schwartzman's theorem in this context. Also, we get new results when the acting groups is ${\mathbb Z}^d$: any half-space of ${\mathbb R}^d$ contains a vector defining a (oriented) nonexpansive direction in the sense of Boyle and Lind. Finally, we deduce rigidity properties of distal Cantor systems.

math.DS

Directional mean dimension and continuum-wise expansive $\mathbb{Z}^k$-actions

We study directional mean dimension of $\mathbb{Z}^k$-actions (where $k$ is a positive integer). On the one hand, we show that there is a $\mathbb{Z}^2$-action whose directional mean dimension (considered as a $[0,+\infty]$-valued function on the torus) is not continuous. On the other hand, we prove that if a $\mathbb{Z}^k$-action is continuum-wise expansive, then the values of its $(k-1)$-dimensional directional mean dimension are bounded. This is a generalization (with a view towards Meyerovitch and Tsukamoto's theorem on mean dimension and expansive multiparameter actions) of a classical result due to Ma\~n\'e: Any compact metrizable space admitting an expansive homeomorphism (with respect to a compatible metric) is finite-dimensional.

math.DS

Data Science for Engineers: A Teaching Ecosystem

We describe an ecosystem for teaching data science (DS) to engineers which blends theory, methods, and applications, developed at the Faculty of Physical and Mathematical Sciences, Universidad de Chile, over the last three years. This initiative has been motivated by the increasing demand for DS qualifications both from academic and professional environments. The ecosystem is distributed in a collaborative fashion across three departments in the above Faculty and includes postgraduate programmes, courses, professional diplomas, data repositories, laboratories, trainee programmes, and internships. By sharing our teaching principles and the innovative components of our approach to teaching DS, we hope our experience can be useful to those developing their own DS programmes and ecosystems. The open challenges and future plans for our ecosystem are also discussed at the end of the article.

cs.CY

On the automorphism group of minimal S-adic subshifts of finite alphabet rank

It has been recently proved that the automorphism group of a minimal subshift with non-superlinear word complexity is virtually $\mathbb{Z}$ [DDPM15, CK15]. In this article we extend this result to a broader class proving that the automorphism group of a minimal S-adic subshift of finite alphabet rank is virtually $\mathbb{Z}$. The proof is based on a fine combinatorial analysis of the asymptotic classes in this type of subshifts, which we prove are a finite number.

math.DS

Interplay between finite topological rank minimal Cantor systems, $\mathcal S$-adic subshifts and their complexity

Minimal Cantor systems of finite topological rank (that can be represented by a Bratteli-Vershik diagram with a uniformly bounded number of vertices per level) are known to have dynamical rigidity properties. We establish that such systems, when they are expansive, define the same class of systems, up to topological conjugacy, as primitive and recognizable ${\mathcal S}$-adic subshifts. This is done establishing necessary and sufficient conditions for a minimal subshift to be of finite topological rank. As an application, we show that minimal subshifts with non-superlinear complexity (like all classical zero entropy examples) have finite topological rank. Conversely, we analyze the complexity of ${\mathcal S}$-adic subshifts and provide sufficient conditions for a finite topological rank subshift to have a non-superlinear complexity. This includes minimal Cantor systems given by Bratteli-Vershik representations whose tower levels have proportional heights and the so called left to right ${\mathcal S}$-adic subshifts. We also exhibit that finite topological rank does not imply non-superlinear complexity. In the particular case of topological rank 2 subshifts, we prove their complexity is always subquadratic along a subsequence and their automorphism group is trivial.

math.DS

Directional dynamical cubes for minimal $\mathbb{Z}^{d}$-systems

We introduce the notions of directional dynamical cubes and directional regionally proximal relation defined via these cubes for a minimal $\mathbb{Z}^d$-system $(X,T_1,\ldots,T_d)$. We study the structural properties of systems that satisfy the so called unique closing parallelepiped property and we characterize them in several ways. In the distal case, we build the maximal factor of a $\mathbb{Z}^d$-system $(X,T_1,\ldots,T_d)$ that satisfies this property by taking the quotient with respect to the directional regionally proximal relation. Finally, we completely describe distal $\mathbb{Z}^d$-systems that enjoy the unique closing parallelepiped property and provide explicit examples.

math.DS

Creation and analysis of biochemical constraint-based models: the COBRA Toolbox v3.0

COnstraint-Based Reconstruction and Analysis (COBRA) provides a molecular mechanistic framework for integrative analysis of experimental data and quantitative prediction of physicochemically and biochemically feasible phenotypic states. The COBRA Toolbox is a comprehensive software suite of interoperable COBRA methods. It has found widespread applications in biology, biomedicine, and biotechnology because its functions can be flexibly combined to implement tailored COBRA protocols for any biochemical network. Version 3.0 includes new methods for quality controlled reconstruction, modelling, topological analysis, strain and experimental design, network visualisation as well as network integration of chemoinformatic, metabolomic, transcriptomic, proteomic, and thermochemical data. New multi-lingual code integration also enables an expansion in COBRA application scope via high-precision, high-performance, and nonlinear numerical optimisation solvers for multi-scale, multi-cellular and reaction kinetic modelling, respectively. This protocol can be adapted for the generation and analysis of a constraint-based model in a wide variety of molecular systems biology scenarios. This protocol is an update to the COBRA Toolbox 1.0 and 2.0. The COBRA Toolbox 3.0 provides an unparalleled depth of constraint-based reconstruction and analysis methods.

q-bio.QM

Characterization of minimal sequences associated with self-similar interval exchange maps

The construction of affine interval exchange maps with wandering intervals that are semi-conjugate with a given self-similar interval exchange map is strongly related with the existence of the so called minimal sequences associated with local potentials, which are certain elements of the substitution subshift arising from the given interval exchange map. In this article, under the condition called unique representation property, we characterize such minimal sequences for potentials coming from non-real eigenvalues of the substitution matrix. We also give conditions on the slopes of the affine extensions of a self-similar interval exchange map that determine whether it exhibits a wandering interval or not.

math.DS

On automorphism groups of Toeplitz subshifts

In this article we study automorphisms of Toeplitz subshifts. Such groups are abelian and any finitely generated torsion subgroup is finite and cyclic. When the complexity is non superlinear, we prove that the automorphism group is, modulo a finite cyclic group, generated by a unique root of the shift. In the subquadratic complexity case, we show that the automorphism group modulo the torsion is generated by the roots of the shift map and that the result of the non superlinear case is optimal. Namely, for any $\varepsilon > 0$ we construct examples of minimal Toeplitz subshifts with complexity bounded by $C n^{1+\epsilon}$ whose automorphism groups are not finitely generated. Finally, we observe the coalescence and the automorphism group give no restriction on the complexity since we provide a family of coalescent Toeplitz subshifts with positive entropy such that their automorphism groups are arbitrary finitely generated infinite abelian groups with cyclic torsion subgroup (eventually restricted to powers of the shift).

math.DS

Wandering intervals in affine extensions of self-similar interval exchange maps: the cubic Arnoux-Yoccoz map

In this article we provide sufficient conditions on a self-similar interval exchange map, whose renormalization matrix has complex eigenvalues of modulus greater than one, for the existence of affine interval exchange maps with wandering intervals and semi-conjugate with it. These conditions are based on the algebraic properties of the complex eigenvalues and the complex fractals built from the natural substitution emerging from self-similarity. We show that the cubic Arnoux-Yoccoz interval exchange map satisfies these conditions.

math.DS

Eigenvalues of Toeplitz minimal systems of finite topological rank

In this article we characterize measure theoretical eigenvalues of Toeplitz Bratteli-Vershik minimal systems of finite topological rank which are not associated to a continuous eigenfunction. Several examples are provided to illustrate the different situations that can occur.

math.DS

Eigenvalues of minimal Cantor systems

In this article we give necessary and sufficient conditions that a complex number must satisfy to be a continuous eigenvalue of a minimal Cantor system. Similarly, for minimal Cantor systems of finite rank, we provide necessary and sufficient conditions for having a measure theoretical eigenvalue. These conditions are established from the combinatorial information of the Bratteli-Vershik representations of such systems. As an application, from any minimal Cantor system, we construct a strong orbit equivalent system without irrational eigenvalues which shares all measure theoretical eigenvalues with the original system. In a second application a minimal Cantor system is constructed satisfying the so-called maximal continuous eigenvalue group property.

math.DS

On automorphism groups of low complexity subshifts

In this article we study the automorphism group ${\rm Aut}(X,\sigma)$ of subshifts $(X,\sigma)$ of low word complexity. In particular, we prove that Aut$(X,\sigma)$ is virtually $\mathbb{Z}$ for aperiodic minimal subshifts and certain transitive subshifts with non-superlinear complexity. More precisely, the quotient of this group relative to the one generated by the shift map is a finite group. In addition, we show that any finite group can be obtained in this way. The class considered includes minimal subshifts induced by substitutions, linearly recurrent subshifts and even some subshifts which simultaneously exhibit non-superlinear and superpolynomial complexity along different subsequences. The main technique in this article relies on the study of classical relations among points used in topological dynamics, in particular, asymptotic pairs. Various examples that illustrate the technique developed in this article are provided. In particular, we prove that the group of automorphisms of a $d$-step nilsystem is nilpotent of order $d$ and from there we produce minimal subshifts of arbitrarily large polynomial complexity whose automorphism groups are also virtually $\mathbb{Z}$.

math.DS

Variations on topological recurrence

Recurrence properties of systems and associated sets of integers that suffice for recurrence are classical objects in topological dynamics. We describe relations between recurrence in different sorts of systems, study ways to formulate finite versions of recurrence, and describe connections to combinatorial problems. In particular, we show that sets of Bohr recurrence (meaning sets of recurrence for rotations) suffice for recurrence in nilsystems. Additionally, we prove an extension of this property for multiple recurrence in affine systems.

math.DS