Related papers: A Leibniz/NSA comparison
A recently developed computational methodology for executing numerical calculations with infinities and infinitesimals is described in this paper. The developed approach has a pronounced applied character and is based on the principle `The…
We compare the second adjoint and trivial Leibniz cohomology spaces of a Lie algebra to the usual ones by a very elementary approach. The comparison gives some conditions, which are easy to verify for a given Lie algebra, for deciding…
Using recently developed algorithms, we compute and compare best $L^2$ and $L^\infty$ rational approximations of analytic functions on the unit disk. Although there is some theory for these problems going back decades, this may be the first…
We study the bilinear estimates in the Sobolev spaces with the Dirichlet and the Neumann boundary condition. The optimal regularity is revealed to get such estimates in the half space case, which is related to not only smoothness of…
In the following article we consider approximate Bayesian computation (ABC) for certain classes of time series models. In particular, we focus upon scenarios where the likelihoods of the observations and parameter are intractable, by which…
We study the capability property of Leibniz algebras via the non-abelian exterior product.
Alternative gravitational theories described by Lagrangians depending on general functions of the Ricci scalar have been proven to give coherent theoretical models to describe the experimental evidence of the acceleration of universe at…
Transcendental functions, such as exponentials and logarithms, appear in a broad array of computational domains: from simulations in curvilinear coordinates, to interpolation, to machine learning. Unfortunately they are typically expensive…
We consider various inequalities for polynomials, with an emphasis on the most fundamental inequalities of approximation theory. In the sequel a key role is played by the generalized Minkowski functional \alpha(K,x), already being used by…
In this paper, we study compatible Leibniz algebras. We characterize compatible Leibniz algebras in terms of Maurer-Cartan elements of a suitable differential graded Lie algebra. We define a cohomology theory of compatible Leibniz algebras…
Bayesian inference for complex models with an intractable likelihood can be tackled using algorithms performing many calls to computer simulators. These approaches are collectively known as "simulation-based inference" (SBI). Recent SBI…
We give a simple proof of a recent result by J. Schleischitz dealing with a counterexample to the uniform Littlewood conjecture. Our construction is based on simple properties of Fibonacci numbers.
It is shown that the $L^\alpha$-norms polynomials Rudin conjecture fails. Our counterexample is inspired by Bourgain's work on NLS. Precisely, his study of the Strichartz's inequality of the $L^6$-norm of the periodic solutions given by the…
Schleischitz [arXiv:1701.01129] determined exponents of best approximations to a strong Liouville number by integer polynomials and algebraic numbers of precribed degree. In this note, we show that we cannot extend his result to arbitrary…
The error or variability of machine learning algorithms is often assessed by repeatedly re-fitting a model with different weighted versions of the observed data. The ubiquitous tools of cross-validation (CV) and the bootstrap are examples…
We compare relativistic approximation methods, which describe gravitational instability in the expanding universe, in a spherically symmetric model. Linear perturbation theory, second-order perturbation theory, relativistic Zel'dovich…
We improve upon an Omega result due to Soundararajan with respect to general trigonometric polynomials having positive Fourier coefficients. Instead of Dirichlet's approximation theorem we employ the resonance method and this leads to…
Leibniz algebras are certain generalization of Lie algebras. In this paper we give classification of non-Lie solvable (left) Leibniz algebras of dimension $\leq 8$ with one dimensional derived subalgebra. We use the canonical forms for the…
Exact and asymptotic formulae are displayed for the coefficients $\lambda_n$ used in Li's criterion for the Riemann Hypothesis. For $n \to \infty$ we obtain that if (and only if) the Hypothesis is true, $\lambda_n \sim n(A \log n +B)$ (with…
We can measure the complexity of a logical formula by counting the number of alternations between existential and universal quantifiers. Suppose that an elementary first-order formula $\varphi$ (in $\mathcal{L}_{\omega,\omega}$) is…