We develop a twotiming perturbation analysis to provide quantitative insights on the existence of temporal ratchets in an exemplary system of a particle moving in a tank of fluid in response to an external vibration of the tank. We consider twomode vibrations with angular frequencies
In the supercritical range of the polytropic indices
 NSFPAR ID:
 10380555
 Publisher / Repository:
 Springer Science + Business Media
 Date Published:
 Journal Name:
 Archive for Rational Mechanics and Analysis
 Volume:
 246
 Issue:
 23
 ISSN:
 00039527
 Page Range / eLocation ID:
 p. 9571066
 Format(s):
 Medium: X
 Sponsoring Org:
 National Science Foundation
More Like this

Abstract and$$\omega $$ $\omega $ , where$$\alpha \omega $$ $\alpha \omega $ is a rational number. If$$\alpha $$ $\alpha $ is a ratio of odd and even integers (e.g.,$$\alpha $$ $\alpha $ ), the system yields a net response: here, a nonzero timeaverage particle velocity. Our firstorder perturbation solution predicts the existence of temporal ratchets for$$\tfrac{2}{1},\,\tfrac{3}{2},\,\tfrac{4}{3}$$ $\frac{2}{1},\phantom{\rule{0ex}{0ex}}\frac{3}{2},\phantom{\rule{0ex}{0ex}}\frac{4}{3}$ . Furthermore, we demonstrate, for a reduced model, that the temporal ratcheting effect for$$\alpha =2$$ $\alpha =2$ and$$\alpha =\tfrac{3}{2}$$ $\alpha =\frac{3}{2}$ appears at the thirdorder perturbation solution. More importantly, we find closedform formulas for the magnitude and direction of the induced net velocities for these$$\tfrac{4}{3}$$ $\frac{4}{3}$ values. On a broader scale, our methodology offers a new mathematical approach to study the complicated nature of temporal ratchets in physical systems.$$\alpha $$ $\alpha $Graphic abstract 
Abstract We consider integral areaminimizing 2dimensional currents
in$T$ $T$ with$U\subset \mathbf {R}^{2+n}$ $U\subset {R}^{2+n}$ , where$\partial T = Q\left [\!\![{\Gamma }\right ]\!\!]$ $\partial T=Q\u301a\Gamma \u301b$ and$Q\in \mathbf {N} \setminus \{0\}$ $Q\in N\setminus \left\{0\right\}$ is sufficiently smooth. We prove that, if$\Gamma $ $\Gamma $ is a point where the density of$q\in \Gamma $ $q\in \Gamma $ is strictly below$T$ $T$ , then the current is regular at$\frac{Q+1}{2}$ $\frac{Q+1}{2}$ . The regularity is understood in the following sense: there is a neighborhood of$q$ $q$ in which$q$ $q$ consists of a finite number of regular minimal submanifolds meeting transversally at$T$ $T$ (and counted with the appropriate integer multiplicity). In view of wellknown examples, our result is optimal, and it is the first nontrivial generalization of a classical theorem of Allard for$\Gamma $ $\Gamma $ . As a corollary, if$Q=1$ $Q=1$ is a bounded uniformly convex set and$\Omega \subset \mathbf {R}^{2+n}$ $\Omega \subset {R}^{2+n}$ a smooth 1dimensional closed submanifold, then any areaminimizing current$\Gamma \subset \partial \Omega $ $\Gamma \subset \partial \Omega $ with$T$ $T$ is regular in a neighborhood of$\partial T = Q \left [\!\![{\Gamma }\right ]\!\!]$ $\partial T=Q\u301a\Gamma \u301b$ .$\Gamma $ $\Gamma $ 
Abstract The softmax policy gradient (PG) method, which performs gradient ascent under softmax policy parameterization, is arguably one of the de facto implementations of policy optimization in modern reinforcement learning. For
discounted infinitehorizon tabular Markov decision processes (MDPs), remarkable progress has recently been achieved towards establishing global convergence of softmax PG methods in finding a nearoptimal policy. However, prior results fall short of delineating clear dependencies of convergence rates on salient parameters such as the cardinality of the state space$$\gamma $$ $\gamma $ and the effective horizon$${\mathcal {S}}$$ $S$ , both of which could be excessively large. In this paper, we deliver a pessimistic message regarding the iteration complexity of softmax PG methods, despite assuming access to exact gradient computation. Specifically, we demonstrate that the softmax PG method with stepsize$$\frac{1}{1\gamma }$$ $\frac{1}{1\gamma}$ can take$$\eta $$ $\eta $ to converge, even in the presence of a benign policy initialization and an initial state distribution amenable to exploration (so that the distribution mismatch coefficient is not exceedingly large). This is accomplished by characterizing the algorithmic dynamics over a carefullyconstructed MDP containing only three actions. Our exponential lower bound hints at the necessity of carefully adjusting update rules or enforcing proper regularization in accelerating PG methods.$$\begin{aligned} \frac{1}{\eta } {\mathcal {S}}^{2^{\Omega \big (\frac{1}{1\gamma }\big )}} ~\text {iterations} \end{aligned}$$ $\begin{array}{c}\frac{1}{\eta}{\leftS\right}^{{2}^{\Omega (\frac{1}{1\gamma})}}\phantom{\rule{0ex}{0ex}}\text{iterations}\end{array}$ 
Abstract It has been recently established in David and Mayboroda (Approximation of green functions and domains with uniformly rectifiable boundaries of all dimensions.
arXiv:2010.09793 ) that on uniformly rectifiable sets the Green function is almost affine in the weak sense, and moreover, in some scenarios such Green function estimates are equivalent to the uniform rectifiability of a set. The present paper tackles a strong analogue of these results, starting with the “flagship degenerate operators on sets with lower dimensional boundaries. We consider the elliptic operators associated to a domain$$L_{\beta ,\gamma } = {\text {div}}D^{d+1+\gamma n} \nabla $$ ${L}_{\beta ,\gamma}=\text{div}{D}^{d+1+\gamma n}\nabla $ with a uniformly rectifiable boundary$$\Omega \subset {\mathbb {R}}^n$$ $\Omega \subset {R}^{n}$ of dimension$$\Gamma $$ $\Gamma $ , the now usual distance to the boundary$$d < n1$$ $d<n1$ given by$$D = D_\beta $$ $D={D}_{\beta}$ for$$D_\beta (X)^{\beta } = \int _{\Gamma } Xy^{d\beta } d\sigma (y)$$ ${D}_{\beta}{\left(X\right)}^{\beta}={\int}_{\Gamma}{Xy}^{d\beta}d\sigma \left(y\right)$ , where$$X \in \Omega $$ $X\in \Omega $ and$$\beta >0$$ $\beta >0$ . In this paper we show that the Green function$$\gamma \in (1,1)$$ $\gamma \in (1,1)$G for , with pole at infinity, is well approximated by multiples of$$L_{\beta ,\gamma }$$ ${L}_{\beta ,\gamma}$ , in the sense that the function$$D^{1\gamma }$$ ${D}^{1\gamma}$ satisfies a Carleson measure estimate on$$\big  D\nabla \big (\ln \big ( \frac{G}{D^{1\gamma }} \big )\big )\big ^2$$ $D\nabla (ln(\frac{G}{{D}^{1\gamma}})){}^{2}$ . We underline that the strong and the weak results are different in nature and, of course, at the level of the proofs: the latter extensively used compactness arguments, while the present paper relies on some intricate integration by parts and the properties of the “magical distance function from David et al. (Duke Math J, to appear).$$\Omega $$ $\Omega $ 
Abstract Based on the recent development of the framework of Volterra rough paths (Harang and Tindel in Stoch Process Appl 142:34–78, 2021), we consider here the probabilistic construction of the Volterra rough path associated to the fractional Brownian motion with
and for the standard Brownian motion. The Volterra kernel$$H>\frac{1}{2}$$ $H>\frac{1}{2}$k (t ,s ) is allowed to be singular, and behaving similar to for some$$ts^{\gamma }$$ ${ts}^{\gamma}$ . The construction is done in both the Stratonovich and Itô senses. It is based on a modified Garsia–Rodemich–Romsey lemma which is of interest in its own right, as well as tools from Malliavin calculus. A discussion of challenges and potential extensions is provided.$$\gamma \ge 0$$ $\gamma \ge 0$