Related papers: A Contribution in the Rotor-router model
Building on earlier work of Diaconis and Fulton (1991) and Lawler, Bramson, and Griffeath (1992), Propp in 2001 defined a deterministic analogue of internal diffusion-limited aggregation. This growth model is a "convergent game" of the sort…
The metohod of ortogonal rotations introduced in the previous papers of the author is used for construction of the explicit form the generators of the simple roots for quantum (and ussual) semisimple algebras. All calculations are presented…
The combinatorial theory of rotor-routers has connections with problems of statistical mechanics, graph theory, chaos theory, and computer science. A rotor-router network defines a deterministic walk on a digraph G in which a particle walks…
We give a rigorous and self-contained survey of the abelian sandpile model and rotor-router model on finite directed graphs, highlighting the connections between them. We present several intriguing open problems.
We prove a shape theorem for rotor-router aggregation on the comb, for a specific initial rotor configuration and clockwise rotor sequence for all vertices. Furthermore, as an application of rotor-router walks, we describe the harmonic…
The rotor-router model is a deterministic analogue of random walk. It can be used to define a deterministic growth model analogous to internal DLA. We show that the set of occupied sites for this model on an infinite regular tree is a…
This paper develops the theory of abelian Routh reduction for discrete mechanical systems and applies it to the variational integration of mechanical systems with abelian symmetry. The reduction of variational Runge-Kutta discretizations is…
This paper revisits the little-known Gibbs-Rodrigues representation of rotations in a three-dimensional space and demonstrates a set of algorithms for handling it. In this representation the rotation is itself represented as a…
A rotor-router walk on a graph is a deterministic process, in which each vertex is endowed with a rotor that points to one of the neighbors. A particle located at some vertex first rotates the rotor in a prescribed order, and then it is…
Elliptical rotation is the motion of a point on an ellipse through some angle about a vector. The purpose of this paper is to examine the generation of elliptical rotations and to interpret the motion of a point on an elipsoid using…
We develop a unified framework for rotor-routing that extends the classical model to a broad class of multigraphs equipped with Generalized Rotor Mechanisms (GRM). This perspective places rotor-routing on the same footing as abelian…
Toral automorphisms are widely used (discrete) dynamical systems, the perhaps most prominent example (in 2D) being Arnold's cat map. Given such an automorphism M, its symmetries (i.e. all automorphisms that commute with M) and reversing…
A generalisation of the notion of a Rota-Baxter operator is proposed. This generalisation consists of two operators acting on an associative algebra and satisfying equations similar to the Rota-Baxter equation. Rota-Baxter operators of any…
We present an improved form of the algorithm for constructing Jacobi rotations. This is simultaneously a more accurate code for finding the eigenvalues and eigenvectors of a real symmetric 2x2 matrix.
We offer some elementary characterisations of group and round quadratic forms. These characterisations are applied to establish new (and recover existing) characterisations of Pfister forms. We establish "going-up" results for group and…
The rotor-router model is a popular deterministic analogue of random walk. In this paper we prove that all orbits of the rotor-router operation have the same size on a strongly connected directed graph (digraph) and give a formula for the…
Tilt-rotor aerial robots are more dynamic and versatile than fixed-rotor platforms, since the thrust vector and body orientation are decoupled. However, the coordination of servos and propellers (the allocation problem) is not trivial,…
This note shows how to compute, to high relative accuracy under mild assumptions, complex Jacobi rotations for diagonalization of Hermitian matrices of order two, using the correctly rounded functions $\mathtt{cr\_hypot}$ and…
The Birch and Swinnerton-Dyer conjecture predicts that the parity of the algebraic rank of an abelian variety over a global field should be controlled by the expected sign of the functional equation of its $L$-function, known as the global…
Rounding linear programs using techniques from discrepancy is a recent approach that has been very successful in certain settings. However this method also has some limitations when compared to approaches such as randomized and iterative…