English
Related papers

Related papers: Implicit function and tangent cone theorems for si…

200 papers

We extend the Colombeau algebra of generalized functions to arbitrary (infinitely differentiable, paracompact) n-dimensional manifolds M. Embedding of continuous functions and distributions is achieved with the help of a family of n-forms…

General Relativity and Quantum Cosmology · Physics 2007-05-23 H. Balasin

We survey recent generalizations and improvements of the linear programming method that involve semidefinite programming. A general framework using group representations and tools from graph theory is provided.

Information Theory · Computer Science 2010-09-09 Christine Bachoc

We establish the unique solvability of a coupling problem for entire functions which arises in inverse spectral theory for singular second order ordinary differential equations/two-dimensional first order systems and is also of relevance…

Classical Analysis and ODEs · Mathematics 2019-02-26 Jonathan Eckhardt

This paper examines the feasible region of a standard conic program represented as the intersection of a closed convex cone and a set of linear equalities. It is recently shown that when Slater constraint qualification (strict feasibility)…

Optimization and Control · Mathematics 2025-04-22 Haesol Im

The present paper deals with the perturbation analysis of set-valued inclusion problems, a problem format whose relevance has recently emerged in such contexts as robust and vector optimization as well as in vector equilibrium theory. The…

Optimization and Control · Mathematics 2024-05-03 Amos Uderzo

I show that the general implicit-function problem (or parametrized fixed-point problem) in one complex variable has an explicit series solution given by a trivial generalization of the Lagrange inversion formula. I give versions of this…

Complex Variables · Mathematics 2009-11-16 Alan D. Sokal

Generic programming (GP) is an increasingly important trend in programming languages. Well-known GP mechanisms, such as type classes and the C++0x concepts proposal, usually combine two features: 1) a special type of interfaces; and 2)…

Programming Languages · Computer Science 2012-03-21 Bruno C. d. S. Oliveira , Tom Schrijvers , Wontae Choi , Wonchan Lee , Kwangkeun Yi

We provide a unified framework for a systematic analysis of the existence of solutions to general nonconvex problems, relying on asymptotic and retractive cones for functions and sets. Using this framework we develop new necessary and…

Optimization and Control · Mathematics 2025-05-28 Rohan Rele , Angelia Nedich

In this paper, we introduce a class of nonlinear optimisation problems. Under mild assumptions, we obtain the existence of potential functions and show that the potential function is a generalised solution of a Monge-Amp\`ere type equation.…

Analysis of PDEs · Mathematics 2019-09-13 Jiakun Liu

We exhibit differential geometric structures that arise in numerical methods, based on the construction of Cauchy sequences, that are currently used to prove explicitly the existence of weak solutions to functional equations. We describe…

Functional Analysis · Mathematics 2020-08-13 Jean-Pierre Magnot

Over 300 sequences and many unsolved problems and conjectures related to them are presented herein. These notions, definitions, unsolved problems, questions, theorems corollaries, formulae, conjectures, examples, mathematical criteria, etc.…

General Mathematics · Mathematics 2016-03-29 Octavian Cira , Florentin Smarandache

Scattering amplitudes for colored theories have recently been formulated in a new way, in terms of curves on surfaces. In this note we describe a canonical set of functions we call surface functions, associated to all orders in the…

High Energy Physics - Theory · Physics 2026-04-08 Nima Arkani-Hamed , Hadleigh Frost , Giulio Salvatori

We are interested in existence results for second order differential inclusions, involving finite number of unilateral constraints in an abstract framework. These constraints are described by a set-valued operator, more precisely a proximal…

Classical Analysis and ODEs · Mathematics 2010-03-10 Frederic Bernicot , Aline Lefebvre-Lepot

The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable…

Logic · Mathematics 2019-03-14 Ivan Georgiev

Implicit computational complexity, which aims at characterizing complexity classes by machine-independent means, has traditionally been based, on the one hand, on programs and deductive formalisms for free algebras, and on the other hand on…

Logic in Computer Science · Computer Science 2018-02-12 Daniel Leivant , Jean-Yves Marion

Revealing the implicit semantic relation between the constituents of a noun-compound is important for many NLP applications. It has been addressed in the literature either as a classification task to a set of pre-defined relations or by…

Computation and Language · Computer Science 2018-05-08 Vered Shwartz , Ido Dagan

Chapter 1 deals with the problem of the existence of an upper/lower envelope from a convex cone or, more generally, a convex set for functions on the projective limit of vector lattices with values in the completion of the Kantorovich space…

Functional Analysis · Mathematics 2018-12-31 B. N. Khabibullin , A. P. Rozit , E. B. Khabibullina

Building upon ideas of Hironaka, Bierstone-Milman, Malgrange and others we generalize the inverse and implicit function theorem (in differential, analytic and algebraic setting) to sets of functions of larger multiplicities (or ideals).…

Algebraic Geometry · Mathematics 2016-02-11 Jaroslaw Wlodarczyk

In this paper, we study the consequences of the fundamental theorem of calculus from an algebraic point of view. For functions with singularities, this leads to a generalized notion of evaluation. We investigate properties of such…

Rings and Algebras · Mathematics 2025-01-20 Clemens G. Raab , Georg Regensburger

How can complexity theory and algorithms benefit from practical advances in computing? We give a short overview of some prior work using practical computing to attack problems in computational complexity and algorithms, informally describe…

Computational Complexity · Computer Science 2008-11-11 Ryan Williams