Equation f(p(x)) = q(f(x)) for given real functions p, q

We investigate functional equations f(p(x)) = q(f(x)) where p and q are given real functions defined on the set ? of all real numbers. For these investigations, we can use methods for constructions of homomorphisms of mono-unary algebras. Our considerations will be confined to functions p, q which are strictly increasing and continuous on ?. In this case, there is a simple characterization for the existence of a solution of the above equation. First, we give such a characterization. Further, we present a construction of any solution of this equation if some exists. This construction is demonstrated in detail and discussed by means of an example.     

On the best mean square approximations by entire functions of exponential type in L 2(ℝ) and mean ν-widths of some functional classes

We consider some extremal problems of approximation theory of functions on the whole real axis ? by entire functions of the exponential type. In particular, we find the exact values of the mean ν-widths of classes of functions, defined by the modules of continuity of the mth order ω _m and majorants ψ satisfying the special type of restriction.     

Sharp quadrature formulas and inequalities between various metrics for rational functions

We obtain the sharp quadrature formulas for integrals of complex rational functions over circles, segments of the real axis, and the real axis itself. Among them there are formulas for calculating the L₂-norms of rational functions. Using the quadrature formulas for rational functions, in particular, for simple partial fractions and polynomials, we derive some sharp inequalities between various metrics (Nikol’ski?-type inequalities).     

On almost monotonic real functions

The notion of regular subrings of a differential ring is defined. We prove that, for some element y of the ring satisfying certain conditions, the extension R₀[y] of a regular subring R₀ is also a regular subring. As an application, we give some results concerning almost monotonic real functions.     

Lattice Algorithms for Multivariate L ∞ Approximation in the Worst-Case Setting

We approximate d-variate functions from weighted Korobov spaces with the error of approximation defined in the L _∞ sense. We study lattice algorithms and consider the worst-case setting in which the error is defined by its worst-case behavior over the unit ball of the space of functions. A lattice algorithm is specified by a generating (integer) vector. We propose three choices of such vectors, each corresponding to a different search criterion in the component-by-component construction. We present worst-case error bounds that go to zero polynomially with n ^?1, where n is the number of function values used by the lattice algorithm. Under some assumptions on the weights of the function space, the worst-case error bounds are also polynomial in d, in which case we have (polynomial) tractability, or even independent of d, in which case we have strong (polynomial) tractability. We discuss the exponents of n ^?1 and stress that we do not know if these exponents can be improved.     

Enumeration of (p,q)-parking functions

Parking functions are central in many aspects of combinatorics. We define in this communication a generalization of parking functions which we call (p₁,…,p_k)-parking functions. We give a characterization of them in terms of parking functions and we show that they can be interpreted as recurrent configurations in the sandpile model for some graphs. We also establish a correspondence with a Lukasiewicz language, which enables to enumerate (p₁,…,p_k)-parking functions as well as increasing ones.     

Second Order Linear Differential Polynomials and Real Meromorphic Functions

The main result determines all real meromorphic functions f of finite lower order in the plane such that f has finitely many zeros and non-real poles, while f′′ + a ₁ f′ + a ₀ f has finitely many non-real zeros, where a ₁ and a ₀ are real rational functions which satisfy a ₁(∞) = 0 and a ₀(x) ≥ 0 for all real x with |x| sufficiently large. This is accomplished by refining some earlier results on the zeros in a neighbourhood of infinity of meromorphic functions and second order linear differential polynomials. Examples are provided illustrating the results.     

SOME PROPERTIES OF HOLOMORPHIC CLIFFORDIAN FUNCTIONS IN COMPLEX CLIFFORD ANALYSIS

In this article, we mainly develop the foundation of a new function theory of several complex variables with values in a complex Clifford algebra defined on some subdomains of Cn+1, so-called complex holomorphic Cliffordian functions. We define the complex holomorphic Cliffordian functions, study polynomial and singular solutions of the equation D△mf=0, obtain the integral representation formula for the complex holomorphic Cliffordian functions with values in a complex Clifford algebra defined on some submanifolds of Cn+1, deduce the Taylor expansion and the Laurent expansion for them and prove an invariance under an action of Lie group for them.     

Bad normed spaces, convexity properties, separated sets

