Related papers: A Leibniz/NSA comparison
An existing solvability result for relaxed one-sided Lipschitz algebraic inclusions is substantially improved. This enhanced solvability result allows the design of a very robust numerical method for the approximation of a solution of the…
We describe stochastic Newton and stochastic quasi-Newton approaches to efficiently solve large linear least-squares problems where the very large data sets present a significant computational burden (e.g., the size may exceed computer…
We show that for real Banach spaces that are either separable or dual spaces, the Lipschitz numerical index coincides with the classical (linear) numerical index. This result provides partial evidence toward the question posed by Wang,…
The quasi-Newton equation is the very basis of a variety of the quasi-Newton methods. By using a relationship formula between nonlinear polynomial equations and the corresponding Jacobian matrix. presented recently by the present author, we…
In the present article, we extend the fragment of inductive formulas for the hybrid language L(@) in [8] including a McKinsey-like formula, and show that every formula in the extended class has a first-order correspondent, by modifying the…
We show some applications of the formulas-as-polynomials correspondence: 1) a method for (dis)proving formula isomorphism and equivalence based on showing (in)equality; 2) a constructive analogue of the arithmetical hierarchy, based on the…
We present a short proof of a conjecture proposed by I. Ra\c{s}a (2017), which is an inequality involving basic Bernstein polynomials and convex functions. This proof was given in the letter to I. Ra\c{s}a (2017). The methods of our proof…
In 2007, A.I.Aptekarev and his collaborators discovered a sequence of rational approximations to Euler's constant $\gamma$ defined by a linear recurrence. In this paper, we generalize this result and present an explicit construction of…
In recent years, there has been a surge of interest in studying different ways to reformulate nonconvex optimization problems, especially those that involve binary variables. This interest surge is due to advancements in computing…
Bernays introduced a method for proving underivability results in propositional calculi by truth tables. In general, this motivates an investigations of how to find, given a propositional logic, a finite-valued logic which has as few…
The parametric representation has been used since a long time for the evaluation of Feynman diagrams. As a dimension independent intermediate representation, it allows a clear description of singularities. Recently, it has become a choice…
We extend the classification of solvable Lie algebras with abelian nilradicals to classify solvable Leibniz algebras which are one dimensional extensions of an abelian nilradicals.
We present straightforward proofs of estimates used in the adiabatic approximation. The gap dependence is analyzed explicitly. We apply the result to interpolating Hamiltonians of interest in quantum computing.
The paper studies the structure of restricted Leibniz algebras. More specifically speaking, we first give the equivalent definition of restricted Leibniz algebras, which is by far more tractable than that of a restricted Leibniz algebras in…
It was claimed recently that a low order post-Newtonian (PN) Lagrangian formulation, which corresponds to the Euler-Lagrange equations up to an infinite PN order, can be identical to a PN Hamiltonian formulation at the infinite order from a…
Based on the structure of Fibonacci sequence, we give a new proof for the irrationality exponents of the Fibonacci real numbers. Moreover, we obtain all the irrationality exponents of the real numbers corresponding to the differences of…
We show a correspondence between a classification of maximal abelian sub-algebras (MASAs) proposed by Jacques Dixmier and fragments of linear logic. We expose for this purpose a modified construction of Girard's hyperfinite geometry of…
We make an experimental comparison of methods for computing the numerical radius of an $n\times n$ complex matrix, based on two well-known characterizations, the first a nonconvex optimization problem in one real variable and the second a…
A few formulas and theorems for statistical structures are proved. They deal with various curvatures as well as with metric properties of the cubic form or its covariant derivative. Some of them generalize formulas and theorems known in the…
The notion of Leibniz algebroid is introduced, and it is shown that each Nambu-Poisson manifold has associated a canonical Leibniz algebroid. This fact permits to define the modular class of a Nambu-Poisson manifold as an appropiate…