Related papers: Rotor-Routing Induces the Only Consistent Sandpile…
The $k$-truss, introduced by Cohen (2005), is a graph where every edge is incident to at least $k$ triangles. This is a relaxation of the clique. It has proved to be a useful tool in identifying cohesive subnetworks in a variety of…
{\it Fold maps} are fundamental tools in generalizing the theory of Morse functions and its application to studies of geometric properties of manifolds. One of the fundamental and important problems in the theory of fold maps is to…
Patterns often appear in a variety of large, real-world networks, and interesting physical phenomena are often explained by network topology as in the case of the bow-tie structure of the World Wide Web, or the small world phenomenon in…
Structural balance theory predicts that triads in networks gravitate towards stable configurations. The theory has been verified for undirected graphs. Since real-world networks are often directed, we introduce a novel method for…
This paper presents an algorithm for an automatic transformation (=routing) of time ordered topologies of Goldstone diagrams (i.e. Wick contractions) into graphical representations of these topologies. Since there is no hard criterion for…
Let $G$ be a ribbon graph. Matthew Baker and Yao Wang proved that the rotor-routing torsor and the Bernardi torsor for $G$, which are two torsor structures on the set of spanning trees for the Picard group of $G$, coincide when $G$ is…
Robbin and Salamon showed that attractor-repellor networks and Lyapunov maps are equivalent concepts and illustrate this with the example of linear flows on projective spaces. In these examples the fixed points are linearly ordered with…
The rotor-router model is a deterministic process analogous to a simple random walk on a graph. This paper is concerned with a generalized model, functional-router model, which imitates a Markov chain possibly containing irrational…
We consider Milnor's "tower algorithm" in the space of piecewise monotone maps, an iterative algorithm on the space of metrics which unifies, on the one hand, Thurston's iterative scheme which converges to holomorphic models, and, on the…
Scattering transforms are non-trainable deep convolutional architectures that exploit the multi-scale resolution of a wavelet filter bank to obtain an appropriate representation of data. More importantly, they are proven invariant to…
The stable Andrews-Curtis conjecture in combinatorial group theory is the statement that every balanced presentation of the trivial group can be simplified to the trivial form by elementary moves corresponding to "handle-slides" together…
Notions of guardedness serve to delineate the admissibility of cycles, e.g. in recursion, corecursion, iteration, or tracing. We introduce an abstract notion of guardedness structure on a symmetric monoidal category, along with a…
We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part (arXiv:2501.15657), we discused…
In this work we prove a shape theorem for a growing set of Simple Random Walks (SRWs), known as frog model. The dynamics of this process is described as follows: There are some active particles, which perform independent SRWs, and sleeping…
Structural balance theory assumes triads in networks to gravitate towards stable configurations. The theory has been verified for undirected graphs. Since real-world networks are often directed, we introduce a novel method for considering…
We propose a simple, geometrically-motivated construction of smooth random paths in the plane. The construction is such that, with probability one, the paths have finite curvature everywhere (and the realizations are visually pleasing when…
In warehouse and manufacturing environments, manipulation platforms are frequently deployed at conveyor belts to perform pick and place tasks. Because objects on the conveyor belts are moving, robots have limited time to pick them up. This…
Motion planners for mobile robots in unknown environments face the challenge of simultaneously maintaining both robustness against unmodeled uncertainties and persistent feasibility of the trajectory-finding problem. That is, while dealing…
We give a new and simple proof for the computation of the oriented and the unoriented fold cobordism groups of Morse functions on surfaces. We also compute similar cobordism groups of Morse functions based on simple stable maps of…
Tractors and Twistors bundles both provide natural conformally covariant calculi on $4D$-Riemannian manifolds. They have different origins but are closely related, and usually constructed bottom-up from prolongation of defining differential…