Some years ago, a parameter-denoted by A₁(X)-was defined in real Banach spaces. In the same setting, several years before, a notion called Q-convexity had been defined. Studying these two notions seems to be rather awkward and up until now this has not been done in deep.Here we indicate some properties and connections between these two parameters and some other related ones, in infinite-dimensional Banach spaces. We also consider another notion, a natural extension of Q-convexity, and we discuss the case when A₁(X) attains its maximum value. The spaces where this happens can be considered as ”bad” since they cannot have several properties which are usually considered as nice (like uniform non-squareness or P-convexity).     

Limiting law results for a class of conditional mode estimates for functional stationary ergodic data

The main purpose of the present work is to establish the functional asymptotic normality of a class of kernel conditional mode estimates when functional stationary ergodic data are considered. More precisely, consider a random variable (X,Z) taking values in some semi-metric abstract space E × F. For a real function φ defined on F and for each x ∈ E, we consider the conditional mode, say ?_φ(x), of the real random variable φ(Z) given the event “X = x”. While estimating the conditional mode function by Θ?_φ,n(x), using the kernel-type estimator, we establish the limiting law of the family of processes {Θ?_φ(x) - Θ_φ(x)} (suitably normalized) over Vapnik–Chervonenkis class C of functions φ. Beyond ergodicity, no other assumption is imposed on the data. This paper extends the scope of some previous results established under mixing condition for a fixed function φ. From this result, the asymptotic normality of a class of predictors is derived and confidence bands are constructed. Finally, a general notion of bootstrapped conditional mode constructed by exchangeably weighting samples is presented. The usefulness of this result will be illustrated in the construction of confidence bands.     

Ergodic transport theory and piecewise analytic subactions for analytic dynamics

We consider a piecewise analytic real expanding map f: [0, 1] ?? [0, 1] of degree d which preserves orientation, and a real analytic positive potential g: [0, 1] ?? ?. We assume the map and the potential have a complex analytic extension to a neighborhood of the interval in the complex plane. We also assume log g is well defined for this extension. It is known in Complex Dynamics that under the above hypothesis, for the given potential ?? log g, where ?? is a real constant, there exists a real analytic eigenfunction ? _?? defined on [0, 1] (with a complex analytic extension) for the Ruelle operator of ?? log g. Under some assumptions we show that $\frac{1} {\beta }\log \varphi _\beta$ converges and is a piecewise analytic calibrated subaction. Our theory can be applied when log g(x) = ?log f??(x). In that case we relate the involution kernel to the so called scaling function.     

A lattice-theoretic approach to arbitrary real functions on frames

In this paper we model discontinuous extended real functions in pointfree topology following a lattice-theoretic approach, in such a way that, if L is a subfit frame, arbitrary extended real functions on L are the elements of the Dedekind-MacNeille completion of the poset of all extended semicontinuous functions on L. This approach mimicks the situation one has with a T₁-space X, where the lattice F?(X) of arbitrary extended real functions on X is the smallest complete lattice containing both extended upper and lower semicontinuous functions on X. Then, we identify real-valued functions by lattice-theoretic means. By construction, we obtain definitions of discontinuous functions that are conservative for T₁-spaces. We also analyze semicontinuity and introduce definitions which are conservative for T₀-spaces.     

Starlikeness and subordination properties of a linear operator

In this paper, we introduce a new class of p-valent analytic functions defined by using a linear operator L_k^α. For functions in this class H_k^α(p,λh) we estimate the coefficients. Furthermore, some subordination properties related to the operator L_k^α are also derived.     

Principal series and generalized principal series Whittaker functions with peripheral K-types on the real symplectic group of rank 2

First, we give some explicit formulas of principal series Whittaker functions on the real symplectic group of rank 2 with arbitrary one-dimensional K-types. These formulas are extension of Ishii??s formulas for Whittaker functions with minimal K-types. Secondly, we compute explicit formulas of the holonomic system for the radial part of Whittaker functions with peripheral K-types belonging to the generalized principal series representations induced from the Siegel maximal parabolic subgroup (i.e., P _S-series). Thirdly, we derive eight power series solutions for our holonomic system utilizing the embedding of the P _S-series into various principal series, from the power series Whittaker functions belonging to the principal series.     

Functions computable by Boolean circuits of logarithmic depth and branching programs of a special type

