On Beurling’s boundary differential relation

We prove that for an arbitrary positive continuous function Φ on the complex plane ? there exists an injective disc algebra function φ and n ∈ ? such that ξ ? φ(ξ ⁿ ) solves Beurling’s boundary differential relation |f′(ξ)| = Φ(f(ξ)) on ?Δ. Moreover, if the growth of Φ is sublinear, the existence of univalent solutions of Beurling’s boundary differential relation is shown.     

Ruzsa’s constant on additive functions

A function f : N → R is called additive if f(mn)= f(m)+f(n)for all m, n with(m, n)= 1. Let μ(x)= max n≤x(f(n)f(n + 1))and ν(x)= max n≤x(f(n + 1)f(n)). In 1979, Ruzsa proved that there exists a constant c such that for any additive function f , μ(x)≤ cν(x 2 )+ c f , where c f is a constant depending only on f . Denote by R af the least such constant c. We call R af Ruzsa's constant on additive functions. In this paper, we prove that R af ≤ 20.     

Generalized moments of additive functions

Elliott's generalization of the Turán-Kubilius inequality is further generalized by establishing an upper bound for the sum Σ_n≤xF(∣f(n) ? A∣), where f is a complex-valued additive arithmetical function, A an arbitrary number and F an arbitrary nonnegative-valued increasing function. A connected problem for group-valued functions is also considered.     

On the rank of odd hyper-quasi-polynomials

Given any nonzero entire function g: ? → ?, the complex linear space F(g) consists of all entire functions f decomposable as f(z + w)g(z - w)=φ₁(z)ψ₁(w)+???+ φ_n(z)ψ_n(w) for some φ₁, ψ₁, …, φ_n, ψ_n: ? → ?. The rank of f with respect to g is defined as the minimum integer n for which such a decomposition is possible. It is proved that if g is an odd function, then the rank any function in F(g) is even.     

F-limit points in dynamical systems defined on the interval

Given a free ultrafilter p on ? we say that x ∈ [0, 1] is the p-limit point of a sequence (x _n ) _n∈? ? [0, 1] (in symbols, x = p -lim _n∈? x _n ) if for every neighbourhood V of x, {n ∈ ?: x _n ∈ V} ∈ p. For a function f: [0, 1] → [0, 1] the function f ^p : [0, 1] → [0, 1] is defined by f ^p (x) = p -lim _n∈? f ⁿ (x) for each x ∈ [0, 1]. This map is rarely continuous. In this note we study properties which are equivalent to the continuity of f ^p . For a filter F we also define the ω ^F -limit set of f at x. We consider a question about continuity of the multivalued map x → ω _f ^F (x). We point out some connections between the Baire class of f ^p and tame dynamical systems, and give some open problems.     

A Characterization of the free n-generated MV-algebra

An MV-algebra A=(A,0,¬,⊕) is an abelian monoid (A,0,⊕) equipped with a unary operation ¬ such that ¬¬x=x,x⊕¬0=¬0, and y⊕¬(y⊕¬x)=x⊕¬(x⊕¬y). Chang proved that the equational class of MV-algebras is generated by the real unit interval [0,1] equipped with the operations ¬x=1?x and x⊕y=min(1,x+y). Therefore, the free n-generated MV-algebra Free _n is the algebra of [0,1]-valued functions over the n-cube [0,1] ⁿ generated by the coordinate functions ξ _i ,i=1, . . . ,n, with pointwise operations. Any such function f is a McNaughton function, i.e., f is continuous, piecewise linear, and each piece has integer coefficients. Conversely, McNaughton proved that all McNaughton functions f: [0,1] ⁿ →[0,1] are in Free _n . The elements of Free _n are logical equivalence classes of n-variable formulas in the infinite-valued calculus of ?ukasiewicz. The aim of this paper is to provide an alternative, representation-free, characterization of Free _n .     

Stability of the geometric Ekeland variational principle: Convex case

