相关论文: On a total function which overtakes all total recu…
Aggregation functions are widely used in answer set programming for representing and reasoning on knowledge involving sets of objects collectively. Current implementations simplify the structure of programs in order to optimize the overall…
Motivated by the study of the distribution of zeros of generalized Bessel-type functions, the principal goal of this paper is to identify new research directions in the theory of multiplier sequences. The investigations focus on multiplier…
In this paper we consider two hierarchies of hereditarily total and continuous functionals over the reals based on one extensional and one intensional representation of real numbers, and we discuss under which asumptions these hierarchies…
We prove the existence of entire functions that achieve universal approximations on certain countable sequences of translation operators .
In order to prove that the P of problems is different to the NP class, we consider the satisfability problem of propositional calculus formulae, which is an NP-complete problem. It is shown that, for every search algorithm A, there is a set…
In this article, we discuss the question of whether P equals NP, we do not follow the line of research of many researchers, which is to try to find such a problem Q, and the problem Q belongs to the class of NP-complete, if the problem Q is…
We investigate random compact sets with random functions defined thereon, such as polynomials, rational functions, the pluricomplex Green function and the Siciak extremal function. One surprising consequence of our study is that randomness…
In this exploratory article, we draw attention to the common formal ground among various estimators such as the belief functions of evidence theory and their relatives, approximation quality of rough set theory, and contextual probability.…
We give a number of theoretical and practical methods related to the computation of L-functions, both in the local case (counting points on varieties over finite fields, involving in particular a detailed study of Gauss and Jacobi sums),…
In the first part of this paper, we express the generalized Bessel function associated with dihedral systems and a constant multiplicity function as a infinite series of confluent Horn functions. The key ingredient leading to this…
We generalize first-species counterpoint theory to arbitrary rings and obtain some new counting and maximization results that enrich the theory of admitted successors, pointing to a structural approach, beyond computations. The…
We adapt (over $\mathbb{F}_2$) the general notions of multiplicative function, Dirichlet convolution and Inverse. We get some interesting results, namely necessary conditions for an odd binary polynomial to be perfect. Note that we are…
We study the question of whether every P set has an easy (i.e., polynomial-time computable) census function. We characterize this question in terms of unlikely collapses of language and function classes such as the containment of #P_1 in…
In the present paper, we generalize the well-known Hensel's lifting lemma to any continuous function $f : \mathbb{Z}_p\rightarrow \mathbb{Z}_p$. This answers a question posed by Axelsson and Khrennikov (2016) who showed the validity of…
The results presented in this paper are refinements of some results presented in a previous paper. Three such refined results are presented. The first one relaxes one of the basic hypotheses assumed in the previous paper, and thus extends…
In this paper we are concerned with a Gordan-type theorem involving an arbitrary number of inequality functions. We not only state its validity under a weak convexity assumption on the functions, but also show it is an optimal result. We…
In this paper, we discuss an alternative approach to determine an asymptotic equivalent of the partial sum of the reciprocals of prime numbers. This well-known result, related to Merten's second theorem, is usually derived through methods…
We establish formulas for the number of all downsets (or equivalently, of all antichains) of a finite poset P. Then, using these numbers, we determine recursively and explicitly the number of all posets having a fixed set of minimal points…
We study inverse factorial series and their relation to Stirling numbers of the first kind. We prove a special representation of the polylogarithm function in terms of series with such numbers. Using various identities for Stirling numbers…
A new interpretation of zeta functions is given for F1-schemes which do not satisfy Soul\'e's condition. Functional equations for reductive groups are computed and a new definition of zeta functions attached to more general counting…