Related papers: Leibniz complexity of Nash functions on differenti…
In this paper, using the tools from the lineability theory, we distinguish certain subsets of $p$-adic differentiable functions. Specifically, we show that the following sets of functions are large enough to contain an infinite dimensional…
The present article is an extended version of [6] containing new results and an updated list of references. We review the notion of polar analyticity introduced in a previous paper and succesfully applied in Mellin analysis and quadrature…
The theory of fractional calculus has developed in a number of directions over the years, including: the formulation of multiple different definitions of fractional differintegration; the extension of various properties of standard calculus…
We study the derivational complexity induced by the dependency pair method, enhanced with standard refinements. We obtain upper bounds on the derivational complexity induced by the dependency pair method in terms of the derivational…
In this paper we investigate pre-derivations of filiform Leibniz algebras. Recall that the set of filiform Leibniz algebras of fixed dimension can be decomposed into three non-intersected families. We describe the pre-derivation of filiform…
We construct a complex entire function with arbitrary number of variables which has the following property: The infinite set consisting of all the values of all its partial derivatives of any orders at all algebraic points, including zero…
We say that a function is rare-case hard against a given class of algorithms (the adversary) if all algorithms in the class can compute the function only on an $o(1)$-fraction of instances of size $n$ for large enough $n$. Starting from any…
The main purpose of this work is to characterize derivations through functional equations. This work consists of five chapters. In the first one, we summarize the most important notions and results from the theory of functional equations.…
This paper presents a graded hierarchy or chain of binary operations on the reals and the complex numbers. The operations are related distributively in the sense that any one of them distributes over the next lower operation in the chain.…
In this paper we show that the method for describing solvable Lie algebras with given nilradical by means of non-nilpotent outer derivations of the nilradical is also applicable to the case of Leibniz algebras. Using this method we extend…
The classical Hahn-Banach theorem is based on a successive point-by-point procedure of extending bounded linear functionals. In the setting of a general metric domain, the conditions are less restrictive and the extension is only required…
In this paper we investigate the derivations of filiform Leibniz algebras. Recall that the set of filiform Leibniz algebras of fixed dimension is decomposed into three non-intersected families. We found sufficient conditions under which…
We study dynamic minimization problems of the calculus of variations with Lagrangian functionals containing Riemann-Liouville fractional integrals, classical and Caputo fractional derivatives. Under assumptions of regularity, coercivity and…
Classical complexity theory measures the cost of computing a function, but many computational tasks require committing to one valid output among several. We introduce determination depth -- the minimum number of sequential layers of…
In the first part of this paper we establish, in terms of so called k-tangential sets, a kind of optimal estimate for the size and structure of the set of non-differentiability of Lipshitz functions with one-sided directional derivatives.…
The goal of this paper is to describe the structure of finite-dimensional semi-simple Leibniz algebras in characteristic zero. Our main tool in this endeavor are hemi-semidirect products. One of the major results of this paper is a…
The existence of string functions, which are not polynomial time computable, but whose graph is checkable in polynomial time, is a basic assumption in cryptography. We prove that in the framework of algebraic complexity, there are no such…
Given a computable sequence of natural numbers, it is a natural task to find a G\"odel number of a program that generates this sequence. It is easy to see that this problem is neither continuous nor computable. In algorithmic learning…
In 2012 Chen and Singer introduced the notion of discrete residues for rational functions as a complete obstruction to rational summability. More explicitly, for a given rational function f(x), there exists a rational function g(x) such…
In the paper we describe the derivations of complex $n$-dimensional naturally graded filiform Leibniz algebras $NGF_1, NGF_2\ \text{and} \ \ NGF_3.$ We show that the dimension of the derivation algebras of $NGF_1$ and $NGF_2$ equals $n+1$…