English
Related papers

Related papers: A ridiculously simple and explicit implicit functi…

200 papers

We consider a general class of parametrized displacement boundary value problems in incompressible nonlinear elasticity. We prove the existence of an unbounded solution branch of classical injective solutions emanating from the unforced…

Analysis of PDEs · Mathematics 2018-12-26 Timothy J. Healey

In studying the complex H\'enon maps, Mummert (in "Holomorphic shadowing for H\'enon maps" Nonlinearity 21 pp. 2887-2898, 2008) defined an operator the fixed points of which give rise to bounded orbits. This enabled him to obtain an…

Dynamical Systems · Mathematics 2022-03-08 Yi-Chiuan Chen

In view of training increasingly complex learning architectures, we establish a nonsmooth implicit function theorem with an operational calculus. Our result applies to most practical problems (i.e., definable problems) provided that a…

Machine Learning · Computer Science 2022-04-06 Jérôme Bolte , Tam Le , Edouard Pauwels , Antonio Silveti-Falls

We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…

Optimization and Control · Mathematics 2021-03-18 Pedro Felzenszwalb , Caroline Klivans , Alice Paul

We prove an implicit function theorem for non-commutative functions. We use this to show that if $p(X,Y)$ is a generic non-commuting polynomial in two variables, and $X$ is a generic matrix, then all solutions $Y$ of $p(X,Y)=0$ will commute…

Algebraic Geometry · Mathematics 2014-04-25 Jim Agler , John E. McCarthy

An exact representation of the Baker-Campbell-Hausdorff formula as a power series in just one of the two variables is constructed. Closed form coefficients of this series are found in terms of hyperbolic functions, which contain all of the…

Mathematical Physics · Physics 2018-07-23 Jordan C. Moodie , Martin W. Long

In this paper we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalize the corresponding properties of the class of feasible functions. We also improve the Kapron - Cook…

Logic in Computer Science · Computer Science 2007-05-23 Aleksandar Ignjatovic , Arun Sharma

Any rational number can be factored into a product of several rationals whose sum vanishes. This simple but nontrivial fact was suggested as a problem on a maths olympiad for high-school students. We completely solve similar questions in…

Rings and Algebras · Mathematics 2020-07-20 Anton A. Klyachko , Anton N. Vassilyev

We consider constrained Horn clause solving from the more general point of view of solving formula equations. Constrained Horn clauses correspond to the subclass of Horn formula equations. We state and prove a fixed-point theorem for Horn…

Logic in Computer Science · Computer Science 2021-09-13 Stefan Hetzl , Johannes Kloibhofer

The central purpose of this article is to establish new inverse and implicit function theorems for differentiable maps with isolated critical points. One of the key ingredients is a discovery of the fact that differentiable maps with…

Classical Analysis and ODEs · Mathematics 2021-04-02 Liangpan Li

The Lagrange inversion formula for power series is one of the classical formulas from analysis and combinatorics. A nice geometric interpretation of this formula in terms of the Stasheff polytopes was discovered by Loday. We show that it…

Algebraic Geometry · Mathematics 2026-04-09 Victor M. Buchstaber , Alexander P. Veselov

Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…

Computational Physics · Physics 2007-05-23 C. Semay

New third- and fourth-order Lagrangian hierarchies are derived in this paper. The free coefficients in the leading terms satisfy the most general differential geometric criteria currently known for the existence of a variational…

Pattern Formation and Solitons · Physics 2022-06-01 S. Roy Choudhury , Ranses Alfonso-Rodriguez

We give a new elementary proof of the following theorem: if all critical points of a rational function g belong to the real line then there exists a fractional linear transformation L such that L(g) is a real rational function. Then we…

Algebraic Geometry · Mathematics 2012-02-07 Alexandre Eremenko , Andrei Gabrielov

We propose an implicit iterative algorithm for an exact penalty method arising from inequality constrained optimization problems. A rapidly convergent fixed point method is developed for a regularized penalty functional. The applicability…

Optimization and Control · Mathematics 2012-10-05 Kazufumi Ito , Tomoya Takeuchi

For multi-valued functions---such as when the conditional distribution on targets given the inputs is multi-modal---standard regression approaches are not always desirable because they provide the conditional mean. Modal regression…

Machine Learning · Statistics 2020-10-30 Yangchen Pan , Ehsan Imani , Martha White , Amir-massoud Farahmand

In this paper we present an algorithm to find the discrete Lagrangian for an autonomous recurrence relation of arbitrary even order $2k$ with $k>1$. The method is based on the existence of a set of differential operators called annihilation…

Mathematical Physics · Physics 2019-10-28 G. Gubbiotti

There is proposed the Maillet--Malgrange type theorem for a generalized power series (having complex power exponents) formally satisfying an algebraic ordinary differential equation. The theorem describes the growth of the series…

Classical Analysis and ODEs · Mathematics 2018-04-30 Renat Gontsov , Irina Goryuchkina

In this paper we present a generalization of Faulhaber's formula to sums of arbitrary complex powers $m\in\mathbb{C}$. These summation formulas for sums of the form $\sum_{k=1}^{\lfloor x\rfloor}k^{m}$ and $\sum_{k=1}^{n}k^{m}$, where…

Number Theory · Mathematics 2021-03-16 Raphael Schumacher

We argue that reducing nonlinear programming problems to a simple canonical form is an effective way to analyze them, specially when the problem is degenerate and the usual linear independence hypothesis does not hold. To illustrate this…

Optimization and Control · Mathematics 2018-04-02 Walter F. Mascarenhas