相关论文: Leibniz complexity of Nash functions on differenti…

The non-integrability of the Hill problem makes that its global dynamics must be necessarily approached numerically. However, the analytical approach is feasible in the computation of relevant solutions. In particular, the nonlinear…

We consider the problem of linearizing a pseudo-Boolean function $f : \{0,1\}^n \to \mathbb{R}$ by means of $k$ Boolean functions. Such a linearization yields an integer linear programming formulation with only $k$ auxiliary variables. This…

Mathematical models are sometime given as functions of independent input variables and equations or inequations connecting the input variables. A probabilistic characterization of such models results in treating them as functions with…

In this paper we study the existence and uniqueness of Nash equilibria (solution to competition-wise problems, with several controls trying to reach possibly different goals) associated to linear partial differential equations and show…

Differential operators usually result in derivatives expressed as a ratio of differentials. For all but the simplest derivatives, these ratios are typically not algebraically manipulable, but must be held together as a unit in order to…

We propose a novel foundation for calculus that focuses on the notion of approximations while avoiding the use of limits altogether. Continuity is defined as approximation at a point, while differentiability is defined as approximation with…

In this short note we give some corollaries of the polynomial inverse function theorem for large fields. We prove inverse and implicit function theorems for Nash maps over large fields, characterize large fields as fields satisfying inverse…

The Leibniz algebras appeared as a generalization of the Lie algebras. In this work we deal with the classification of nilpotent complex Leibniz algebras of low dimensions. Namely, the classification of nilpotent complex Leibniz algebras…

I explain a direct approach to differentiation and integration. Instead of relying on the general notions of real numbers, limits and continuity, we treat functions as the primary objects of our theory, and view differentiation as division…

In this article, using only elementary knowledge of complex numbers, we sketch a proof of the celebrated Abel--Ruffini theorem, which states that the general solution to an algebraic equation of degree five or more cannot be written using…

We develop a linear-algebraic framework for dimensional analysis in systems with constraints, particularly when variables are numerous or related by implicit relations so that direct elimination is impractical. By expressing both…

This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…

In this paper we study the Lie algebras of derivations of two-step nilpotent algebras. We obtain a class of Lie algebras with trivial center and abelian ideal of inner derivations. Among these, the relations between the complex and the real…

The class of functions from the integers to the integers computable in polynomial time has been characterized recently using discrete ordinary differential equations (ODE), also known as finite differences. In the framework of ordinary…

Current algorithms for context-free parsing inflict a trade-off between ease of understanding, ease of implementation, theoretical complexity, and practical performance. No algorithm achieves all of these properties simultaneously. Might et…

A characteristic feature of differential-algebraic equations is that one needs to find derivatives of some of their equations with respect to time, as part of so called index reduction or regularisation, to prepare them for numerical…

We prove that, for every complex Hilbert space $H$, every weak-2-local derivation on $B(H)$ or on $K(H)$ is a linear derivation. We also establish that every weak-2-local derivation on an atomic von Neumann algebra or on a compact…

The arithmetic partial derivative (with respect to a prime $p$) is a function from the set of integers that sends $p$ to 1 and satisfies the Leibniz rule. In this paper, we prove that the $p$-adic valuation of the sequence of higher order…

Given a reference computer, Kolmogorov complexity is a well defined function on all binary strings. In the standard approach, however, only the asymptotic properties of such functions are considered because they do not depend on the…

The fractional Leibniz rule is generalized by the Coifman-Meyer estimate. It is shown that the arbitrary redistribution of fractional derivatives for higher order with the corresponding correction terms.