Related papers: Juggling braids and links
Polygonal slap maps are piecewise affine expanding maps of the interval obtained by projecting the sides of a polygon along their normals onto the perimeter of the polygon. These maps arise in the study of polygonal billiards with…
In most systems, its division into interacting constituent elements gives rise to a natural network structure. Analyzing the dynamics of these elements and the topology of these natural graphs gave rise to the fields of (nonlinear) dynamics…
The Local-to-Global-Principle used in the proof of convexity theorems for momentum maps has been extracted as a statement of pure topology enriched with a structure of convexity. We extend this principle to not necessarily closed maps…
Knots naturally appear in continuous dynamical systems as flow periodic trajectories. However, discrete dynamical systems are also closely connected with the theory of knots and links. For example, for Pixton diffeomorphisms, the…
We review the main tools which allow for the statistical characterization of weighted networks. We then present two case studies, the airline connection network and the scientific collaboration network, which are representative of critical…
A topology on a nonempty set $X$ specifies a natural subset of $\mathcal{P}(X)$. By identifying $\mathcal{P}(\mathcal{P}(X))$ with the totally disconnected compact Hausdorff space $2^{\mathcal{P}(X)}$, the lattice $Top(X)$ of all topologies…
We present a network model in which words over a specific alphabet, called {\it structures}, are associated to each node and undirected edges are added depending on some distance between different structures. It is shown that this model can…
Directed acyclic graphs are a fundamental class of networks that includes citation networks, food webs, and family trees, among others. Here we define a random graph model for directed acyclic graphs and give solutions for a number of the…
The transport on top of a periodic two-dimensional hexagonal magnetic pattern of (i) a single macroscopic steel sphere, (ii) a doublet of wax/magnetite composite spheres, and (iii) an immiscible mixture of ferrofluid droplets with a…
Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads…
We propose a procedure to generate dynamical networks with bursty, possibly repetitive and correlated temporal behaviors. Regarding any weighted directed graph as being composed of the accumulation of paths between its nodes, our…
We construct a sequence of geodesics on the modular surface such that the complement of the canonical lifts to the unit tangent bundle are arithmetic 3-manifolds.
We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its…
We consider the dynamics of a reaction-diffusion system on a multigraph. The species share the same set of nodes but can access different links to explore the embedding spatial support. By acting on the topology of the networks we can…
A zigzag in a map (a $2$-cell embedding of a connected graph in a connected closed $2$-dimensional surface) is a cyclic sequence of edges satisfying the following conditions: 1) any two consecutive edges lie on the same face and have a…
By a fixed continuous map from a $3$-space to itself, a knot in the $3$-space may be mapped to another knot in the $3$-space. We analyze possible knot types of them. Then we map a knot repeatedly by a fixed continuous map and analyze…
The effective dynamics of a slow classical system coupled to a fast chaotic environment is described by means of a Master equation. We show how this approach permits a very simple derivation of geometric magnetism.
A ubiquitous motif in nature is the self-similar hierarchical buckling of a thin lamina near its margins. This is seen in leaves, flowers, fungi, corals, and marine invertebrates. We investigate this morphology from the perspective of…
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…
Suppose $X$ is a locally solid lattice ring. It is known that there are three classes of bounded group homomorphisms on $X$ whose topological structures make them again topological rings. In this note, we consider lattice structure on them;…