Related papers: Finite Dynamical Laminations
Finite discrete-time dynamical systems (FDDS) model phenomena that evolve deterministically in discrete time. It is possible to define sum and product operations on these systems (disjoint union and direct product, respectively) giving a…
The meander problem is a combinatorial problem which provides a toy model of the compact folding of polymer chains. In this paper we study various questions relating to the enumeration of meander diagrams, using diagrammatical methods. By…
In this note, we offer a palatable introduction to the field of arithmetic dynamics. That is, we study the patterns that arise when iterating a polynomial map. This note is accessible to those who have taken an introductory proof based…
Given a complex structure, we investigate diverging sequences of projective structures on the fixed complex structure in terms of Thurston's parametrization. In particular, we will give a geometric proof to the theorem by Kapovich stating…
We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…
The displayed tree phylogenetic network model is shown to sit as a natural submodel of the graphical model associated to a directed acyclic graph (DAG). This representation allows to derive a number of results about the displayed tree…
We develop layered monoidal theories -- a generalisation of monoidal theories combining formal descriptions of a system at different levels of abstraction. Via their representation as string diagrams, monoidal theories provide a graphical…
In this paper the complex dynamical analysis of the parametric fourth-order Kim's iterative family is made on quadratic polynomials, showing the Matlab codes generated to draw the fractal images necessary to complete the study. The…
Stable reduction methods will be important in the evaluation of high-order perturbative diagrams appearing in QCD and mixed QCD-electroweak radiative corrections at the LHC. Differential reduction techniques are useful for relating…
We develop the theory of mixed finite elements in terms of special inverse systems of complexes of differential forms, defined over cellular complexes. Inclusion of cells corresponds to pullback of forms. The theory covers for instance…
We generalize the notion of tight geodesics in the curve complex to tight trees. We then use tight trees to construct model geometries for certain surface bundles over graphs. This extends some aspects of the combinatorial model for doubly…
This book is mainly an exposition of the author's works and his joint works with his former students on explicit representations of finite-dimensional simple Lie algebras, related partial differential equations, linear orthogonal algebraic…
Since their introduction by Thurston, geodesic laminations on hyperbolic surfaces occur in many contexts. In this paper, we propose a generalization of geodesic laminations on locally CAT(0), complete, geodesic metric spaces, whose boundary…
Lattices of compatibly embedded finite fields are useful in computer algebra systems for managing many extensions of a finite field $\mathbb{F}_p$ at once. They can also be used to represent the algebraic closure $\bar{\mathbb{F}}_p$, and…
The description of invariants of surfaces with respect to the motion groups is reduced to the description of invariants of parameterized surfaces with respect to the motion groups. Existence of a commuting system of invariant partial…
In this paper, we study the class of parabolically geometrically finite (PGF) subgroups of mapping class groups, introduced by Dowdall-Durham-Leininger-Sisto. We prove a combination theorem for graphs of PGF groups (and other…
Implicit regularization is an important way to interpret neural networks. Recent theory starts to explain implicit regularization with the model of deep matrix factorization (DMF) and analyze the trajectory of discrete gradient dynamics in…
Topological deep learning (TDL) is a rapidly evolving field that uses topological features to understand and design deep learning models. This paper posits that TDL is the new frontier for relational learning. TDL may complement graph…
We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces significantly the exhaustive generation. New enumerative…
Let $\mathcal{L}$ be a finite-dimensional semisimple Lie algebra of rank $N$ over an algebraically closed field of characteristic $0$. Associated to $\mathcal{L}$ is a family of polynomial folding maps…