Related papers: Connecting Polygonizations via Stretches and Twang…
An n-gon is defined as a sequence \P=(V_0,...,V_{n-1}) of n points on the plane. An n-gon \P is said to be convex if the boundary of the convex hull of the set {V_0,...,V_{n-1}} of the vertices of \P coincides with the union of the edges…
We propose the use of ponderomotive forces to entangle the motions of different atoms. Two situations are analyzed: one where the atoms belong to the same optical cavity and interact with the same radiation field mode; the other where each…
Star polymers are within the most topologically entangled macromolecules. For a star to move the current theory is that one arm must retract to the branch point. The probability of this event falls exponentially with molecular weight, and a…
We prove that local operations that preserve all symmetries, as e.g. dual, truncation, ambo, or join,, as well as local operations that preserve all symmetries except orientation reversing ones, as e.g. gyro or snub, preserve the…
Inspired by the Stochastic processes described by the Feller Coupling and Chinese Restaurant Processes, we create four different bijections from words in the set $[1]\times [2] \times\cdot \times[n]$ to $S_n$. We then compose these maps…
We construct a point set in the Euclidean plane that elucidates the relationship between the fine-scale statistics of the fractional parts of $\sqrt n$ and directional statistics for a shifted lattice. We show that the randomly rotated, and…
We are given a read-only memory for input and a write-only stream for output. For a positive integer parameter s, an s-workspace algorithm is an algorithm using only $O(s)$ words of workspace in addition to the memory for input. In this…
Let G be a Lie group. On the trivial principal G-bundle over the Lie algebra of G there is a natural connection whose curvature is the Lie bracket. The exponential map is given by parallel transport of this connection. If G is the…
A \emph{simple} $s,t$ path $P$ in a rectangular grid graph $\mathbb{G}$ is a Hamiltonian path from the top-left corner $s$ to the bottom-right corner $t$ such that each \emph{internal} subpath of $P$ with both endpoints $a$ and $b$ on the…
We use Stokesian Dynamics simulations to study the microscopic motion of particles suspended in fluids passing through porous media. We construct model porous media with fixed spherical particles, and allow mobile ones to move through this…
We extend results of Pachner and Casali to give finite sets of moves relating triangulations of PL manifolds respecting filtrations by locally flat manifolds and stratifications in which a finite family of simple local models exists for…
We consider the problem of stochastic flow of multiple particles traveling on a closed loop, with a constraint that particles move without passing. We use a Markov chain description that reduces the problem to a generalized random walk on a…
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…
The motion of a compact body in space and time is commonly described by the world line of a point representing the instantaneous position of the body. In General Relativity such a world-line formalism is not quite straightforward because of…
We show that the "twisted" planar random walk - which results by summing up stationary increments rotated by multiples of a fixed angle - is recurrent under diverse assumptions on the increment process. For example, if the increment process…
Inspired by how the shape deformations in active organisms help them to migrate through disordered porous environments, we simulate active ring polymers in two-dimensional random porous media. Flexible and inextensible active ring polymers…
A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that the problem of generating planar tanglegrams uniformly at…
Certain continuous-time quantum walks can be viewed as scattering processes. These processes can perform quantum computations, but it is challenging to design graphs with desired scattering behavior. In this paper, we study and construct…
We show that simple random walks on (non-trivial) relatively hyperbolic groups stay $O(\log(n))$-close to geodesics, where $n$ is the number of steps of the walk. Using similar techniques we show that simple random walks in mapping class…
We give a short proof of the contractibility of the space of geodesic triangulations with fixed combinatorial type of a convex polygon in the Euclidean plane. Moreover, for any $n>0$, we show that there exists a space of geodesic…