D. M. Barrington proved the coincidence of the class NC¹ of functions computable by the circuits of logarithmic depth with the class of functions computable by branching programs of constant width and polynomial length (BWBP). In this paper, the structure of branching programs suggested by the Barrington method is defined more exactly. Namely, it is proved that we can compute all functions from NC¹ and only them by the k-OBDDs of polynomial size and width 5. This can be reformulated as poly(n)-OBDD₅ =NC¹.     

Jost maps, ball-homogeneous and harmonic manifolds

Given a real number ε>0, small enough, an associated Jost map J_ε between two Riemannian manifolds is defined. Then we prove that connected Riemannian manifolds for which the center of mass of each small geodesic ball is the center of the ball (i.e. for which the identity is a J_ε map) are ball-homogeneous. In the analytic case we characterize such manifolds in terms of the Euclidean Laplacian and we show that they have constant scalar curvature. Under some restriction on the Ricci curvature we prove that Riemannian analytic manifolds for which the center of mass of each small geodesic ball is the center of the ball are locally and weakly harmonic.     

To the Theory of Sobolev-Type Classes of Functions with Values in a Metric Space

We study some classes of functions with values in a complete metric space which can be considered as analogs of the Sobolev spaces W _p ¹ . Earlier the author considered the case of functions on a domain of ? ⁿ . Here we study the general case of mappings on an arbitrary Lipschitz manifold. We give necessary auxiliary facts, consider some examples, and describe some methods of construction of lower semicontinuous functionals on the classes W _p ¹ (M), where M is a Lipschitz manifold.     

On some extremal problems of approximation theory of functions on the real axis II

The work is devoted to the solution of a number of extremal problems of approximation theory of functions on the real axis $ \mathbb{R} $ . In the space L ₂( $ \mathbb{R} $ ), the exact constants in Jackson-type inequalities are calculated. The exact values of average ν-widths are obtained for the classes of functions from L ₂( $ \mathbb{R} $ ) that are defined by averaged k-order moduli of continuity and for the classes of functions defined by K-functionals. In the chronological order, the sufficiently complete analysis of the final results related to the solution of extremal problems of approximation theory in the periodic case and on the whole real axis is carried out.     

On the Kolmogorov complexity of continuous real functions

Kolmogorov complexity was originally defined for finitely-representable objects. Later, the definition was extended to real numbers based on the asymptotic behaviour of the sequence of the Kolmogorov complexities of the finitely-representable objects—such as rational numbers—used to approximate them.This idea will be taken further here by extending the definition to continuous functions over real numbers, based on the fact that every continuous real function can be represented as the limit of a sequence of finitely-representable enclosures, such as polynomials with rational coefficients.Based on this definition, we will prove that for any growth rate imaginable, there are real functions whose Kolmogorov complexities have higher growth rates. In fact, using the concept of prevalence, we will prove that ‘almost every’ continuous real function has such a high-growth Kolmogorov complexity. An asymptotic bound on the Kolmogorov complexities of total single-valued computable real functions will be presented as well.     

Hyper-bent functions and cyclic codes

Bent functions are those Boolean functions whose Hamming distance to the Reed-Muller code of order 1 equal 2^n-1-2^n/2-1 (where the number n of variables is even). These combinatorial objects, with fascinating properties, are rare. Few constructions are known, and it is difficult to know whether the bent functions they produce are peculiar or not, since no way of generating at random bent functions on 8 variables or more is known.The class of bent functions contains a subclass of functions whose properties are still stronger and whose elements are still rarer. Youssef and Gong have proved the existence of such hyper-bent functions, for every even n. We prove that the hyper-bent functions they exhibit are exactly those elements of the well-known PS_ap class, introduced by Dillon, up to the linear transformations x?δx, . Hyper-bent functions seem still more difficult to generate at random than bent functions; however, by showing that they all can be obtained from some codewords of an extended cyclic code H_n with small dimension, we can enumerate them for up to 10 variables. We study the non-zeroes of H_n and we deduce that the algebraic degree of hyper-bent functions is n/2. We also prove that the functions of class PS_ap are some codewords of weight 2^n-1-2^n/2-1 of a subcode of H_n and we deduce that for some n, depending on the factorization of 2ⁿ-1, the only hyper-bent functions on n variables are the elements of the class , obtained from PS_ap by composing the functions by the transformations x?δx, δ≠0, and by adding constant functions. We prove that non- hyper-bent functions exist for n=4, but it is not clear whether they exist for greater n. We also construct potentially new bent functions for n=12.