Nicanor Carrasco-Vargas
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Nicanor Carrasco-Vargas has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Cristobal Rojas
Pontificia Universidad Católica de Chile
1 shared publication Cristóbal Rojas
1 shared publication- Sebastián Barbieri
Departamento de Matemática y Ciencia de la Computación Universidad de Santiago de Chile Santiago Chile
1 shared publication Valentino Delle Rose
1 shared publication
Latest Publications
- 10 February 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 386, 139-155
Paths, ends and the separation problem for infinite graphs
- 10 February 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 386, 139-155
Paths, ends and the separation problem for infinite graphs
- Open Access
The strong topological Rokhlin property and Medvedev degrees of SFTs
We prove that if a recursively presented group admits a (nonempty) subshift of finite type with nonzero Medvedev degree then it fails to have the strong topological Rokhlin property. This result simplifies a known criterion and provides new examples of recursively presented groups without this property.
Open AccessThe strong topological Rokhlin property and Medvedev degrees of SFTs
We prove that if a recursively presented group admits a (nonempty) subshift of finite type with nonzero Medvedev degree then it fails to have the strong topological Rokhlin property. This result simplifies a known criterion and provides new examples of recursively presented groups without this property.
- Open AccessTopological slow entropy, sequence entropy, and generalized $[T,T^{-1}]$ systemsWe consider topological dynamical systems given by skew products $S\rtimes_τ T$, where $S\colon Y\to Y$ is a subshift, $τ\colon Y\to\mathbb{Z}$ is a continuous cocycle, and $T$ is an arbitrary invertible topological system. For fixed $(Y,S,τ)$ it may happen that all systems of the form $S\rtimes_τT$ have the same topological entropy, and thus it arises the problem of distinguishing two such systems. We show that if $T_1$ and $T_2$ are invertible topological dynamical systems with different topological entropy then $S\rtimes_τ T_1$ and $S\rtimes_τ T_1$ can be distinguished using slow entropy as introduced by Katok and Thouvenot. We prove a similar result under the assumption that the fiber systems have different slow entropy at some scale (this can be applied if $T_1$ and $T_2$ have both zero entropy, or have the same entropy). These results require rather mild assumptions on $(Y,S,τ)$, and can be applied to some entropy-zero systems in the base. We generalize classical results in the theory of sequence entropy, which were proved by Goodman with the additional assumption of finite topological dimension. We show that the measure-theoretic sequence entropy of any system is bounded by its topological sequence entropy. Under an extra assumption on the sequence we establish a variational principle, and prove that the topological sequence entropy of a system equals its topological entropy multiplied by a positive constant that depends only on the sequence.Open AccessTopological slow entropy, sequence entropy, and generalized $[T,T^{-1}]$ systemsWe consider topological dynamical systems given by skew products $S\rtimes_τ T$, where $S\colon Y\to Y$ is a subshift, $τ\colon Y\to\mathbb{Z}$ is a continuous cocycle, and $T$ is an arbitrary invertible topological system. For fixed $(Y,S,τ)$ it may happen that all systems of the form $S\rtimes_τT$ have the same topological entropy, and thus it arises the problem of distinguishing two such systems. We show that if $T_1$ and $T_2$ are invertible topological dynamical systems with different topological entropy then $S\rtimes_τ T_1$ and $S\rtimes_τ T_1$ can be distinguished using slow entropy as introduced by Katok and Thouvenot. We prove a similar result under the assumption that the fiber systems have different slow entropy at some scale (this can be applied if $T_1$ and $T_2$ have both zero entropy, or have the same entropy). These results require rather mild assumptions on $(Y,S,τ)$, and can be applied to some entropy-zero systems in the base. We generalize classical results in the theory of sequence entropy, which were proved by Goodman with the additional assumption of finite topological dimension. We show that the measure-theoretic sequence entropy of any system is bounded by its topological sequence entropy. Under an extra assumption on the sequence we establish a variational principle, and prove that the topological sequence entropy of a system equals its topological entropy multiplied by a positive constant that depends only on the sequence.
- 1 May 2025
- Published by SAGE Publications in Computability
- Vol. 14 (2) , 95-110
Infinite Eulerian paths are computable on graphs with vertices of infinite degree
The Erdős, Grünwald, and Weiszfeld theorem is a characterization of those infinite graphs which are Eulerian. That is, infinite graphs that admit infinite Eulerian paths. In this article, we prove an effective version of the Erdős, Grünwald, and Weiszfeld theorem for a class of graphs where vertices of infinite degree are allowed, generalizing a theorem of D. Bean. Our results are obtained from a characterization of those finite paths in a graph that can be extended to infinite Eulerian paths.
- 1 May 2025
- Published by SAGE Publications in Computability
- Vol. 14 (2) , 95-110
Infinite Eulerian paths are computable on graphs with vertices of infinite degree
The Erdős, Grünwald, and Weiszfeld theorem is a characterization of those infinite graphs which are Eulerian. That is, infinite graphs that admit infinite Eulerian paths. In this article, we prove an effective version of the Erdős, Grünwald, and Weiszfeld theorem for a class of graphs where vertices of infinite degree are allowed, generalizing a theorem of D. Bean. Our results are obtained from a characterization of those finite paths in a graph that can be extended to infinite Eulerian paths.
- 29 April 2025
- Published by Springer Nature in Archiv der Mathematik
- Vol. 124 (6) , 591-603
On a Rice theorem for dynamical properties of SFTs on groups
- 29 April 2025
- Published by Springer Nature in Archiv der Mathematik
- Vol. 124 (6) , 591-603
On a Rice theorem for dynamical properties of SFTs on groups
- 11 October 2024
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- p. 1-41
Effective dynamical systems beyond dimension zero and factors of SFTs
Using tools from computable analysis, we develop a notion of effectiveness for general dynamical systems as those group actions on arbitrary spaces that contain a computable representative in their topological conjugacy class. Most natural systems one can think of are effective in this sense, including some group rotations, affine actions on the torus and finitely presented algebraic actions. We show that for finitely generated and recursively presented groups, every effective dynamical system is the topological factor of a computable action on an effectively closed subset of the Cantor space. We then apply this result to extend the simulation results available in the literature beyond zero-dimensional spaces. In particular, we show that for a large class of groups, many of these natural actions are topological factors of subshifts of finite type.
- 11 October 2024
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- p. 1-41
Effective dynamical systems beyond dimension zero and factors of SFTs
Using tools from computable analysis, we develop a notion of effectiveness for general dynamical systems as those group actions on arbitrary spaces that contain a computable representative in their topological conjugacy class. Most natural systems one can think of are effective in this sense, including some group rotations, affine actions on the torus and finitely presented algebraic actions. We show that for finitely generated and recursively presented groups, every effective dynamical system is the topological factor of a computable action on an effectively closed subset of the Cantor space. We then apply this result to extend the simulation results available in the literature beyond zero-dimensional spaces. In particular, we show that for a large class of groups, many of these natural actions are topological factors of subshifts of finite type.
- 8 August 2024
- Published by European Mathematical Society - EMS - Publishing House GmbH in Groups, Geometry, and Dynamics
- Vol. 20 (1) , 307-340
Translation-like actions by $\mathbb{Z}$, the subgroup membership problem, and Medvedev degrees of effective subshiftsWe show that every infinite, locally finite, and connected graph admits a translation-like action by \mathbb{Z} , and that this action can be taken to be transitive exactly when the graph has either one or two ends. The actions constructed satisfy d(v,v\ast1)\leq3 for every vertex v . This strengthens a theorem by Brandon Seward. We also study the effective computability of translation-like actions on groups and graphs. We prove that every finitely generated infinite group with decidable word problem admits a translation-like action by \mathbb{Z} which is computable and satisfies an extra condition which we call decidable orbit membership problem. As a nontrivial application of our results, we prove that for every finitely generated infinite group with decidable word problem, effective subshifts attain all \Pi_{1}^{0} Medvedev degrees. This extends a classification proved by Joseph Miller for \mathbb{Z}^{d},\,d\geq1 .
- 8 August 2024
- Published by European Mathematical Society - EMS - Publishing House GmbH in Groups, Geometry, and Dynamics
- Vol. 20 (1) , 307-340
Translation-like actions by $\mathbb{Z}$, the subgroup membership problem, and Medvedev degrees of effective subshiftsWe show that every infinite, locally finite, and connected graph admits a translation-like action by \mathbb{Z} , and that this action can be taken to be transitive exactly when the graph has either one or two ends. The actions constructed satisfy d(v,v\ast1)\leq3 for every vertex v . This strengthens a theorem by Brandon Seward. We also study the effective computability of translation-like actions on groups and graphs. We prove that every finitely generated infinite group with decidable word problem admits a translation-like action by \mathbb{Z} which is computable and satisfies an extra condition which we call decidable orbit membership problem. As a nontrivial application of our results, we prove that for every finitely generated infinite group with decidable word problem, effective subshifts attain all \Pi_{1}^{0} Medvedev degrees. This extends a classification proved by Joseph Miller for \mathbb{Z}^{d},\,d\geq1 .