Ethan Akin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ethan Akin has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Eli Glasner
Tel Aviv University
8 shared publications - Anima Nagar
Department of Mathematics, Indian Institute of Technology Delhi, New Delhi, India
4 shared publications - Joseph Auslander
Department of Mathematics University of Maryland 20742 College Park MD U.S.A
4 shared publications - Benjamin Weiss
Hebrew University of Jerusalem, Israel
3 shared publications - Jim Wiseman
Department of Mathematics, Agnes Scott College, Decatur, USA
3 shared publications - Song Shao
School of Mathematical Sciences, University of Science and Technology of China, Hefei, Anhui, 230026, People’s Republic of China
2 shared publications
Latest Publications
- 1 December 2025
- Published by American Mathematical Society (AMS) in Notices of the American Mathematical Society
- Vol. 72 (11)
Remembering Joe Auslander (1930–2025)
- 1 December 2025
- Published by American Mathematical Society (AMS) in Notices of the American Mathematical Society
- Vol. 72 (11)
Remembering Joe Auslander (1930–2025)
- 2 October 2024
- Published by Elsevier in Topology and its Applications
- Vol. 357
A Complete Invariant for Shift Equivalence for Boolean Matrices and Finite Relations
- 2 October 2024
- Published by Elsevier in Topology and its Applications
- Vol. 357
A Complete Invariant for Shift Equivalence for Boolean Matrices and Finite Relations
- Open Access
The Simple Yield Curve Models
With $P_t$ the price in current dollars of a dollar delivered $t$ time units from now, we assume that $P$ is a decreasing function defined for $t \in \mathbb{R}_+$ with $P_0 = 1$. The negative logarithmic derivative, $- \stackrel{\bullet}{P}_t/P_t$ defines the yield curve function $Y_t$. An $n$ parameter linear yield curve model selects as allowable yield curves $Y_t(r) = \sum_{i=1}^n r_i Y^i_t$ with the functions $Y^i$ fixed and with $r$ varying over an open subset of $\mathbb{R}^n$ on which $Y_t(r) \ge 0$ for all $t \in \mathbb{R}_+$. For example, the flat yield curve model with $P_t(r) = e^{-rt}$ is a one parameter linear model with $Y^1_t(r) = r > 0$. We impose two natural economic requirements on the model: (SPA) static prices allowed, i.e. it is always possible that as time moves forward, relative prices do not change, and (NLA) no local arbitrage, i.e. there does not exist a self-financing bundle of futures such that the zero present value is a local minimum with respect to small changes in the space of admissible yield curves. In that case the model always contains one of four simple models. If we impose the additional requirement (LRE) long rates exist, i.e. for every $r$ $Lim_{t \to \infty} Y_t(r)$ exists as a finite limit, then the number of simple models is reduced to two.Open AccessThe Simple Yield Curve Models
With $P_t$ the price in current dollars of a dollar delivered $t$ time units from now, we assume that $P$ is a decreasing function defined for $t \in \mathbb{R}_+$ with $P_0 = 1$. The negative logarithmic derivative, $- \stackrel{\bullet}{P}_t/P_t$ defines the yield curve function $Y_t$. An $n$ parameter linear yield curve model selects as allowable yield curves $Y_t(r) = \sum_{i=1}^n r_i Y^i_t$ with the functions $Y^i$ fixed and with $r$ varying over an open subset of $\mathbb{R}^n$ on which $Y_t(r) \ge 0$ for all $t \in \mathbb{R}_+$. For example, the flat yield curve model with $P_t(r) = e^{-rt}$ is a one parameter linear model with $Y^1_t(r) = r > 0$. We impose two natural economic requirements on the model: (SPA) static prices allowed, i.e. it is always possible that as time moves forward, relative prices do not change, and (NLA) no local arbitrage, i.e. there does not exist a self-financing bundle of futures such that the zero present value is a local minimum with respect to small changes in the space of admissible yield curves. In that case the model always contains one of four simple models. If we impose the additional requirement (LRE) long rates exist, i.e. for every $r$ $Lim_{t \to \infty} Y_t(r)$ exists as a finite limit, then the number of simple models is reduced to two. - Open Access
Dynamical Systems: Discrete, Continuous and Hybrid
The dynamics by iteration of a function on a compact metric space, sometimes called a cascade, can be extended to the dynamics of a closed relation on such a space. Here we apply this relation dynamics to study semiflows (and their relation extension) as well as hybrid dynamical systems which combine both continuous time and discrete time dynamics. In a unified way we describe the attractor-repeller structure, Conley's chain recurrence relation and the construction of Lyapunov functions for all of these systems.
Open AccessDynamical Systems: Discrete, Continuous and Hybrid
The dynamics by iteration of a function on a compact metric space, sometimes called a cascade, can be extended to the dynamics of a closed relation on such a space. Here we apply this relation dynamics to study semiflows (and their relation extension) as well as hybrid dynamical systems which combine both continuous time and discrete time dynamics. In a unified way we describe the attractor-repeller structure, Conley's chain recurrence relation and the construction of Lyapunov functions for all of these systems.
- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Dynamics and Games
- Vol. 8 (3) , 187-202
Generalized intransitive dice II: Partition constructions
A generalized$ N $ -sided die is a random variable$ D $ on a sample space of$ N $ equally likely outcomes taking values in the set of positive integers. We say of independent$ N $ -sided dice$ D_i, D_j $ that$ D_i $ beats$ D_j $ , written$ D_i \to D_j $ , if$ Prob(D_i > D_j) > \frac{1}{2} $ . A collection of dice$ \{ D_i : i = 1, \dots, n \} $ models a tournament on the set$ [n] = \{ 1, 2, \dots, n \} $ , i.e. a complete digraph with$ n $ vertices, when$ D_i \to D_j $ if and only if$ i \to j $ in the tournament. By using regular$ n $ -fold partitions of the set$ [Nn] $ to label the$ N $ -sided dice we can model an arbitrary tournament on$ [n] $ and$ N $ can be chosen to be less than or equal to$ N = 3^{n-2} $ .- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Dynamics and Games
- Vol. 8 (3) , 187-202
Generalized intransitive dice II: Partition constructions
A generalized$ N $ -sided die is a random variable$ D $ on a sample space of$ N $ equally likely outcomes taking values in the set of positive integers. We say of independent$ N $ -sided dice$ D_i, D_j $ that$ D_i $ beats$ D_j $ , written$ D_i \to D_j $ , if$ Prob(D_i > D_j) > \frac{1}{2} $ . A collection of dice$ \{ D_i : i = 1, \dots, n \} $ models a tournament on the set$ [n] = \{ 1, 2, \dots, n \} $ , i.e. a complete digraph with$ n $ vertices, when$ D_i \to D_j $ if and only if$ i \to j $ in the tournament. By using regular$ n $ -fold partitions of the set$ [Nn] $ to label the$ N $ -sided dice we can model an arbitrary tournament on$ [n] $ and$ N $ can be chosen to be less than or equal to$ N = 3^{n-2} $ .- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Dynamics and Games
- Vol. 8 (1) , 1-20
Generalized intransitive dice: Mimicking an arbitrary tournament
A generalized $ N $-sided die is a random variable $ D $ on a sample space of $ N $ equally likely outcomes taking values in the set of positive integers. We say of independent $ N $ sided dice $ D_i, D_j $ that $ D_i $ beats $ D_j $, written $ D_i \to D_j $, if $ Prob(D_i > D_j) > \frac{1}{2} $. Examples are known of intransitive $ 6 $-sided dice, i.e. $ D_1 \to D_2 \to D_3 $ but $ D_3 \to D_1 $. A tournament of size $ n $ is a choice of direction $ i \to j $ for each edge of the complete graph on $ n $ vertices. We show that if $ R $ is tournament on the set $ [n] = \{ 1, \dots, n \} $, then for sufficiently large $ N $ there exist sets of independent $ N $-sided dice $ \{ D_1, \dots, D_n \} $ such that $ D_i \to D_j $ if and only if $ i \to j $ in $ R $.- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Dynamics and Games
- Vol. 8 (1) , 1-20
Generalized intransitive dice: Mimicking an arbitrary tournament
A generalized $ N $-sided die is a random variable $ D $ on a sample space of $ N $ equally likely outcomes taking values in the set of positive integers. We say of independent $ N $ sided dice $ D_i, D_j $ that $ D_i $ beats $ D_j $, written $ D_i \to D_j $, if $ Prob(D_i > D_j) > \frac{1}{2} $. Examples are known of intransitive $ 6 $-sided dice, i.e. $ D_1 \to D_2 \to D_3 $ but $ D_3 \to D_1 $. A tournament of size $ n $ is a choice of direction $ i \to j $ for each edge of the complete graph on $ n $ vertices. We show that if $ R $ is tournament on the set $ [n] = \{ 1, \dots, n \} $, then for sufficiently large $ N $ there exist sets of independent $ N $-sided dice $ \{ D_1, \dots, D_n \} $ such that $ D_i \to D_j $ if and only if $ i \to j $ in $ R $.- Open Access
Asymptotic Pairs for Interval Exchange Transformations
We provide a simple description of asymptotic pairs in the subshift associated with an interval exchange transformation and show that, under reasonably general conditions, doubly asymptotic pairs do not occur.
Open AccessAsymptotic Pairs for Interval Exchange Transformations
We provide a simple description of asymptotic pairs in the subshift associated with an interval exchange transformation and show that, under reasonably general conditions, doubly asymptotic pairs do not occur.
- Open Access
Rock, Paper, Scissors, Etc -- Topics in the Theory of Regular Tournaments
The classic Rock-Paper-Scissors game of size 3 and its extension, Rock-Paper-Scissors-Lizard-Spock, are modeled by directed graphs called tournaments. They can be further extended to any odd size. The extended games are regular tournaments where each strategy beats and is beaten by exactly half of the alternatives. We survey the properties of regular tournaments, which we will call games. In the process we describe a number of constructions for such games. These include games on groups of odd order and the associated games on coset spaces. We obtain a new lower bound for the number of games of size 2n+1.
Open AccessRock, Paper, Scissors, Etc -- Topics in the Theory of Regular Tournaments
The classic Rock-Paper-Scissors game of size 3 and its extension, Rock-Paper-Scissors-Lizard-Spock, are modeled by directed graphs called tournaments. They can be further extended to any odd size. The extended games are regular tournaments where each strategy beats and is beaten by exactly half of the alternatives. We survey the properties of regular tournaments, which we will call games. In the process we describe a number of constructions for such games. These include games on groups of odd order and the associated games on coset spaces. We obtain a new lower bound for the number of games of size 2n+1.
- 18 October 2019
- Published by Elsevier in Topology and its Applications
- Vol. 268, 106920
Approximation dynamics
- 18 October 2019
- Published by Elsevier in Topology and its Applications
- Vol. 268, 106920
Approximation dynamics
- Open Access
Approximation Dynamics
We describe the approximation of a continuous dynamical system on a p. l. manifold or Cantor set by a tractable system. A system is tractable when it has a finite number of chain components and, with respect to a given full background measure, almost every point is generic for one of a finite number of ergodic invariant measures. The approximations use non-degenerate simplicial dynamical systems for p. l. manifolds and shift-like dynamical systems for Cantor Sets.
Open AccessApproximation Dynamics
We describe the approximation of a continuous dynamical system on a p. l. manifold or Cantor set by a tractable system. A system is tractable when it has a finite number of chain components and, with respect to a given full background measure, almost every point is generic for one of a finite number of ergodic invariant measures. The approximations use non-degenerate simplicial dynamical systems for p. l. manifolds and shift-like dynamical systems for Cantor Sets.