Related papers: On functions with a unique identification minor
A new class of functions with a unique identification minor is introduced: functions determined by content and singletons. Relationships between this class with other known classes of functions with a unique identification minor are…
We investigate the problem whether a function of several arguments can be reconstructed from its identification minors. We focus on functions with a unique identification minor, and we establish some positive and negative results on the…
In this paper, we study uniqueness problems for an entire function that shares small functions of finite order with their difference operators. In particular, we give a generalization of results in [2,3,13].
We investigate uniqueness problems for an entire function that shares two small functions of finite order with their difference operators. In particular, we give a generalization of a result in $[2]$.
In this paper we develop a classification of real functions based on growth rates of repeated iteration. We show how functions are naturally distinguishable when considering inverses of repeated iterations. For example, $n+2\to 2n\to 2^n\to…
We define two natural classes of functions, called 2-open and 2-closed, that are closest to open and closed functions. We show that they have the following property: there are $X_i \subset X$ $ (i=1,2,...$) such that $f|X_i$ are open or…
By using the theory of first-order differential subordination for functions with fixed initial coefficient, several well-known results for subclasses of univalent functions are improved by restricting the functions to have fixed second…
We define two classes of functions, called regular (respectively, first-order) list functions, which manipulate objects such as lists, lists of lists, pairs of lists, lists of pairs of lists, etc. The definition is in the style of regular…
In this note we axiomatize the classes of rudimentary functions, primitive recursive functions, safe recursive set functions, and predicatively computable functions.
Identity theorem for analytic complex functions says that a function is uniquely defined by its values on a set that contains a density point. The paper presents sufficient conditions for classes of real analytic functions that ensures…
In this short article we present some properties regarding the order and the type of an entire function.
A parking function is a function $\pi:[n]\to [n]$ whose $i$th-smallest output is at most $i,$ corresponding to a parking procedure for $n$ cars on a one-way street. We refine this concept by introducing preference-restricted parking…
In this paper, we study a class of functions defined recursively on the set of natural numbers in terms of the greatest common divisor algorithm of two numbers and requiring a minimality condition. These functions are permutations, products…
We study point-separating function sets that are minimal with respect to the property of being separating. We first show that for a compact space $X$ having a minimal separating function set in $C_p(X)$ is equivalent to having a minimal…
In this article, we study some new characterizations of primitive recursive functions based on restricted forms of primitive recursion, improving the pioneering work of R. M. Robinson and M. D. Gladstone in this area. We reduce certain…
Functions with fixed initial coefficient have been widely studied. A new methodology is proposed in this paper by making appropriate modifications and improvements to the theory of second-order differential subordination. Several…
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…
In this paper our aim is to present an elementary proof of an identity of Calogero concerning the zeros of Bessel functions of the first kind. Moreover, by using our elementary approach we present a new identity for the zeros of Bessel…
Finding the minimum and the minimizers of convex functions has been of primary concern in convex analysis since its conception. It is well-known that if a convex function has a minimum, then that minimum is global. The minimizers, however,…
Binary functions are a generalisation of the cocircuit spaces of binary matroids to arbitrary functions. Every rank function is assigned a binary function, and the deletion and contraction operations of binary functions generalise matroid…