Generalized Maiorana–McFarland class and normality of p-ary bent functions

A class of bent functions which contains bent functions with various properties like regular, weakly regular and not weakly regular bent functions in even and in odd dimension, is analyzed. It is shown that this class includes the Maiorana–McFarland class as a special case. Known classes and examples of bent functions in odd characteristic are examined for their relation to this class. In the second part, normality for bent functions in odd characteristic is analyzed. It turns out that differently to Boolean bent functions, many – also quadratic – bent functions in odd characteristic and even dimension are not normal. It is shown that regular Coulter–Matthews bent functions are normal.     

Strongly precontinuous functions

Summary We introduce a new class of functions called strongly precontinuous functions in topological spaces. Some properties and several characterizations of this type of functions are obtained. We investigate the relationships between this class of functions and other classes of non-continuous functions.     

A generalization of a class of close-to-convex functions

We consider a class of functions, including the Bazilevich functions, which are regular in the unit disk. The theorems of Levandovskii identifying the class of close-to-convex functions with the class of linearly accessible functions are generalized, and the geometric structure of this class is established. A method constructing a subordinating homotopy chain is used.Translated from Matematicheskie Zametki, Vol. 11, No. 5, pp. 509–516, May, 1972.     

A new class of complementarity functions for symmetric cone complementarity problems

A popular approach to solving the complementarity problem is to reformulate it as an equivalent equation system via a complementarity function. In this paper, we propose a new class of functions, which contains the penalized natural residual function and the penalized Fischer–Burmeister function for symmetric cone complementarity problems. We show that this class of functions is indeed a class of complementarity functions. We finally prove that the merit function of this new class of complementarity functions is coercive.     

Bent and generalized bent Boolean functions

In this paper, we investigate the properties of generalized bent functions defined on ${\mathbb{Z}_2^n}$ with values in ${\mathbb{Z}_q}$ , where q ≥ 2 is any positive integer. We characterize the class of generalized bent functions symmetric with respect to two variables, provide analogues of Maiorana–McFarland type bent functions and Dillon’s functions in the generalized set up. A class of bent functions called generalized spreads is introduced and we show that it contains all Dillon type generalized bent functions and Maiorana–McFarland type generalized bent functions. Thus, unification of two different types of generalized bent functions is achieved. The crosscorrelation spectrum of generalized Dillon type bent functions is also characterized. We further characterize generalized bent Boolean functions defined on ${\mathbb{Z}_2^n}$ with values in ${\mathbb{Z}_4}$ and ${\mathbb{Z}_8}$ . Moreover, we propose several constructions of such generalized bent functions for both n even and n odd.     

Radiant Separation Theorems and Minimum-Type Subdifferentials of Calm Functions

Applying minimum-type functions and plus-cogauges, we construct a closed, convex cone in order to separate a boundary point of a radiant set from its interior. Abstract convexity of positively homogeneous functions is studied as well. Since a locally Lipschitz function is degree-one calm, the class of degree-one calm functions is large. We study degree-one calm functions and investigate how these functions can be generated by a class of min-type functions. Then, we derive a method to find an element of the subdifferential of a non-negative, lower semicontinuous and degree-one calm function with respect to the class of min-type functions.     

在仿射等价类中找具有好的密码学性质的布尔函数

The Boolean functions in an affine equivalence class are of the same algebraic degree and nonlinearity, but may satisfy different order of correlation immunity and propagation criterion. A method is presented in this paper to find Boolean functions with higher order correlation immunity or satisfying higher order propagation criterion in an affine equivalence class. 8 AES s-box functions are not better Boolean functions in their affine equivalence class.     

On information functions and their polars

LetP be a closed convex cone. Information functions, i.e., nonnegative functions onP which are positively homogeneous and concave, are shown to be in a one-to-one correspondence with certain convex subsets ofP. Information functions are always isotone with respect to the vector ordering induced byP, and this order-preserving property distinguishes them from their convex analogues, gauge functions. A polarity concept for information functions is proposed which slightly deviates from the well-known polarity correspondence for gauge functions. Finally, those functions are characterized which differ from information functions only by some nondecreasing concave transformation.     

On Optimization Properties of Functions, with a Concave Minorant

We give a definition of the class of functions with a concave minorant and compare these functions with other classes of functions often used in global optimization, e.g. weakly convex functions, d.c. functions, Lipschitzian functions, continuous and lower semicontinuous functions. It is shown that the class of functions with a concave minorant is closed under operations mainly used in optimization and how a concave minorant can be constructed for a given function.     

Near-Subconvexlikeness in Vector Optimization with Set-Valued Functions

