Related papers: On Some Classes of Functions and Hypercubes

In a previous paper, a tableau calculus has been presented, which constitute a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work extends such a calculus to multi-modal…

Building upon the dynamic programming principle for set-valued functions arising from many applications, in this paper we propose a new notion of set-valued PDEs. The key component in the theory is a set-valued It\^{o} formula,…

We propose three kinds of explicit formulas for the elliptic lambda function by the elliptic modular function. Further, we derive incredible cubic identities as a corollary of our explicit formulas and evaluate some singular values of the…

In this paper, we establish some new inequalities for class of SX(h,I) convex functions which are supermultiplicative or superadditive and nonnegative. And we also give some applications for special means.

A function that is analytic on a domain of $\mathbb{C}^n$ is holonomic if it is the solution to a holonomic system of linear homogeneous differential equations with polynomial coefficients. We define and study the Bernstein-Sato polynomial…

We propose an integration of possibility theory into non-classical logics. We obtain many formal results that generalize the case where possibility and necessity functions are based on classical logic. We show how useful such an approach is…

In this work we derive a functional equation in terms of the Hurwitz-Lerch zeta function along with definite integrals in terms of the incomplete gamma and Hurwitz-Lerch zeta functions. The method used in these derivations is contour…

As a continuation of the authors and Wakatsuki's previous paper [5], we study relations among Dirichlet series whose coefficients are class numbers of binary cubic forms. We show that for any integral models of the space of binary cubic…

In this paper we show how the superquadratic functions can be used as a tool for researching other types of convex functions like $\phi $-convexity, strong-convexity and uniform convexity. We show how to use inequalities satisfied by…

We introduce a natural class of functions, the {\em pseudomultipliers}, associated with a general Hilbert function space, prove an extension theorem which justifies the definition, give numerous examples and establish the nature of the…

Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed with the direct sum and product, functional digraphs form a…

In this paper, firstly, we determine the number of sublogics of variable inclusion of an arbitrary finitary logic L with partition function. Then, we investigate their position into the lattice of consequence relations over the language of…

Functional logic languages can solve equations over user-defined data and functions. Thus, the definition of an appropriate meaning of equality has a long history in these languages, ranging from reflexive equality in early equational logic…

Inspired by the trend on unifying theories of programming, this paper shows how the algebraic treatment of standard data dependency theory equips relational data with functional types and an associated type system which is useful for type…

In a recent paper, Adamchik [V.S. Adamchik, On the Hurwitz function for rational arguments, Appl. Math. Comp. 187 (2007) 3--12] expressed in a closed form symbolic derivatives of four functions belonging to the class of functions whose…

Determining functionals are tools to describe the finite dimensional long-term dynamics of infinite dimensional dynamical systems. There also exist several applications to infinite dimensional {\em random} dynamical systems. In these…

The functional calculus of semigroup generators, based on the class of Bernstein functions in several variables is developed, the condition for holomorphy of semigroups, generated by operators which arisen in the calculus is given, and in…

Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…

Integrating functions on discrete domains into neural networks is key to developing their capability to reason about discrete objects. But, discrete domains are (1) not naturally amenable to gradient-based optimization, and (2) incompatible…

We show that discrete exponentials form a basis of discrete holomorphic functions. On a convex, the discrete polynomials form a basis as well.