English
Related papers

Related papers: Low-discrepancy sequences for piecewise smooth fun…

200 papers

We prove that the mean curvature of a smooth surface in $\mathbb{R}^n$, $n\geq 2$, arises as the limit of a sequence of functions that are intrinsically related to the difference between an $n$- and $1$-dimensional fractional Laplacian of a…

Analysis of PDEs · Mathematics 2024-10-28 Stefania Patrizi , Mary Vaughan

Divergences are quantities that measure discrepancy between two probability distributions and play an important role in various fields such as statistics and machine learning. Divergences are non-negative and are equal to zero if and only…

Statistics Theory · Mathematics 2019-10-22 Tomohiro Nishiyama

We propose a derivative-free trust-region method based on finite-difference gradient approximations for smooth optimization problems with convex constraints. The proposed method does not require computing an approximate stationarity…

Optimization and Control · Mathematics 2025-10-21 Dânâ Davar , Geovani Nunes Grapiglia

In this article, we present explicit estimates of the size of the domain on which the Implicit Function Theorem and the Inverse Function Theorem are valid. For maps that are twice continuously differentiable, these estimates depend upon the…

Systems and Control · Electrical Eng. & Systems 2023-09-28 Ashutosh Jindal , Debasish Chatterjee , Ravi Banavar

Description of linear continuous functionals on a space of rapidly decreasing infinitely differentiable functions on an unbounded closed convex set in $\mathbb R^n$ in terms of their Fourier-Laplace transform is obtained.

Complex Variables · Mathematics 2010-03-18 I. Kh. Musin , P. V. Yakovleva

We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.

Mathematical Physics · Physics 2007-05-23 Christian Mercat

We show that, under mild assumptions on the limiting curve, a sequence of simple chordal planar curves converges uniformly whenever certain Loewner driving functions converge. We extend this result to random curves. The random version…

Probability · Mathematics 2012-04-05 Scott Sheffield , Nike Sun

The main purpose of the paper is to study sharp estimates of approximation of periodic functions in the H\"older spaces $H_p^{r,\alpha}$ for all $0<p\le\infty$ and $0<\alpha\le r$. By using modifications of the classical moduli of…

Classical Analysis and ODEs · Mathematics 2015-07-28 Yurii Kolomoitsev , Jürgen Prestin

We prove a general result about the behaviour of minimizing sequences for nonlocal shape functionals satisfying suitable structural assumptions. Typical examples include functions of the eigenvalues of the fractional Laplacian under…

Analysis of PDEs · Mathematics 2018-06-05 Enea Parini , Ariel Salort

We study two related invariants of Lagrangian submanifolds in symplectic manifolds. For a Lagrangian torus these invariants are functions on the first cohomology of the torus. The first invariant is of topological nature and is related to…

Symplectic Geometry · Mathematics 2018-01-03 Michael Entov , Yaniv Ganor , Cedric Membrez

We investigate geometric and functional inequalities for the class of log-concave probability sequences. We prove dilation inequalities for log-concave probability measures on the integers. A functional analogue of this geometric inequality…

Probability · Mathematics 2023-06-19 Arnaud Marsiglietti , James Melbourne

In this paper, we study two-component versions of the periodic Hunter-Saxton equation and its $\mu$-variant. Considering both equations as a geodesic flow on the semidirect product of the circle diffeomorphism group $\Diff(\S)$ with a space…

Mathematical Physics · Physics 2011-05-05 Martin Kohlmann

The width of a convex curve in the plane is the minimal distance between a pair of parallel supporting lines of the curve. In this paper we study the width of nodal lines of eigenfunctions of the Laplacian on the standard flat torus. We…

Analysis of PDEs · Mathematics 2015-05-20 Jean Bourgain , Zeev Rudnick

We show several properties related to the structure of the family of classes of two-dimensional periodic continued fractions. This approach to the study of the family of classes of nonequivalent two dimexsional periodic continued fractions…

Number Theory · Mathematics 2009-11-17 Oleg Karpenkov

Using lattice approximations of Euclidean space, we develop a way to approximate stable processes that are represented by stochastic integrals over Euclidean space. Via a stable version of the Lindeberg-Feller Theorem we show that the…

Probability · Mathematics 2013-02-19 Clément Dombry , Paul Jung

We prove several results on approximation and interpolation of holomorphic Legendrian curves in convex domains in $\mathbb{C}^{2n+1}$, $n \geq 2$, with the standard contact structure. Namely, we show that such a curve, defined on a compact…

Complex Variables · Mathematics 2024-09-09 Andrej Svetina

We introduce CO2, an efficient algorithm to produce convexly-weighted coresets with respect to generic smooth divergences. By employing a functional Taylor expansion, we show a local equivalence between sufficiently regular losses and their…

Machine Learning · Statistics 2025-05-21 Alex Kokot , Alex Luedtke

We extend the results of Riemannian geometry over finite groups and provide a full classification of all linear connections for the minimal noncommutative differential calculus over a finite cyclic group. We solve the torsion-free and…

Mathematical Physics · Physics 2020-12-24 Arkadiusz Bochniak , Andrzej Sitarz , Paweł Zalecki

We investigate the approximation of $d$-variate periodic functions in Sobolev spaces of dominating mixed (fractional) smoothness $s>0$ on the $d$-dimensional torus, where the approximation error is measured in the $L_2-$norm. In other…

Numerical Analysis · Mathematics 2013-12-24 Thomas Kuehn , Winfried Sickel , Tino Ullrich

Simulation-based verification algorithms can provide formal safety guarantees for nonlinear and hybrid systems. The previous algorithms rely on user provided model annotations called discrepancy function, which are crucial for computing…

Systems and Control · Computer Science 2015-02-09 Chuchu Fan , Sayan Mitra