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

The paper aims to investigate the classification problem of low dimensional complex none Lie filiform Leibniz algebras. There are two sources to get classification of filiform Leibniz algebras. The first of them is the naturally graded none…

Derivative of a function can be expressed in terms of integration over a small neighborhood of the point of differentiation, so-called differentiation by integration method. In this text a maximal generalization of existing results which…

In this paper we prove that every irreducible representation of a Leibniz algebra can be obtained from irreducible representations of the semisimple Lie algebra from the Levi decomposition. We also prove that - in general - for (semi)simple…

The paper is devoted to classification problem of finite dimensional complex none Lie filiform Leibniz algebras. Actually, the observations show there are two resources to get classification of filiform Leibniz algebras. The first of them…

In this paper we give a complete classification of the Leibniz algebras of biderivations of right Leibniz algebras of dimension up to three over a field $\mathbb{F}$, with $\operatorname{char}(\mathbb{F})\neq 2$. We describe the main…

We develop a notion of computability and complexity of functions over the reals, which seems to be very natural when one tries to determine just how "difficult" a certain function is. This notion can be viewed as an extension of both BSS…

We report a practical finite-time algorithmic scheme to compute approximately stationary points for nonconvex nonsmooth Lipschitz functions. In particular, we are interested in two kinds of approximate stationarity notions for nonconvex…

In this paper, using the notions of perturbation and contraction of Lie and Leibniz algebras, we show that the algebraic varieties of Leibniz and nilpotent Leibniz algebras of dimension greater than 2 are reducible.

Many possible definitions have been proposed for fractional derivatives and integrals, starting from the classical Riemann-Liouville formula and its generalisations and modifying it by replacing the power function kernel with other kernel…

We know that the Nash equilibria of a game cannot be computed efficiently unless $P = PPAD$. But can they be learned? Are there dynamics that (1) can be computed efficiently by the players at each strategy profile and (2) are guaranteed to…

Using deformations of associative products, derivative nonlinear Schrodinger (DNLS) hierarchies are recovered as AKNS-type hierarchies. Since the latter can also be formulated as Gelfand-Dickey-type Lax hierarchies, a recently developed…

In this paper we construct an entire function of two variables having the property that its values and its partial derivatives of any order at any distinct algebraic points are algebraically independent. Such an entire function is generated…

We comment on recent results in the field of information based complexity, which state (in a number of different settings), that approximation of infinitely differentiable functions is intractable and suffers from the curse of…

This paper aims to develop a theory for linear-quadratic Nash systems and Master equations in possibly infinite-dimensional Hilbert spaces. As a first step and motivated by the recent results in [31], we study a more general model in the…

Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…

A new method is presented for obtaining indefinite integrals of common special functions. The approach is based on a Lagrangian formulation of the general homogeneous linear ordinary differential equation of second order. A general integral…

Let d be a positive integer. We show a finiteness theorem for semialgebraic RL triviality of a Nash family of Nash functions defined on a Nash manifold, generalising Benedetti-Shiota's finiteness theorem for semialgebraic RL equivalence…

We study the problem of computing minimal distinguishing formulas for non-bisimilar states in finite LTSs. We show that this is NP-hard if the size of the formula must be minimal. Similarly, the existence of a short distinguishing trace is…

Recently, the authors Khalil, R., Al Horani, M., Yousef. A. and Sababheh, M., in " A new Denition Of Fractional Derivative, J. Comput. Appl. Math. 264. pp. 6570, 2014. " introduced a new simple well-behaved definition of the fractional…

We consider the behaviour of holomorphic functions on a bounded open subset of the plane, satisfying a Lipschitz condition with exponent $\alpha$, with $0<\alpha<1$, in the vicinity of an exceptional boundary point where all such functions…