In geometric terms, the Ekeland variational principle says that a lower-bounded proper lower-semicontinuous functionf defined on a Banach spaceX has a point (x ₀,f(x ₀)) in its graph that is maximal in the epigraph off with respect to the cone order determined by the convex coneK _λ = {(x, α) ∈X × ?:λ ∥x∥ ≤ ? α}, where λ is a fixed positive scalar. In this case, we write (x ₀,f(x ₀))∈λ-extf. Here, we investigate the following question: if (x ₀,f(x ₀))∈λ-extf, wheref is a convex function, and if 〈f _n 〉 is a sequence of convex functions convergent tof in some sense, can (x ₀,f(x ₀)) be recovered as a limit of a sequence of points taken from λ-extf _n ? The convergence notions that we consider are the bounded Hausdorff convergence, Mosco convergence, and slice convergence, a new convergence notion that agrees with the Mosco convergence in the reflexive setting, but which, unlike the Mosco convergence, behaves well without reflexivity.     

On Some Functional Equations and Representations of Topological Semigroups

Let a representation T of a semigroup G on a linear space X be given. We call x ∈ X a finite vector if its orbit T(G) is contained in a finite-dimensional subspace. In this paper, some statements about finite vectors are applied to the following problem. For a given positive integer n > 1, describe all continuous functions f : G → ? such that the function (x₁,..., x _n ) ? f(x₁ + ? + x _n ) can be polynomially expressed via functions of sums of fewer variables.     

On the class of limits of lacunary trigonometric series

Let (n _k ) _k≧1 be a lacunary sequence of positive integers, i.e. a sequence satisfying n _k+1/n _k > q > 1, k ≧ 1, and let f be a “nice” 1-periodic function with ∝ ₀ ¹ f(x) dx = 0. Then the probabilistic behavior of the system (f(n _k x)) _k≧1 is very similar to the behavior of sequences of i.i.d. random variables. For example, Erd?s and Gál proved in 1955 the following law of the iterated logarithm (LIL) for f(x) = cos 2πx and lacunary $ (n_k )_{k \geqq 1} $ : (1) $$ \mathop {\lim \sup }\limits_{N \to \infty } (2N\log \log N)^{1/2} \sum\limits_{k = 1}^N {f(n_k x)} = \left\| f \right\|_2 $$ for almost all x ∈ (0, 1), where ‖f‖₂ = (∝ ₀ ¹ f(x)² dx)^1/2 is the standard deviation of the random variables f(n _k x). If (n _k ) _k≧1 has certain number-theoretic properties (e.g. n _k+1/n _k → ∞), a similar LIL holds for a large class of functions f, and the constant on the right-hand side is always ‖f‖₂. For general lacunary (n _k ) _k≧1 this is not necessarily true: Erd?s and Fortet constructed an example of a trigonometric polynomial f and a lacunary sequence (n _k ) _k≧1, such that the lim sup in the LIL (1) is not equal to ‖f‖₂ and not even a constant a.e. In this paper we show that the class of possible functions on the right-hand side of (1) can be very large: we give an example of a trigonometric polynomial f such that for any function g(x) with sufficiently small Fourier coefficients there exists a lacunary sequence (n _k ) _k≧1 such that (1) holds with √‖f‖ ₂ ² + g(x) instead of ‖f‖₂ on the right-hand side.     

Small-amplitude limit cycles of polynomial Liénard systems

In this paper,we study the number of limit cycles appeared in Hopf bifurcations of a Linard system with multiple parameters.As an application to some polynomial Li’enard systems of the form x=y,y=gm(x)-fn(x)y,we obtain a new lower bound of maximal number of limit cycles which appear in Hopf bifurcation for arbitrary degrees m and n.     

Existence of stable equilibrium point for dynamical systems of Volterra type

This paper presents sufficient conditions for the existence of a nonnegative and stable equilibrium point of a dynamical system of Volterra type, (1) $\text{(}\text{d}\text{dt}\text{) x}{}_{\mathrm{i}}\text{(t) = ?x}{}_{\mathrm{i}}\text{(t)[f}{}_{\mathrm{i}}\text{(x}{}_1\text{(t),…, x}{}_{\mathrm{n}}\text{(t)) ? q}{}_{\mathrm{i}}\text{], i = 1,…, n}$, for every q = (q₁,…, q_n)^T?Rⁿ. Results of a nonlinear complementarity problem are applied to obtain the conditions. System (1) has a nonnegative and stable equilibrium point if (i) f(x) = (f₁(x),…,f_n(x))^T is a continuous and differentiable M-function and it satisfies a certain surjectivity property, or (ii), f(x) is continuous and strongly monotone on R₊₀ⁿ.     

Comparison of the best uniform approximations of analytic functions in the disk and on its boundary

