English
Related papers

Related papers: Approximating parametric suprema for constructible…

200 papers

This paper develops a new direct approach to approximating suprema of general empirical processes by a sequence of suprema of Gaussian processes, without taking the route of approximating whole empirical processes in the sup-norm. We prove…

Probability · Mathematics 2014-08-19 Victor Chernozhukov , Denis Chetverikov , Kengo Kato

We consider the two-point function of the totally asymmetric simple exclusion process with stationary initial conditions. The two-point function can be expressed as the discrete Laplacian of the variance of the associated height function.…

Mathematical Physics · Physics 2014-04-24 Jinho Baik , Patrik L. Ferrari , Sandrine Péché

We prove that the maximum of two smooth strictly plurisubharmonic functions on an almost complex manifold can be uniformly approximated by smooth strictly plurisubharmonic functions.

Complex Variables · Mathematics 2013-04-01 Alexandre Sukhov

We construct explicitly Pad\'e approximations of the second kind for a special class of G-functions. These are then applied to prove a Baker-type lower bound for linear forms in the p-adic values of these functions. Moreover, we consider…

Number Theory · Mathematics 2018-07-27 Keijo Väänänen

In a series of recent papers, W. M. Schmidt and L. Summerer developed a new theory by which they recover all major generic inequalities relating exponents of Diophantine approximation to a point in $\mathbb{R}^n$, and find new ones. Given a…

Number Theory · Mathematics 2016-07-05 Damien Roy

This article addresses structure-preserving smooth approximation of semiconcave functions. semiconcave functions are of particular interest because they naturally arise in a variety of variational problems, including {optimal feedback…

Optimization and Control · Mathematics 2026-02-10 Karl Kunisch , Donato Vásquez-Varas

Let $K$ be a compact Hausdorff space and let $(f_n)_{n\in \N}$ be a pairwise disjoint sequence of continuous functions from $K$ into $[0,1]$. We say that a compact space $L$ \emph{adds supremum} of $(f_n)_{n\in \N}$ in $K$ if there exists a…

General Topology · Mathematics 2016-02-23 André Santoleri Villa Barbeiro , Rogério Augusto dos Santos Fajardo

We provide an alternative proof of the recent result by Park and Pham (2022) on the expected suprema of positive selector and empirical processes. We extend it to positive infinitely divisible processes.

Probability · Mathematics 2026-01-26 Witold Bednorz , Rafał Martynek , Rafał Meller

We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…

Numerical Analysis · Mathematics 2025-12-17 Álvaro Fernández Corral , Yahya Saleh

We generalize the definition of Pro-Chern-Schwartz-MacPherson (Pro-CSM) class of Aluffi for schemes to not necessarily proper DM stacks. The Pro-CSM class of constructible functions on a DM stack $\cX$ can be similarly defined. In the case…

Algebraic Geometry · Mathematics 2015-03-26 Yunfeng Jiang

The expected supremum of a Gaussian process indexed by the image of an index set under a function class is bounded in terms of separate properties of the index set and the function class. The bound is relevant to the estimation of nonlinear…

Machine Learning · Computer Science 2014-11-12 Andreas Maurer

We show that the recent breakthrough result of [Buchbinder and Feldman, FOCS'24] could further lead to a deterministic $(1-\kappa_{f}/e-\varepsilon)$-approximate algorithm for maximizing a submodular function with curvature $\kappa_{f}$…

Data Structures and Algorithms · Computer Science 2024-09-06 Wenxin Li

We advance the Cohn-Umans framework for developing fast matrix multiplication algorithms. We introduce, analyze, and search for a new subclass of strong uniquely solvable puzzles (SUSP), which we call simplifiable SUSPs. We show that these…

Computational Complexity · Computer Science 2023-07-18 Matthew Anderson , Vu Le

While any infimum in a poset can also be computed as a supremum, and vice versa, categorical limits and colimits do not always approximate each other. If I approach a point from below, and you approach it from above, then we will surely…

Category Theory · Mathematics 2022-04-21 Dusko Pavlovic , Dominic J. D. Hughes

Finite (word) state transducers extend finite state automata by defining a binary relation over finite words, called rational relation. If the rational relation is the graph of a function, this function is said to be rational. The class of…

Formal Languages and Automata Theory · Computer Science 2025-04-25 Emmanuel Filiot , Ismaël Jecker , Khushraj Madnani , Saina Sunny

We study universal approximation of continuous functionals on compact subsets of products of Hilbert spaces. We prove that any such functional can be uniformly approximated by models that first take finitely many continuous linear…

Machine Learning · Computer Science 2026-02-04 Andrey Krylov , Maksim Penkin

Approximations of functions with finite data often do not respect certain "structural" properties of the functions. For example, if a given function is non-negative, a polynomial approximation of the function is not necessarily also…

Numerical Analysis · Mathematics 2020-08-20 Vidhi Zala , Robert M. Kirby , Akil Narayan

We present a constructive proof of Brouwer's fixed point theorem for uniformly continuous and sequentially locally non-constant functions based on the existence of approximate fixed points. And we will show that Brouwer's fixed point…

Logic · Mathematics 2011-08-24 Yasuhito Tanaka

We propose to use Tarski's least fixpoint theorem as a basis to define recursive functions in the calculus of inductive constructions. This widens the class of functions that can be modeled in type-theory based theorem proving tool to…

Logic in Computer Science · Computer Science 2007-05-23 Yves Bertot

An approach is suggested defining effective sums of divergent series in the form of self-similar exponential approximants. The procedure of constructing these approximants from divergent series with arbitrary noninteger powers is developed.…

Statistical Mechanics · Physics 2009-10-31 V. I. Yukalov , S. Gluzman