Zoran Šunić
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Zoran Šunić has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
- Rostislav Grigorchuk
Texas A&M University, College Station, USA
4 shared publications Rostislav Grigorchuk
3 shared publications- Volodymyr Nekrashevych
Texas A&M University, College Station, USA
3 shared publications - Warren Dicks
Departament de Matemàtiques, Universitat Autònoma de Barcelona, Bellaterra (Barcelona), Spain
3 shared publications - Andrew Penland
Department of Mathematics, Texas A&M University, College Station, TX 77843-3368, USA
2 shared publications - Delaram Kahrobaei
Computer Science and Mathematics Departments, Queens College CUNY, USA
2 shared publications
Latest Publications
- Open Access
- 1 August 2025
- Published by European Mathematical Society - EMS - Publishing House GmbH in Groups, Geometry, and Dynamics
- Vol. 19 (2) , 567-596
Branch groups with infinite rigid kernel
A theoretical framework is established for explicitly calculating rigid kernels of self-similar regular branch groups. This is applied to a new infinite family of branch groups in order to provide the first examples of self-similar, branch groups with infinite rigid kernel. The groups are analogues of the Hanoi Towers group on 3 pegs, based on the standard actions of finite dihedral groups on regular polygons with odd numbers of vertices, and the rigid kernel is an infinite Cartesian power of the cyclic group of order 2, except for the original Hanoi group. The proofs rely on a symbolic-dynamical approach, related to finitely constrained groups.
- 1 August 2025
- Published by European Mathematical Society - EMS - Publishing House GmbH in Groups, Geometry, and Dynamics
- Vol. 19 (2) , 567-596
Open AccessBranch groups with infinite rigid kernel
A theoretical framework is established for explicitly calculating rigid kernels of self-similar regular branch groups. This is applied to a new infinite family of branch groups in order to provide the first examples of self-similar, branch groups with infinite rigid kernel. The groups are analogues of the Hanoi Towers group on 3 pegs, based on the standard actions of finite dihedral groups on regular polygons with odd numbers of vertices, and the rigid kernel is an infinite Cartesian power of the cyclic group of order 2, except for the original Hanoi group. The proofs rely on a symbolic-dynamical approach, related to finitely constrained groups.
- 6 May 2022
- Published by Springer Nature
- p. 299-311
On One-Counter Positive Cones of Free Groups
- Open Access
- 5 January 2022
- Published by MDPI AG in International Journal of Molecular Sciences
- Vol. 23 (1) , 568
Tracking of Endothelial Cell Migration and Stiffness Measurements Reveal the Role of Cytoskeletal Dynamics
Cell migration is a complex, tightly regulated multistep process in which cytoskeletal reorganization and focal adhesion redistribution play a central role. Core to both individual and collective migration is the persistent random walk, which is characterized by random force generation and resistance to directional change. We first discuss a model that describes the stochastic movement of ECs and characterizes EC persistence in wound healing. To that end, we pharmacologically disrupted cytoskeletal dynamics, cytochalasin D for actin and nocodazole for tubulin, to understand its contributions to cell morphology, stiffness, and motility. As such, the use of Atomic Force Microscopy (AFM) enabled us to probe the topography and stiffness of ECs, while time lapse microscopy provided observations in wound healing models. Our results suggest that actin and tubulin dynamics contribute to EC shape, compressive moduli, and directional organization in collective migration. Insights from the model and time lapse experiment suggest that EC speed and persistence are directionally organized in wound healing. Pharmacological disruptions suggest that actin and tubulin dynamics play a role in collective migration. Current insights from both the model and experiment represent an important step in understanding the biomechanics of EC migration as a therapeutic target.
- 5 January 2022
- Published by MDPI AG in International Journal of Molecular Sciences
- Vol. 23 (1) , 568
Open AccessTracking of Endothelial Cell Migration and Stiffness Measurements Reveal the Role of Cytoskeletal Dynamics
Cell migration is a complex, tightly regulated multistep process in which cytoskeletal reorganization and focal adhesion redistribution play a central role. Core to both individual and collective migration is the persistent random walk, which is characterized by random force generation and resistance to directional change. We first discuss a model that describes the stochastic movement of ECs and characterizes EC persistence in wound healing. To that end, we pharmacologically disrupted cytoskeletal dynamics, cytochalasin D for actin and nocodazole for tubulin, to understand its contributions to cell morphology, stiffness, and motility. As such, the use of Atomic Force Microscopy (AFM) enabled us to probe the topography and stiffness of ECs, while time lapse microscopy provided observations in wound healing models. Our results suggest that actin and tubulin dynamics contribute to EC shape, compressive moduli, and directional organization in collective migration. Insights from the model and time lapse experiment suggest that EC speed and persistence are directionally organized in wound healing. Pharmacological disruptions suggest that actin and tubulin dynamics play a role in collective migration. Current insights from both the model and experiment represent an important step in understanding the biomechanics of EC migration as a therapeutic target.
- 1 September 2021
- Published by Elsevier in Journal of Fluency Disorders
- Vol. 69, 105851
Reliability of judgments of stuttering-related variables: The effect of language familiarity
- 1 September 2021
- Published by Elsevier in Journal of Fluency Disorders
- Vol. 69, 105851
Reliability of judgments of stuttering-related variables: The effect of language familiarity
- 1 June 2020
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 63 (2) , 335-347
Orders on Trees and Free Products of Left-ordered Groups
We construct total orders on the vertex set of an oriented tree. The orders are based only on up-down counts at the interior vertices and the edges along the unique geodesic from a given vertex to another. As an application, we provide a short proof (modulo Bass-Serre theory) of Vinogradov's result that the free product of left-orderable groups is left-orderable.
- 1 June 2020
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 63 (2) , 335-347
Orders on Trees and Free Products of Left-ordered Groups
We construct total orders on the vertex set of an oriented tree. The orders are based only on up-down counts at the interior vertices and the edges along the unique geodesic from a given vertex to another. As an application, we provide a short proof (modulo Bass-Serre theory) of Vinogradov's result that the free product of left-orderable groups is left-orderable.
- Open Access
Biased infinity Laplacian Boundary Problem on finite graphs
We provide an algorithm, running in polynomial time in the number of vertices, computing the unique solution to the biased infinity Laplacian Boundary Problem on finite graphs. The algorithm is based on the general outline and approach taken in the corresponding algorithm for the unbiased case provided by Lazarus et al. The new ingredient is an adjusted (biased) notion of a slope of a function on a path in a graph. The algorithm can be used to determine efficiently numerical approximations to the viscosity solutions of biased infinity Laplacian PDEs.
Open AccessBiased infinity Laplacian Boundary Problem on finite graphs
We provide an algorithm, running in polynomial time in the number of vertices, computing the unique solution to the biased infinity Laplacian Boundary Problem on finite graphs. The algorithm is based on the general outline and approach taken in the corresponding algorithm for the unbiased case provided by Lazarus et al. The new ingredient is an adjusted (biased) notion of a slope of a function on a path in a graph. The algorithm can be used to determine efficiently numerical approximations to the viscosity solutions of biased infinity Laplacian PDEs.
- Open Access
A Language Hierarchy and Kitchens-Type Theorem for Self-Similar Groups
We generalize the notion of self-similar groups of infinite tree automorphisms to allow for groups which are defined on a tree but do not act faithfully on it. The elements of such a group correspond to labeled trees which may be recognized by a tree automaton (e.g. Rabin, B\"{u}chi, etc.), or considered as elements of a tree shift (e.g. of finite type, sofic) as in symbolic dynamics. We give examples to show that the various classes of self-similar groups defined in this way do not coincide. As the main result, extending the classical result of Kitchens on one-dimensional group shifts, we provide a sufficient condition for a self-similar group whose elements form a sofic tree shift to be a tree shift of finite type. As an application, we show that the closure of certain self-similar groups of tree automorphisms are not Rabin-recognizable. \end{abstract}
Open AccessA Language Hierarchy and Kitchens-Type Theorem for Self-Similar Groups
We generalize the notion of self-similar groups of infinite tree automorphisms to allow for groups which are defined on a tree but do not act faithfully on it. The elements of such a group correspond to labeled trees which may be recognized by a tree automaton (e.g. Rabin, B\"{u}chi, etc.), or considered as elements of a tree shift (e.g. of finite type, sofic) as in symbolic dynamics. We give examples to show that the various classes of self-similar groups defined in this way do not coincide. As the main result, extending the classical result of Kitchens on one-dimensional group shifts, we provide a sufficient condition for a self-similar group whose elements form a sofic tree shift to be a tree shift of finite type. As an application, we show that the closure of certain self-similar groups of tree automorphisms are not Rabin-recognizable. \end{abstract}
- Open Access
Orders on trees and free products of left-ordered groups
We construct total orders on the vertex set of an oriented tree. The orders are based only on up-down counts at the interior vertices and the edges along the unique geodesic from a given vertex to another. As an application, we provide a short proof (modulo Bass-Serre theory) of Vinogradov's result that the free product of left-orderable groups is left-orderable.
Open AccessOrders on trees and free products of left-ordered groups
We construct total orders on the vertex set of an oriented tree. The orders are based only on up-down counts at the interior vertices and the edges along the unique geodesic from a given vertex to another. As an application, we provide a short proof (modulo Bass-Serre theory) of Vinogradov's result that the free product of left-orderable groups is left-orderable.
- 14 July 2018
- Published by Springer Nature
- p. 19-27
Quadratic Time Algorithm for Inversion of Binary Permutation Polynomials
- 14 July 2018
- Published by Springer Nature
- p. 19-27
Quadratic Time Algorithm for Inversion of Binary Permutation Polynomials
- Open Access
No positive cone in a free product is regular
We show that there exists no left order on the free product of two nontrivial, finitely generated, left-orderable groups such that the corresponding positive cone is represented by a regular language. Since there are orders on free groups of rank at least two with positive cone languages that are context-free (in fact, 1-counter languages), our result provides a bound on the language complexity of positive cones in free products that is the best possible within the Chomsky hierarchy. It also provides a strengthening of a result by Cristobal Rivas stating that the positive cone in a free product of nontrivial, finitely generated, left-orderable groups cannot be finitely generated as a semigroup.
Open AccessNo positive cone in a free product is regular
We show that there exists no left order on the free product of two nontrivial, finitely generated, left-orderable groups such that the corresponding positive cone is represented by a regular language. Since there are orders on free groups of rank at least two with positive cone languages that are context-free (in fact, 1-counter languages), our result provides a bound on the language complexity of positive cones in free products that is the best possible within the Chomsky hierarchy. It also provides a strengthening of a result by Cristobal Rivas stating that the positive cone in a free product of nontrivial, finitely generated, left-orderable groups cannot be finitely generated as a semigroup.