English
Related papers

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

200 papers

In this note, we discuss a generalization of the well-known implicit function theorem to the time-delay case. We show that the latter problem is closely related to the bicausal changes of coordinates of time-delay systems. An iterative…

Systems and Control · Electrical Eng. & Systems 2022-12-21 Yahao Chen , Malek Ghanes , Jean-Pierre Barbot

In this paper, we introduce a new method for applying the implicit function theorem to find nontrivial solutions to overdetermined problems with a fixed boundary (given) and a free boundary (to be determined). The novelty of this method…

Analysis of PDEs · Mathematics 2021-04-06 Lorenzo Cavallina

This article handles in a short manner a few Laplace transform pairs and some extensions to the basic equations are developed. They can be applied to a wide variety of functions in order to find the Laplace transform or its inverse when…

General Mathematics · Mathematics 2014-02-13 Henrik Stenlund

The analytic implicit function theorem is extended. The function f of the theorem is integrated with respect to the dependent variable of the implicit function. A geometrical interpretation is given for the sub-geometry of the integral…

General Mathematics · Mathematics 2023-01-10 Emoke Imre

Classical results in computability theory, notably Rice's theorem, focus on the extensional content of programs, namely, on the partial recursive functions that programs compute. Later and more recent work investigated intensional…

Logic in Computer Science · Computer Science 2021-09-15 Paolo Baldan , Francesco Ranzato , Linpeng Zhang

Measurable cones, with linear and measurable functions as morphisms, are a model of intuitionistic linear logic and of call-by-name probabilistic PCF which accommodates "continuous data types" such as the real line. So far however, they…

Logic in Computer Science · Computer Science 2025-01-15 Thomas Ehrhard , Guillaume Geoffroy

This article is centered around generalizing a previous implicit function theorem of the author to be applicable for maps f:E sqcap F to F which can be lifted to Keller C^k_pi maps f_i:E sqcap F_i to F_i with F_i Banach and F=projlim F_i .…

Functional Analysis · Mathematics 2007-05-23 Seppo I Hiltunen

The classical Ruckert-Lefschetz scheme of analysis of implicit functions (defined by finite systems of n analytical equations with n unknowns) is studied from the point of view of calculations with finite number coefficients in Taylor…

Functional Analysis · Mathematics 2011-05-09 P. P. Zabreiko , A. V. Krivko-Krasko

This paper investigates the behavior of sets and functions at infinity by introducing new concepts, namely directional normal cones at infinity for unbounded sets, along with limiting and singular subdifferentials at infinity in the…

Optimization and Control · Mathematics 2025-10-13 Le Ngoc Kien , Nguyen Van Tuyen , Tran Van Nghi

In the present paper, we establish the uniqueness of tangent maps for general weakly holomorphic and locally approximable maps from an arbitrary almost complex manifold into projective algebraic varieties. As a byproduct of the approach and…

Differential Geometry · Mathematics 2024-01-01 Riccardo Caniato , Tristan Rivière

Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…

Symbolic Computation · Computer Science 2025-04-15 Iago Leal de Freitas , Júlia Mota , João Paixão , Lucas Rufino

We propose to use Church encodings in typed lambda-calculi as the basis for an automata-theoretic counterpart of implicit computational complexity, in the same way that monadic second-order logic provides a counterpart to descriptive…

Logic in Computer Science · Computer Science 2019-07-02 Lê Thành Dũng Nguyên

These are classified by the direction of approximation (from above or below), the set family types (partition or covering) of simple functions, the coefficient signature (non-negative or signed), and cardinal number of terms of simple…

General Mathematics · Mathematics 2021-08-23 Ryoji Fukuda

In this paper we study the existence and uniqueness of fixed points of a class of mappings defined on complete, (sequentially compact) cone metric spaces, without continuity conditions and depending on another function.

Functional Analysis · Mathematics 2009-06-12 José R. Morales , Edixon Rojas

Many problems in nonlinear analysis and optimization, among them variational inequalities and minimization of convex functions, can be reduced to finding zeros (namely, roots) of set-valued operators. Hence numerous algorithms have been…

Optimization and Control · Mathematics 2018-10-23 Daniel Reem , Simeon Reich

We prove an implicit function theorem for functions on infinite-dimensional Banach manifolds, invariant under the (local) action of a finite dimensional Lie group. Motivated by some geometric variational problems, we consider group actions…

Differential Geometry · Mathematics 2015-02-10 Renato G. Bettiol , Paolo Piccione , Gaetano Siciliano

The semantics of assignment and mutual exclusion in concurrent and multi-core/multi-processor systems is presented with attention to low level architectural features in an attempt to make the presentation realistic. Recursive functions on…

Discrete Mathematics · Computer Science 2008-10-09 Victor Yodaiken

We prove a generalized implicit function theorem for Banach spaces, without the usual assumption that the subspaces involved being complemented. Then we apply it to the problem of parametrization of fibers of differentiable maps, the Lie…

Group Theory · Mathematics 2007-05-23 Jinpeng An , Karl-Hermann Neeb

Tame functions are a class of nonsmooth, nonconvex functions, which feature in a wide range of applications: functions encountered in the training of deep neural networks with all common activations, value functions of mixed-integer…

Optimization and Control · Mathematics 2024-06-05 Gilles Bareilles , Johannes Aspman , Jiri Nemecek , Jakub Marecek

We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…

Logic in Computer Science · Computer Science 2019-07-19 Mario Carneiro