Denote by C _A the set of functions that are analytic in the disk |z| < 1 and continuous on its closure |z| ≤ 1; let ? _n , n = 0, 1, 2, ..., be the set of rational functions of degree at most n. Denote by R _n (f) (R _n (f) _A ) the best uniform approximation of a function f ∈ C _A on the circle |z| = 1 (in the disk |z| ≤ 1) by the set ? _n . The following equality is proved for any n ≥ 1: sup{R _n (f) _A /R _n (f): f ∈ C _A ? ? _n } = 2. We also consider a similar problem of comparing the best approximations of functions in C _A by polynomials and trigonometric polynomials.     

Zeta measures and Thermodynamic Formalism for temperature zero

We address the analysis of the following problem: given a real Hölder potential f defined on the Bernoulli space and μ _f its equilibrium state, it is known that this shift-invariant probability can be weakly approximated by probabilities in periodic orbits associated to certain zeta functions. Given a Hölder function f > 0 and a value s such that 0 < s < 1, we can associate a shift-invariant probability ν _s such that for each continuous function k we have $ \int {kd} v_s = \frac{{\sum\nolimits_{n = 1}^\infty {\sum\nolimits_{x \in Fix_n } {e^{sf^n (x) - nP(f)\frac{{k^n (x)}} {n}} } } }} {{\sum\nolimits_{n = 1}^\infty {\sum\nolimits_{x \in Fix_n } {e^{sf^n (x) - nP(f)} } } }}, $ , where P(f) is the pressure of f, Fix _n is the set of solutions of σ ⁿ (x) = x, for any n ∈ ?, and f ⁿ (x) = f(x) + f(σ (x)) + … + f(σ ^n?1(x)). We call νs a zeta probability for f and s, because it can be obtained in a natural way from the dynamical zeta-functions. From the work of W. Parry and M. Pollicott it is known that ν _s → µ _f , when s → 1. We consider for each value c the potential c f and the corresponding equilibrium state μ _cf . What happens with ν _s when c goes to infinity and s goes to one? This question is related to the problem of how to approximate the maximizing probability for f by probabilities on periodic orbits. We study this question and also present here the deviation function I and Large Deviation Principle for this limit c → ∞, s → 1. We will make an assumption: for some fixed L we have lim _{c→∞, s→1} c(1 ? s) = L > 0. We do not assume here the maximizing probability for f is unique in order to get the L.D.P.     

A note on approximation properties of q-Durrmeyer operators

In this paper, the approximation properties of q-Durrmeyer operators D_n,q(f;x) for f∈C[0,1] are discussed. The exact class of continuous functions satisfying approximation process lim_n→∞D_n,q(f;x)=f(x) is determined. The results of the paper provide an elaboration of the previously-known ones on operators D_n,q.     

A functional equation arising in multi-agent statistical decision theory