A new class of generalized convex set-valued functions, termed nearly-subconvexlike functions, is introduced. This class is a generalization of cone-subconvexlike maps, nearly-convexlike set-valued functions, and preinvex set-valued functions. Properties for the nearly-subconvexlike functions are derived and a theorem of the alternative is proved. A Lagrangian multiplier theorem is established and two scalarization theorems are obtained for vector optimization.     

A class of Nevanlinna functions related to singular Sturm-Liouville problems

The class of Nevanlinna functions consists of functions which are holomorphic off the real axis, which are symmetric with respect to the real axis, and whose imaginary part is nonnegative in the upper halfplane. The Kac subclass of Nevanlinna functions is defined by an integrability condition on the imaginary part. In this note a further subclass of these Kac functions is introduced. It involves an integrability condition on the modulus of the Nevanlinna functions (instead of the imaginary part). The characteristic properties of this class are investigated. The definition of the new class is motivated by the fact that the Titchmarsh-Weyl coefficients of various classes of Sturm-Liouville problems (under mild conditions on the coefficients) actually belong to this class.

     

Beyond Convex? Global Optimization is Feasible Only for Convex Objective Functions: A Theorem

It is known that there are feasible algorithms for minimizing convex functions, and that for general functions, global minimization is a difficult (NP-hard) problem. It is reasonable to ask whether there exists a class of functions that is larger than the class of all convex functions for which we can still solve the corresponding minimization problems feasibly. In this paper, we prove, in essence, that no such more general class exists. In other words, we prove that global optimization is always feasible only for convex objective functions.     

Jensen inequalities for <Emphasis Type="Italic">P</Emphasis>-class functions

In this paper, we first give some characterizations for P-class functions. Then giving a Hermite–Hadamard type inequality for P-class functions, we prove equivalency of some significant metrics in normed linear spaces. We also obtain an operator version of the Jensen inequality for P-class functions. Introducing operator (mid) P-class functions, we present some characterizations for such functions.     

High-order Schwarz-Pick Lemma for the Schur class on the polydisc

In this paper, we give Schwarz-Pick Lemma for functions in the Schur class on the polydisc of ? ⁿ , and generalize some early work of Schwarz-Pick Lemma for functions in the Schur class on the unit disk of C and functions in the Schur-Agler class on the polydisc of ? ⁿ .     

The asymptotically best method for synthesizing limited-depth Boolean recursive schemes

A model of limited-depth recursive schemes for the functions of Boolean algebra (Boolean functions), constructed from multi-output functional elements, is considered. A lower estimate of the Shannon function for the complexity of schemes of this class is derived. Upper estimates for the complexity of some specific functions and systems of functions in this class of schemes are obtained. A method is proposed for synthesizing schemes of this class for arbitrary functions that allow us (using the derived lower estimate) to determine the asymptotics of the Shannon function for their complexity.     

Some new inequalities in geometry and analysis

The paper announces some new inequalities that refer to broken lines, curves and real and complex functions. Their derivation is based on a new principle of angles and lengths for curves. The inequality in the complex analysis, called the principle of derivatives, is valid for analytic functions in arbitrary domains and extends to a broad class of sufficiently smooth complex functions. A new inequality follows for real functions of two variables concerning their level sets. For all cases mentioned above, both for curves and functions, we obtain some analogues of the second fundamental theorem in Nevanlinna theory of meromorphic functions. At the end we discuss a new point-domain inequality dealing with finite point sets in an arbitrary domain.     

Penalty function theory for general convex programming problems

A class of penalty functions for solving convex programming problems with general constraint sets is considered. Convergence theorems for penalty methods are established by utilizing the concept of infimal convergence of a sequence of functions. It is shown that most existing penalty functions are included in our class of penalty functions.     

B-vex functions

A class of functions, called b-vex functions, is introduced by relaxing the definition of convexity of a function. Both the differentiable and nondifferentiable cases are presented. Members of this class satisfy most of the basic properties of convex functions. This class forms a subset of the sets of both semistrictly quasiconvex as well as quasiconvex functions, but are not necessarily included in the class of preinvex functions.The first author is thankful to the Natural Science and Engineering Research Council of Canada for financial support through Grant A-5319. The authors are also grateful to an anonymous referee for the constructive criticism of the first version of the paper, to Dr. Collen Knickerbocker of St. Lawrence University, and to Mrs. Meena K. Bector for their help in sharpening Examples 2.1 and 2.2, respectively.     

Almost subadditive weight functions form Braun-Meise-Taylor theory of ultradistributions

As it is known, Roumieu-Komatsu theory of ultradistributions is strictly larger than Beurling-Björck one and that the latter theory is established by the class of all subadditive weight functions. In its own turn, Roumieu-Komatsu theory is equivalent to Braun-Meise-Taylor one which is given by the class of all weight functions. We prove that the class of all almost subadditive weight functions forms Braun-Meise-Taylor theory of ultradistributions.