ALAlexander Lohse

Alexander Lohse

*This is an algorithmically generated author record based on publicly available information.

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


Alexander Lohse has a total of 12 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Active Learning With a STEM Exercise Pool for Schools and Universities

    by Michael Heimann, Alexander Lohse, Ruedi Seiler

    The STEM Exercise Pool is a digital, interactive teaching and learning resource for mathematics education in the first year of STEM and teacher training degree programs, as well as for upper secondary school. Developed by a team of experts from several universities, it comprises nearly one thousand quality‐reviewed tasks featuring automatic grading, differentiated feedback, and dynamic visualizations. The pool supports a wide range of instructional scenarios, is available in multiple languages, and can be seamlessly integrated into common learning management systems. Technological innovations such as randomized task parameters, LaTeX and Python support, and a web‐based authoring tool for collaborative content creation make it a forward‐looking instrument for modern, efficient, and motivating STEM education. An integrated AI tutor for the exercise pool, similar to the one already in use in the bridge course OMB+, is currently under development.

  • Open Access

    Complete Heteroclinic Networks Derived from Graphs Consisting of Two Cycles

    by Sofia B. S. D. Castro, Alexander Lohse

    We address the question how a given connection structure (directed graph) can be realised as a heteroclinic network that is complete in the sense that it contains all unstable manifolds of its equilibria. For a directed graph consisting of two cycles, we provide a constructive method to achieve this: (i) enlarge the graph by adding some edges and (ii) apply the simplex method to obtain a network in phase space. Depending on the length of the cycles, we derive the minimal number of required new edges. In the resulting network, each added edge leads to a positive transverse eigenvalue at the respective equilibrium. We discuss the total number of such positive eigenvalues in an individual cycle and some implications for the stability of this cycle.

  • Open Access

    Publisher’s Note: “Arbitrarily large heteroclinic networks in fixed low-dimensional state space” [Chaos 33, 083156 (2023)]

    by Sofia B. S. D. Castro, Alexander Lohse

    This article was originally published online on 30 August 2023 with typesetting errors. These errors have been corrected. AIP Publishing apologizes for the erro


  • Open Access

    Arbitrarily large heteroclinic networks in fixed low-dimensional state space

    by Sofia B. S. D. Castro, Alexander Lohse

    We consider heteroclinic networks between $n \in \mathbb{N}$ nodes where the only connections are those linking each node to its two subsequent neighbouring ones. Using a construction method where all nodes are placed in a single one-dimensional space and the connections lie in coordinate planes, we show that it is possible to robustly realise these networks in $\mathbb{R}^6$ for any number of nodes $n$ using a polynomial vector field. This bound on the space dimension (while the number of nodes in the network goes to $\infty$) is a novel phenomenon and a step towards more efficient realisation methods for given connection structures in terms of the required number of space dimensions. We briefly discuss some stability properties of the generated heteroclinic objects.

  • Open Access

    Arbitrarily large heteroclinic networks in fixed low-dimensional state space

    by Sofia B. S. D. Castro, Alexander Lohse

    We consider heteroclinic networks between n∈N nodes where the only connections are those linking each node to its two subsequent neighboring ones. Using a construction method where all nodes are placed in a single one-dimensional space and the connections lie in coordinate planes, we show that it is possible to robustly realize these networks in R6 for any number of nodes n using a polynomial vector field. This bound on the space dimension (while the number of nodes in the network goes to ∞) is a novel phenomenon and a step toward more efficient realization methods for given connection structures in terms of the required number of space dimensions. We briefly discuss some stability properties of the generated heteroclinic objects.


  • Stability indices of non-hyperbolic equilibria in two-dimensional systems of ODEs

    by Alexander Lohse

    We consider families of systems of two-dimensional ordinary differential equations with the origin 0 as a non-hyperbolic equilibrium. For any number s∈(−∞,+∞) we show that it is possible to choose a parameter in these equations such that the stability index σ(0) is precisely σ(0)=s. In contrast to that, for a hyperbolic equilibrium x it is known that either σ(x)=−∞ or σ(x)=+∞. Furthermore, we discuss a system with an equilibrium that is locally unstable but globally attracting, highlighting some subtle differences between the local and non-local stability indices.


  • Open Access

    Stability Indices of Non-Hyperbolic Equilibria in Two-Dimensional Systems of ODEs

    by Alexander Lohse

    We consider families of systems of two-dimensional ordinary differential equations with the origin $0$ as a non-hyperbolic equilibrium. For any number $s \in (-\infty, +\infty)$ we show that it is possible to choose a parameter in these equations such that the stability index $\sigma(0)$ is precisely $\sigma(0)=s$. In contrast to that, for a hyperbolic equilibrium $x$ it is known that either $\sigma(x)=-\infty$ or $\sigma(x)=+\infty$. Furthermore, we discuss a system with an equilibrium that is locally unstable but globally attracting, highlighting some subtle differences between the local and non-local stability indices.

  • Open Access

    A hybrid heteroclinic cycle

    by Sofia B.S.D. Castro, Alexander Lohse


  • Open Access

    A hybrid heteroclinic cycle

    by Sofia Castro, Alexander Lohse

    Using a vector field in $\mathbb{R}^4$, we provide an example of a robust heteroclinic cycle between two equilibria that displays a mix of features exhibited by well-known types of low-dimensional heteroclinic structures, including simple, quasi-simple and pseudo-simple cycles. Our cycle consists of two equilibria on one coordinate axis and two connections. One of the connections is one-dimensional while the other is two-dimensional. We compare our heteroclinic cycle to others in the literature that are similar in architecture, and illustrate how the standard methods used to analyse those cycles fail to provide sufficient information on the attraction properties of our example. The instability of two subcycles contained in invariant three-dimensional subspaces seems to indicate that our cycle is generically completely unstable. Although this cycle is one of the simplest possible and exists in low-dimension, the complete study of the stability of our cycle by using the standard techniques for return map reduction is not possible given the hybrid nature of the return map.

  • Simple heteroclinic networks in R 4

    by Olga Podvigina, Alexander Lohse

    We classify simple heteroclinic networks for a -equivariant system in with finite , proceeding as follows: we define a graph associated with a given and identify all so-called simple graphs associated with subgroups of . Then, knowing the graph associated with a given , we determine the types of heteroclinic networks that the group admits. Our study is restricted to networks that are maximal in the sense that they have the highest possible number of connections—any non-maximal network can then be derived by deleting one or more connections. Finally, for networks of type A, i.e. admitted by , we give necessary and sufficient conditions for fragmentary and essential asymptotic stability. The conditions involve the notion of principal subcycles which are comprised of connections in the direction of strongest expansion. (For other simple heteroclinic networks the conditions for stability are known.) The results are illustrated by a numerical example of a simple heteroclinic network that involves two subcycles that can be essentially asymptotically stable simultaneously.