English
Related papers

Related papers: Approximating parametric suprema for constructible…

200 papers

Approximate solutions to functional evolution equations are constructed through a combination of series and conjugation methods, and relative errors are estimated. The methods are illustrated, both analytically and numerically, by…

Mathematical Physics · Physics 2015-03-19 Thomas Curtright , Xiang Jin , Cosmas Zachos

We study the problem of maximizing a function that is approximately submodular under a cardinality constraint. Approximate submodularity implicitly appears in a wide range of applications as in many cases errors in evaluation of a…

Data Structures and Algorithms · Computer Science 2024-11-19 Thibaut Horel , Yaron Singer

We study approximation by arbitrary linear combinations of $n$ translates of a single function of periodic functions. We construct some linear methods of this approximation for univariate functions in the class induced by the convolution…

Numerical Analysis · Mathematics 2021-11-05 Dinh Dũng , Vu Nhat Huy

We investigate deep composite polynomial approximations of continuous but non-differentiable functions with algebraic cusp singularities. The functions in focus consist of finitely many cusp terms of the form $|x-a_j|^{\alpha_j}$ with…

Numerical Analysis · Mathematics 2026-01-01 Kingsley Yeon , Steven B. Damelin , Michael Werman

We prove that admissible functions for Fubini-Study metrics on the complex projective space $P_{m}C$, of complex dimension $m$, invariant by a convenient automorphisms group, are lower bounded by a function going to minus infinity on the…

Differential Geometry · Mathematics 2007-05-23 Adnene Ben Abdesselem

We define a function of two real vectors by a certain homogeneous quotient involving power sums, and show that its supremum grows asymptotically linearly w.r.t. the dimension. From this, we deduce a condition under which a parametric set of…

Classical Analysis and ODEs · Mathematics 2025-12-08 Stefan Gerhold , Friedrich Hubalek

There are various types of motion of a heavy symmetric top like regular precession, cusp like motion, rise of the top, etc. One of the tools used to understand that motion is effective potential. The effective potential for a spinning heavy…

Classical Physics · Physics 2025-08-28 Vedat Tanrıverdi

In this article we determine the coefficient bounds for functions in certain subclasses of analytic functions defined by subordination which are related to the well-known classes of starlike and convex functions. The main results deal with…

Complex Variables · Mathematics 2017-04-27 Nirupam Ghosh , A. Vasudevarao

We consider M-estimators and derive supremal-inequalities of exponential-or polynomial type according as a boundedness- or a moment-condition is fulfilled. This enables us to derive rates of r-complete convergence and also to show r-qick…

Statistics Theory · Mathematics 2023-11-30 Dietmar Ferger

In this paper we investigate cumulative hierarchies of functions on structures, or cumulative powers, and study their properties. Particularly, we show how they extend the preservation phenomena of reduced powers, direct powers and…

Logic · Mathematics 2026-05-14 Pedro Teixeira Yago

The aim of this work is to provide formulae for the subdifferential and the conjungate function of the supremun function over an arbitrary family of functions. The work is principally motivated by the case when data functions are lower…

Optimization and Control · Mathematics 2018-05-28 Pedro Pérez-Aros

We prove three strong approximation theorems for the `supermarket' or `join the shortest queue' model -- a law of large numbers, a jump process approximation and a central limit theorem. The estimates are carried through rather explicitly.…

Probability · Mathematics 2007-05-23 Malwina J. Luczak , James Norris

Given a predicate $P: \{-1, 1\}^k \to \{-1, 1\}$, let $CSP(P)$ be the set of constraint satisfaction problems whose constraints are of the form $P$. We say that $P$ is approximable if given a nearly satisfiable instance of $CSP(P)$, there…

Computational Complexity · Computer Science 2020-04-28 Neng Huang , Aaron Potechin

Best simultaneous approximation (BSA) for finitely or infinitely many functions are considered under the uniform norm and other important norms. Characterization theorems for a BSA from a finite-dimensional subspace are obtained by a…

Combinatorics · Mathematics 2024-04-22 Shinji Tanimoto

We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…

Logic · Mathematics 2008-03-25 Wesley Calvert , Desmond Cummins , Sara Miller , Julia F. Knight

We consider scalar equilibrium problems governed by a bifunction in a finite-dimensional framework. By using classical arguments in Convex Analysis, we show that under suitable generalized convexity assumptions imposed on the bifunction,…

Optimization and Control · Mathematics 2024-01-02 Valerian-Alin Fodor , Nicolae Popovici

In micro- and nano-scale systems, particles can be moved by using an external force like gravity or a magnetic field. In the presence of adhesive particles that can attach to each other, the challenge is to decide whether a shape is…

Computational Geometry · Computer Science 2022-06-16 Jakob Keller , Christian Rieck , Christian Scheffer , Arne Schmidt

We discuss approximation of extremal functions by polynomials in the weighted Bergman spaces $A^p_\alpha$ where $-1 < \alpha < 0$ and $-1 < \alpha < p-2$. We obtain bounds on how close the approximation is to the true extremal function in…

Complex Variables · Mathematics 2017-05-19 Timothy Ferguson

We consider notions of metrized categories, and then approximate categorical structures defined by a function of three variables generalizing the notion of $2$-metric space. We prove an embedding theorem giving sufficient conditions for an…

Category Theory · Mathematics 2015-11-06 Abdelkrim Aliouche , Carlos Simpson

In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intractable for exact algorithms because of the large number of…

Artificial Intelligence · Computer Science 2012-12-12 David Ephraim Larkin