Related papers: Univariate amenable functions

In the present article, we investigate the univalence property of polyanalytic functions and $\log$-$\alpha$-analytic functions. First, by using a new idea, we prove an improved lemma and the coefficient estimates for bounded polyanalytic…

In this paper we consider stable matchings subject to assignment constraints. These are matchings that require certain assigned pairs to be included, insist that some other assigned pairs are not, and, importantly, are stable. Our main…

Modifiable combining functions are a synthesis of two common approaches to combining evidence. They offer many of the advantages of these approaches and avoid some disadvantages. Because they facilitate the acquisition, representation,…

Every one knows that an equation is equivalent to a multivariate function. Generally speaking, there are more than one unknown x in this multivariate function and it is not easy to reduce the number of unknown x to one. In this paper we…

A machine learning model is traditionally considered robust if its prediction remains (almost) constant under input perturbations with small norm. However, real-world tasks like molecular property prediction or point cloud segmentation have…

We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…

We argue that existing definitions of interpretability are not actionable in that they fail to inform users about general, sound, and robust interpretable model design. This makes current interpretability research fundamentally ill-posed.…

An algorithm for computing the stable model semantics of logic programs is developed. It is shown that one can extend the semantics and the algorithm to handle new and more expressive types of rules. Emphasis is placed on the use of…

In several applications such as databases, planning, and sensor networks, parameters such as selectivity, load, or sensed values are known only with some associated uncertainty. The performance of such a system (as captured by some…

We consider some multivariate rational functions which have (or are conjectured to have) only positive coefficients in their series expansion. We consider an operator that preserves positivity of series coefficients, and apply the inverse…

In this paper, we introduce and investigate two new subclasses of analytic functions in the open unit disk in the complex plane. Several interesting properties of the functions belonging to these classes are examined. Here, sufficient, and…

The maximum (or minimum) generalized eigenvalue of symmetric positive semidefinite matrices that depend on optimization variables often appears as objective or constraint functions in structural topology optimization when we consider…

In the present paper, the concepts of module (uniform) approximate amenability and contractibility of Banach algebras that are modules over another Banach algebra, are introduced. The general theory is developed and some hereditary…

Abramov's algorithm enables us to decide whether a univariate rational function can be written as a difference of another rational function, which has been a fundamental algorithm for rational summation. In 2014, Chen and Singer generalized…

We present a principle-based analysis of contribution functions for quantitative bipolar argumentation graphs that quantify the contribution of one argument to another. The introduced principles formalise the intuitions underlying different…

Classic algorithms and machine learning systems like neural networks are both abundant in everyday life. While classic computer science algorithms are suitable for precise execution of exactly defined tasks such as finding the shortest path…

We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…

We study Lebesgue integration of sums of products of globally subanalytic functions and their logarithms, called constructible functions. Our first theorem states that the class of constructible functions is stable under integration. The…

Let E_n={x_i=1, x_i+x_j=x_k, x_i*x_j=x_k: i,j,k \in {1,...,n}}. We prove: (1) there is an algorithm that for every computable function f:N-->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any…

The study of essential and strongly essential variables in functions defined on finite sets is a part of $k$-valued logic. We extend the main definitions from functions to terms. This allows us to apply concepts and results of Universal…