English
Related papers

Related papers: Epsilon-complexity of continuous functions

200 papers

Any Littlestone class, or stable graph, has finite sets which function as ``virtual elements'': these can be seen from the learning side as representing hypotheses which are expressible as weighted majority opinions of hypotheses in the…

Logic · Mathematics 2025-09-01 Maryanthe Malliaris , Olga Medrano Martín del Campo , Shay Moran

A method of proving local continuity of concave functions on convex set possessing the $\mu$-compactness property is presented. This method is based on a special approximation of these functions. The class of $\mu$-compact sets can be…

Functional Analysis · Mathematics 2010-06-22 M. E. Shirokov

In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…

Combinatorics · Mathematics 2026-01-05 Robert Coulter , Steven Senger

There is no single universally accepted definition of "Complexity". There are several perspectives on complexity and what constitutes complex behaviour or complex systems, as opposed to regular, predictable behaviour and simple systems. In…

Data Analysis, Statistics and Probability · Physics 2018-01-17 Nithin Nagaraj , Karthi Balasubramanian

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

Combinatorics · Mathematics 2013-11-27 Pavel Kozhevnikov

We develop potential theory for $m$-subharmonic functions with respect to a Hermitian metric on a Hermitian manifold. First, we show that the complex Hessian operator is well-defined for bounded functions in this class. This allows to…

Complex Variables · Mathematics 2025-12-03 Slawomir Kolodziej , Ngoc Cuong Nguyen

Treating a conjecture, P^#P != NP, on the separation of complexity classes as an axiom, an implication is found in three manifold topology with little obvious connection to complexity theory. This is reminiscent of Harvey Friedman's work on…

Computational Complexity · Computer Science 2009-06-17 M. Freedman

In this paper we study the modulus of continuity of weak solutions to a singular elliptic equation in the plane under very weak assumption on the integrability of the elliptic coefficients. Our investigation reveals that the modulus of…

Analysis of PDEs · Mathematics 2023-10-30 Xiangsheng Xu

Motivated by applications in geomorphology, the aim of this paper is to extend Morse-Smale theory from smooth functions to the radial distance function (measured from an internal point), defining a convex polyhedron in 3-dimensional…

Computational Geometry · Computer Science 2023-06-16 Balázs Ludmány , Zsolt Lángi , Gábor Domokos

In this chapter, a statistical measure of complexity is introduced and some of its properties are discussed. Also, some straightforward applications are shown.

Adaptation and Self-Organizing Systems · Physics 2010-09-09 Ricardo Lopez-Ruiz , Hector Mancini , Xavier Calbet

Regular polygons are characterized as area-constrained critical points of the perimeter functional with respect to particular families of perturbations in the class of polygons with a fixed number of sides. We also review recent results in…

Analysis of PDEs · Mathematics 2024-06-27 Marco Bonacini , Riccardo Cristoferi , Ihsan Topaloglu

Coverage functions are an important subclass of submodular functions, finding applications in machine learning, game theory, social networks, and facility location. We study the complexity of partial function extension to coverage…

Data Structures and Algorithms · Computer Science 2019-07-18 Umang Bhaskar , Gunjan Kumar

Pseudo-holomorphic curves on almost complex manifolds have been much more intensely studied than their "dual" objects, the plurisubharmonic functions. These functions are defined classically by requiring that the restriction to each…

Complex Variables · Mathematics 2017-12-12 F. Reese Harvey , H. Blaine Lawson

We derive the first three terms of the epsilon-expansion of the scalar one-loop Bhabha box function from a representation in terms of three generalized hypergeometric functions, which is valid in arbitrary dimensions.

High Energy Physics - Phenomenology · Physics 2010-01-05 J. Fleischer , T. Riemann , O. V. Tarasov

Except for crystalline or random structures, an agreed definition of complexity for intermediate and hence interesting cases does not exist. We fill this gap with a notion of complexity that characterises shapes formed by any finite number…

General Relativity and Quantum Cosmology · Physics 2024-05-14 Julian Barbour , Zaza Doborjginidze , Tim Koslowski , Hemant Shukla

We consider different generalizations of the Euler formula and discuss the properties of the associated trigonometric functions. The problem is analyzed from different points of view and it is shown that it can be formulated in a natural…

Classical Analysis and ODEs · Mathematics 2011-03-15 D. Babusci , G. Dattoli , E. Di Palma , E. Sabia

We define a very general notion of regularity for functions taking values in an alternative real $*$-algebra. Over Clifford numbers, this notion subsumes the well-established notions of monogenic function and slice-monogenic function. Over…

Complex Variables · Mathematics 2024-06-10 Riccardo Ghiloni , Caterina Stoppato

We discuss some aspects of the extension to continuous systems of a statistical measure of complexity introduced by Lopez-Ruiz, Mancini and Calbet (LMC) [Phys. Lett. A 209 (1995) 321]. In general, the extension of a magnitude from the…

Chaotic Dynamics · Physics 2009-11-07 Raquel G. Catalan , Jose Garay , Ricardo Lopez-Ruiz

We present an application of the basic mathematical concept of complex functions as topological solitons, a most interesting area of research in physics. Such application of complex theory is virtually unknown outside the community of…

Physics Education · Physics 2007-05-23 R. J. Cova , C. Uberoi

We propose an entropy function for simplicial complices. Its value gives the expected cost of the optimal encoding of sequences of vertices of the complex, when any two vertices belonging to the same simplex are indistinguishable. We show…

Information Theory · Computer Science 2016-03-24 Stefan Dantchev , Ioannis Ivrissimtzis