Using recent results of Járai we show that the measurable solutions of the functional equationf(x ₁ y ₁,...,x _n y _n )f((1?x ₁)(1?y ₁),..., (1?x _n )(1?y _n ))=f(x ₁(1?y ₁),...,x _n (1 ? (y _n ))f(y ₁(1?x ₁),...,y _n(1 ?x _n )), wheref: (0, 1) ⁿ → (0, ∞) and 0<x _i ,y _i <1,i=1,...,n, are of the form $$f(x_1 ,...,x_n ) = c \exp \left( {\sum\limits_{i = 1}^n {a_i (x_1 - x_1^2 ))} \prod\limits_{i = 1}^n {x_i^{b_1 } ,} } \right.$$ wherec>0,a ₁,...,a _n andb ₁,..., _b are arbitrary real constants. This result enables one to characterize certain independence-preserving methods of aggregating probability distributions over four alternatives.     

Copositive pointwise approximation

We prove that if a functionf ∈C ⁽¹⁾ (I),I: = [?1, 1], changes its signs times (s ∈ ?) within the intervalI, then, for everyn > C, whereC is a constant which depends only on the set of points at which the function changes its sign, andk ∈ ?, there exists an algebraic polynomialP _n =P _n (x) of degree ≤n which locally inherits the sign off(x) and satisfies the inequality $$\left| {f\left( x \right) - P_n \left( x \right)} \right| \leqslant c\left( {s,k} \right)\left( {\frac{1}{{n^2 }} + \frac{{\sqrt {1 - x^2 } }}{n}} \right)\omega _k \left( {f'; \frac{1}{{n^2 }} + \frac{{\sqrt {1 - x^2 } }}{n}} \right), x \in I$$ , where ω _k (f′;t) is thekth modulus of continuity of the functionf’. It is also shown that iff ∈C (I) andf(x) ≥ 0,x ∈I then, for anyn ≥k ? 1, there exists a polynomialP _n =P _n (x) of degree ≤n such thatP _n (x) ≥ 0,x ∈I, and |f(x) ?P _n (x)| ≤c(k)ω _k (f;n ^?2 +n ^?1 √1 ?x ²),x ∈I.     

Solution of Functional Equations Related to Elliptic Functions

Functional equations of the form f(x + y)g(x ? y) = Σ _j=1 ⁿ α _j (x)β _j (y) as well as of the form f₁(x + z)f₂(y + z)f₃(x + y ? z) = Σ _j=1 ^m φ _j (x, y)ψ _j (z) are solved for unknown entire functions f, g,α _j , β _j : ? → ? and f₁, f₂, f₃, ψ _j : ? → ?, φ _j : ?² → ? in the cases of n = 3 and m = 4.     

The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear

It is proved that for each fixed composite number k, the circuit complexity of the problem which is to check if an arbitrary function f(x ₁, ..., x _n ) over a residue ring modulo k given by its value vector with length N = k ⁿ and, if so, to construct its polynomial representation is linear.     

Subexponential estimates in the height theorem and estimates on numbers of periodic parts of small periods

This paper is devoted to subexponential estimates in Shirshov’s height theorem. A word W is n-divisible if it can be represented in the form W = W ₀ W ₁ ?W _n , where W ₁ ? W ₂ ??? W _n . If an affine algebra A satisfies a polynomial identity of degree n, then A is spanned by non-n-divisible words of generators a ₁ ??? a _l . A. I. Shirshov proved that the set of non-n-divisible words over an alphabet of cardinality l has bounded height h over the set Y consisting of all words of degree ≤ n ? 1. We show that h < Φ (n, l), where Φ(n, l) = 2⁸⁷ l?n ^{12 log3 n+48}. Let l, n, and d ≥ n be positive integers. Then all words over an alphabet of cardinality l whose length is greater than ψ(n, d, l) are either n-divisible or contain the dth power of a subword, where ψ(n, d, l) = 2¹⁸ l(nd)^{3 log3(nd)+13} d ². In 1993, E. I. Zelmanov asked the following question in the Dniester Notebook: Suppose that F _2,m is a 2-generated associative ring with the identity x ^m = 0. Is it true that the nilpotency degree of F _2,m has exponential growth? We give the definitive answer to E. I. Zelmanov by this result. We show that the nilpotency degree of the l-generated associative algebra with the identity x ^d = 0 is smaller than ψ(d, d, l). This implies subexponential estimates on the nilpotency index of nil-algebras of arbitrary characteristic. Shirshov’s original estimate was just recursive; in 1982 a double exponent was obtained, and an exponential estimate was obtained in 1992. Our proof uses Latyshev’s idea of an application of the Dilworth theorem. We think that Shirshov’s height theorem is deeply connected to problems of modern combinatorics. In particular, this theorem is related to the Ramsey theory. We obtain lower and upper estimates of the number of periods of length 2, 3, n ? 1 in some non-n-divisible word. These estimates differ only by a constant.     

Oscillation criteria for sublinear differential equations with damping

We present some criteria for the oscillation of the second order nonlinear differential equation [a(t)ψ(x(t))x'(t)]' + p(t)x'(t) + q(t)f (x(t)) =0, t≧t ₀> 0 with damping where a∈C ¹ ([t ₀,∞)) is a nonnegative function, p, q∈ C([t ₀,∞)) are allowed to change sign on [t ₀,∞), ψ, f∈C(R) with ψ(x) ≠ 0, xf(x)/ψ(x) > 0 for x≠ 0, and ψ, f have continuous derivatives on R{0} with [f(x) / ψ(x)]' ≧ 0 for x≠ 0. This criteria are obtained by using a general class of the parameter functions H(t,s) in the averaging techniques. An essential feature of the proved results is that the assumption of positivity of the function ψ(x) is not required. Consequently, the obtained criteria cover new classes of equations to which known results do not apply.