Related papers: Average pace and horizontal chords
Conclusive mathematical arguments are presented supporting the ratchet conjecture [R. Chac\'{o}n, J. Phys. A \textbf{40}, F413 (2007)], i.e., the existence of a universal force waveform which optimally enhances directed transport by…
Discrete mechanics is used to present fluid mechanics, fluid-structure interactions, electromagnetism and optical physics in a coherent theoretical and numerical approach. Acceleration considered as an absolute quantity is written as a sum…
We present a geometric proof of the averaging theorem for perturbed dynamical systems on a Riemannian manifold, in the case where the flow of the unperturbed vector field is periodic and the $\mathbb{S}^{1}$-action associated to this vector…
We consider a perturbed integrable system with one frequency, and the approximate dynamics for the actions given by averaging over the angle. The classical theory grants that, for a perturbation of order epsilon, the error of this…
In this paper we consider the $p$-Norm Hamming Centroid problem which asks to determine whether some given binary strings have a centroid with a bound on the $p$-norm of its Hamming distances to the strings. Specifically, given a set of…
We study the Hamilton cycle problem with input a random graph G=G(n,p) in two settings. In the first one, G is given to us in the form of randomly ordered adjacency lists while in the second one we are given the adjacency matrix of G. In…
The relation among instantaneous, mean and average velocities in one-dimensional motion with constant acceleration is studied. It was shown that the instant velocity evaluated in the time $t_{p}=\left(t_2+t_1\right)/2$ is similar to the…
Global existence for the nonisentropic compressible Euler equations with vacuum boundary for all adiabatic constants $\gamma > 1$ is shown through perturbations around a rich class of background nonisentropic affine motions. The notable…
Consider continuous-time random walks on Cayley graphs where the rate assigned to each edge depends only on the corresponding generator. We show that the limiting speed is monotone increasing in the rates for infinite Cayley graphs that…
Given an elliptic curve $E$ and a positive integer $N$, we consider the problem of counting the number of primes $p$ for which the reduction of $E$ modulo $p$ possesses exactly $N$ points over $\mathbb F_p$. On average (over a family of…
We propose an analysis of heart rate marathon runners implemented by computing a multifractal spectrum based on p-exponents. We draw physiological conclusions about their performance. Finally, we link this analysis with the disturbances of…
Necessary and sufficient conditions of uniform consistency are explored. A hypothesis is simple. Nonparametric sets of alternatives are bounded convex sets in $\mathbb{L}_p$, $p >1$ with "small" balls deleted. The "small" balls have the…
We consider the problem of computing the time-convex hull of a point set under the general $L_p$ metric in the presence of a straight-line highway in the plane. The traveling speed along the highway is assumed to be faster than that off the…
We investigate the minimal error in approximating a general probability measure $\mu$ on $\mathbb{R}^d$ by the uniform measure on a finite set with prescribed cardinality $n$. The error is measured in the $p$-Wasserstein distance. In…
Period and index of a curve $X/K$ over a $p$-adic local field $K$ such that the fundamental group $\pi_1(X/K)$ admits a splitting are shown to be powers of $p$. As a consequence, examples of curves over number fields are constructed where…
We consider the minimization of an average distance functional defined on a two-dimensional domain $\Omega$ with an Euler elastica penalization associated with $\pd \Omega$, the boundary of $\Omega$. The average distance is given by…
The Lonely Runner Conjecture is a number theory problem, dating to 1964. Using dynamical systems theory, we show almost all sets of velocities solve the conjecture. Furthermore, any "traditional" approach of Diophantine approximation cannot…
For a planar point set $P$, its convex hull is the smallest convex polygon that encloses all points in $P$. The construction of the convex hull from an array $I_P$ containing $P$ is a fundamental problem in computational geometry. By…
This paper presents some limit theorems for certain functionals of moving averages of semimartingales plus noise which are observed at high frequency. Our method generalizes the pre-averaging approach (see [Bernoulli 15 (2009) 634--658,…
Though athletics statistics are abundant, it is a difficult task to quantitatively compare performances from different events of track, field, and road running in a meaningful way. There are several commonly-used methods, but each has its…