English
Related papers

Related papers: A genus 4 origami with minimal hitting time and an…

200 papers

The standard (Euclidean) action principle for the gravitational field implies that for spacetimes with black hole topology, the opening angle at the horizon and the horizon area are canonical conjugates. It is shown that the opening angle…

General Relativity and Quantum Cosmology · Physics 2010-04-06 S. Carlip , C. Teitelboim

Let $\alpha$ be an irrational number and $I$ an interval of $\mathbb{R}$. If $\alpha$ is Diophantine, we show that any one-parameter group of homeomorphisms of $I$ whose time-$1$ and $\alpha$ maps are $C^\infty$ is in fact the flow of a…

Dynamical Systems · Mathematics 2022-09-20 Hélène Eynard-Bontemps

In this article we study the asymptotic behavior of incompressible, ideal, time-dependent two dimensional flow in the exterior of a single smooth obstacle when the size of the obstacle becomes very small. Our main purpose is to identify the…

Fluid Dynamics · Physics 2007-05-23 D. Iftimie , M. C. Lopes Filho , H. J. Nussenzveig Lopes

We study the minimal genus problem for some smooth four-manifolds.

Geometric Topology · Mathematics 2023-07-11 András I. Stipsicz , Zoltán Szabó

During the early stages of an impact a small amount material may be jetted and ejected at speeds exceeding the impact velocity. Jetting is an important process for producing melt during relatively low velocity impacts. How impact angle…

Earth and Planetary Astrophysics · Physics 2021-03-03 Shigeru Wakita , Brandon Johnson , C. Adeene Denton , Thomas M. Davison

We describe precisely, under generic conditions, the contact of the accessibility set at time $T$ with an abnormal direction, first for a single-input affine control system with constraint on the control, and then as an application for a…

Optimization and Control · Mathematics 2016-08-16 Emmanuel Trélat

In this paper we define new Monte Carlo type classical and quantum hitting times, and we prove several relationships among these and the already existing Las Vegas type definitions. In particular, we show that for some marked state the two…

Quantum Physics · Physics 2018-03-22 Frederic Magniez , Ashwin Nayak , Peter C. Richter , Miklos Santha

We develop a framework for dealing with smooth approximations to billiards with corners in the two-dimensional setting. Let a polygonal trajectory in a billiard start and end up at the same billiard's corner point. We prove that smooth…

Chaotic Dynamics · Physics 2018-04-10 D. Turaev , V. Rom-Kedar

We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…

Probability · Mathematics 2018-07-19 Roberto I. Oliveira , Yuval Peres

We prove that the time of the first collision between two particles in a Sinai billiard table converges weakly to an exponential distribution when time is rescaled by the inverse of the radius of the particles. This results provides a first…

Dynamical Systems · Mathematics 2016-03-25 Dmitry Dolgopyat , Péter Nándori

Under certain conditions such as the $2$-convexity, a singularity of the level set flow is of type I (in the sense that the rate of curvature blow-up is constrained before and after the singular time) if and only if the flow shrinks to…

Differential Geometry · Mathematics 2022-11-22 Siao-Hao Guo

It is a fact simple to establish that the mixing time of the simple random walk on a d-regular graph $G_n$ with n vertices is asymptotically bounded from below by $d/ ((d-2)\log (d-1))\log n$. Such a bound is obtained by comparing the walk…

Probability · Mathematics 2021-02-17 Charles Bordenave , Hubert Lacoin

We give a deterministic algorithm for finding the minimum (weight) cut of an undirected graph on $n$ vertices and $m$ edges using $\text{polylog}(n)$ calls to any maximum flow subroutine. Using the current best deterministic maximum flow…

Data Structures and Algorithms · Computer Science 2022-05-31 Jason Li , Debmalya Panigrahi

We extend the analysis by Esedo\={g}lu and Otto (2015) of thresholding energies for the celebrated multiphase Bence-Merriman-Osher algorithm for computing mean curvature flow of interfacial networks, to the case of differing space-dependent…

Analysis of PDEs · Mathematics 2025-03-27 Andrea Chiesa , Karel Svadlenka

A computational study of higher-order derivative ratios on a time interval leading to the enstrophy peak is presented in the case of the 3D Taylor-Green vortex, a benchmark problem in the simulation of turbulent flows. The main finding is…

Analysis of PDEs · Mathematics 2026-05-22 Zoran Grujić , Muhammad Mohebujjaman

In this work we explicitly solve the problem of the harmonic oscillator in the classical limit of a minimal-length scenario. We show that (i) the motion equation of the oscillator is not linear anymore because the presence of a minimal…

High Energy Physics - Theory · Physics 2016-09-15 T. S. Quintela , J. C. Fabris , J. A. Nogueira

According to the Harris-Luck criterion the relevance of a fluctuating interaction at the critical point is connected to the value of the fluctuation exponent omega. Here we consider different types of relevant fluctuations in the quantum…

Disordered Systems and Neural Networks · Physics 2009-10-30 F. Igloi , D. Karevski , H. Rieger

We model the inspiral of a compact object into a more massive black hole rotating very near the theoretical maximum. We find that once the body enters the near-horizon regime the gravitational radiation is characterized by a constant…

General Relativity and Quantum Cosmology · Physics 2016-09-21 Samuel E. Gralla , Scott A. Hughes , Niels Warburton

In this paper we produce a lower bound for the number of periodic orbits of certain Hamiltonian vector fields near Bott-nondegenerate symplectic critical submanifolds. This result is then related to the problem of finding closed orbits of…

Differential Geometry · Mathematics 2007-05-23 Ely Kerman

We study Maker-Breaker games played on the edge set of a random graph. Specifically, we consider the random graph process and analyze the first time in a typical random graph process that Maker starts having a winning strategy for his final…

Combinatorics · Mathematics 2014-01-07 Sonny Ben-Shimon , Asaf Ferber , Dan Hefetz , Michael Krivelevich
‹ Prev 1 8 9 10 Next ›