Alternative Characterization of the Class k-UCV and Related Classes of Univalent Functions

In this paper an alternative characterization of the class of functions called k -uniformly convex is found. Various relations concerning connections with other classes of univalent functions are given. Moreover a new class of univalent functions, analogous to the ’Mocanu class’ of functions, is introduced. Some results concerning this class are derived.

First Order Characterizations of Pseudoconvex Functions

First order characterizations of pseudoconvex functions are investigated in terms of generalized directional derivatives. A connection with the invexity is analysed. Well-known first order characterizations of the solution sets of pseudolinear programs are generalized to the case of pseudoconvex programs. The concepts of pseudoconvexity and invexity do not depend on a single definition of the generalized directional derivative.

On the Quality of Decision Functions in Pattern Recognition

The problem of decision functions quality in pattern recognition is considered. An overview of the approaches to the solution of this problem is given. Within the Bayesian framework, we suggest an approach based on the Bayesian interval estimates of quality on a finite set of events.

Decomposition of Boolean Functions – Recognizing a Good Solution by Traces

The problem of sequent two-block decomposition of a Boolean function is regarded in case when a good solution does exist. The problem consists mainly in finding an appropriate weak partition on the set of arguments of the considered Boolean function, which should be decomposable at that partition. A new fast heuristic combinatorial algorithm is offered for solving this task. At first the randomized search for traces of such a partition is fulfilled. The recognized traces are represented by some "triads" - the simplest weak partitions corresponding to non-trivial decompositions. After that the whole sought-for partition is restored from the discovered trace by building a track initialized by the trace and leading to the solution. The results of computer experiments testify the high practical efficiency of the algorithm.

On Two Saigo’s Fractional Integral Operators in the Class of Univalent Functions

2000 Mathematics Subject Classification: Primary 26A33, 30C45; Secondary 33A35

On Integral Means for Fractional Calculus Operators of Multivalent Functions

2000 Mathematics Subject Classification: Primary 30C45, Secondary 26A33, 30C80

Inclusion Properties for Certain Classes of Analytic Functions Involving a Family of Fractional Integral Operators

2000 Math. Subject Classification: 30C45

On Li’s Coefficients for Some Classes of L-Functions

AMS Subj. Classification: 11M41, 11M26, 11S40

Fractional Integration of the Product of Bessel Functions of the First Kind

Dedicated to 75th birthday of Prof. A.M. Mathai, Mathematical Subject Classification 2010:26A33, 33C10, 33C20, 33C50, 33C60, 26A09

Some Notes about a Class of Univalent Functions with Negative Coefficients

MSC 2010: 30C45, 30C50

Note on Radius Problems for Certain Class of Analytic Functions

MSC 2010: 30C45

Triangular Models and Asymptotics of Continuous Curves with Bounded and Unbounded Semigroup Generators

2000 Mathematics Subject Classification: Primary 47A48, Secondary 60G12.

On a Class of Univalent Functions with Negative Coefficients

Донка Пашкулева - Предмет на тази статия е получаването на точни оценки за коефициентите и ръста на функциите за някои класове еднолистни функции с отрицателни коефициенти.

Calculating the derivative of piecewise functions

Exercises involving the calculation of the derivative of piecewise defined functions are common in calculus, with the aim of consolidating beginners’ knowledge of applying the definition of the derivative. In such exercises, the piecewise function is commonly made up of two smooth pieces joined together at one point. A strategy which avoids using the definition of the derivative is to find the derivative function of each smooth piece and check whether these functions agree at the chosen point. Showing that this strategy works together with investigating discontinuities of the derivative is usually beyond a calculus course. However, we shall show that elementary arguments can be used to clarify the calculation and behaviour of the derivative for piecewise functions.

On some Properties of Boolean Functions and Their Binary Decision Diagrams

Иво Й. Дамянов - Манипулирането на булеви функции е основнo за теоретичната информатика, в това число логическата оптимизация, валидирането и синтеза на схеми. В тази статия се разглеждат някои първоначални резултати относно връзката между граф-базираното представяне на булевите функции и свойствата на техните променливи.