Related papers: Linear progress in the complex of curves

We study a large family of generalized class groups of imaginary quadratic orders $O$ and prove that they act freely and (essentially) transitively on the set of primitively $O$-oriented elliptic curves over a field $k$ (assuming this set…

Let $P$ be a simple polytope with $n-d = 2$, where $d$ is the dimension and $n$ is the number of facets. The graph of such a polytope is also called a grid. It is known that the directed random walk along the edges of $P$ terminates after…

In this paper we study continuous-time quantum walks on Cayley graphs of the symmetric group, and prove various facts concerning such walks that demonstrate significant differences from their classical analogues. In particular, we show that…

S. Bigelow proved that the braid groups are linear. That is, there is a faithful representation of the braid group into the general linear group of some field. Using this, we deduce from previously known results that the mapping class group…

We give completely combinatorial proofs of the main results of [3] using polygons. Namely, we prove that the mapping class group of a surface with boundary acts faithfully on a finitely-generated linear category. Along the way we prove some…

The continuous-time quantum walk is a particle evolving by Schr\"odinger's equation in discrete space. Encoding the space as a graph of vertices and edges, the Hamiltonian is proportional to the discrete Laplacian. In some physical systems,…

In this work we study smooth complex quasi-projective surfaces whose fundamental group is a free product of cyclic groups. In particular, we prove the existence of an admissible map from the quasi-projective surface to a smooth complex…

For mappings in metric spaces satisfying one inequality with respect to modulus of families of curves, there is proved a lightness of the uniform limit of these mappings. It is proved that, the uniform limit of these mappings is light…

The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…

In analogy with the classical group law on a plane cubic curve, we define a group law on a smooth plane tropical cubic curve. We show that the resulting group is isomorphic to $S^1$.

Rafi and Schleimer recently proved that the natural relation between curve complexes induced by a covering map between two surfaces is a quasi-isometric embedding. We offer another proof of this result using a distance estimate via…

We introduce a new type of discrete quantum walks, called vertex-face walks, based on orientable embeddings. We first establish a spectral correspondence between the transition matrix $U$ and the vertex-face incidence structure. Using the…

In the book [FIM], original methods were proposed to determine the invariant measure of random walks in the quarter plane with small jumps, the general solution being obtained via reduction to boundary value problems. Among other things, an…

By considering appropriate finite covering spaces of closed non-orientable surfaces, we construct linear representations of their mapping class group which have finite index image in certain big arithmetic groups.

We consider a class of multi-particle reinforced interacting random walks. In this model, there are some (finite or infinite) particles performing random walks on a given (finite or infinite) connected graph, so that each particle has…

Given a complex of groups, we construct a new class of complex of groups that records its local data and offer a functorial perspective on the statement that complexes of groups are locally developable. We also construct a new notion of an…

We address the question of symmetries of an important type of quantum walks. We introduce all the necessary definitions and provide a rigorous formulation of the problem. Using a thorough analysis, we reach the complete answer by presenting…

Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example…

We prove that metric graph with the minimal growth of the number of possible endpoints of a random walk is the union of several linear paths coming out of the same vertex

For a homogeneous random walk in the quarter plane with nearest-neighbor transitions, starting from some state $(i_0,j_0)$, we study the event that the walk reaches the vertical axis, before reaching the horizontal axis. We derive an exact…