相关论文: A genus 4 origami with minimal hitting time and an…

The time it takes a random walker in a lattice to reach the origin from another vertex $x$, has infinite mean. If the walker can restart the walk at $x$ at will, then the minimum expected hitting time $T(x,0)$ (minimized over restarting…

We obtain upper bounds (in most cases, sharp) for the hitting times of random walks on finite undirected graphs expressed as functions of the graph's number of edges. In particular, we show that the maximum hitting time for a simple random…

Generic quantum systems --as much as their classical counterparts-- pass arbitrarily close to their initial state after sufficiently long time. Here we provide an essentially exact computation of such recurrence times for generic…

We prove the convergence of the FLINT-HILLS series and establish new criteria for a similar type of diophantine or lacunary series, which faces issues due to spaced long terms coming from the trigonometric nature of functions, e.g.,…

The system of four point vortices in the plane has relative equilibria that behave as composite particles, in the case where three of the vortices have strength $-\Gamma/3$ and one of the vortices has strength $\Gamma$. These relative…

Let $G$ be a planar $3$-graph (i.e., a planar graph with vertex degree at most three) with $n$ vertices. We present the first $O(n^2)$-time algorithm that computes a planar orthogonal drawing of $G$ with the minimum number of bends in the…

A survey is presented of known results concerning simple random walk on the class of distance-regular graphs. One of the highlights is that electric resistance and hitting times between points can be explicitly calculated and given strong…

The topological dynamics of the horocyclic flow $h_{\mathbb{R}}$ on the unit tangent bundle of a geometrically finite hyperbolic surface is well known. In particular, on such a surface, the flow $h_{\mathbb{R}}$ is minimal, or the minimal…

We discuss the global regularity of 2 dimensional minimal sets that are near a union of two planes, and prove that every global minimal set in R^4 that looks like a union of two almost orthogonal planes at infinity is a cone. The main point…

Capillary jetting of a fluid dispersed into another immiscible phase is usually limited by a critical Capillary number, a function of the Reynolds number and the fluid properties ratios. Critical conditions are set when the minimum…

We consider some flow-time minimization problems in the unrelated machines setting. In this setting, there is a set of $m$ machines and a set of $n$ jobs, and each job $j$ has a machine dependent processing time of $p_{ij}$ on machine $i$.…

We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but irrational vertex coordinates, and outputs a set of as few rectangles as possible into which it can be dissected by axis-parallel cuts and…

We study the order ten polynomial equation satisfied by the radius of the spherical timelike orbits for a massive particle with a generic energy around a Kerr black hole. Even though the radii of the prograde and retrograde orbits at the…

This paper addresses the question of existence of (not necessarily self-similar) solutions to the 4-vortex problem that lead to total or partial collision. We begin by showing that energy considerations alone imply that, for the general…

Consider the random subgraph process on a base graph $G$ with $n$ vertices: we generate a sequence $\{G_t\}_{t=0}^{|E(G)|}$ by taking a uniformly random ordering of the edges of $G$ and then adding these edges one by one to the empty graph…

The concordance genus of a knot K is the minimum Seifert genus of all knots smoothly concordant to K. Concordance genus is bounded below by the 4-ball genus and above by the Seifert genus. We give a lower bound for the concordance genus of…

We solve a certain case of the minimal genus problem for embedded surfaces in elliptic 4-manifolds. The proofs involve a restricted transitivity property of the action of the orientation preserving diffeomorphism group on the second…

Let $G(N,p)=(V,E)$ be an Erd\"os-R\'enyi random graph and $(X_n)_{n \in \mathbb{N}}$ be a simple random walk on it. We study the the order of magnitude of $\sum_{i \in V} \pi_ih_{ij} $ where $\pi_i=d_i / 2|E|$ for $d_i$ the number of…

Kagome antiferromagnets are known to be highly frustrated and degenerate when they possess simple, isotropic interactions. We consider the entire class of these magnets when their interactions are spatially anisotropic. We do so by…

A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph with vertex-degree at most four) is a crossing-free drawing that maps each vertex of G to a distinct point of the plane and each edge of $G$ to a sequence of horizontal…