Approximation by Linear Fractional Transformations of Simple Partial Fractions and Their Differences

Let f be a function and ρ be a simple partial fraction of degree at most n. Under linear-fractional transformations, the difference f ? ρ becomes the difference of another function and a certain simple partial fraction of degree at most n with a quadratic weight. We study applications of this important property. We prove a theorem on uniqueness of interpolating simple partial fraction, generalizing known results, and obtain estimates for the best uniform approximation of certain functions on the real semi-axis ?⁺. For continuous functions of rather common type we first obtain estimates of the best approximation by differences of simple partial fractions on ?⁺. For odd functions we obtain such estimates on the whole axis ?.     

Solving Systems of Linear Equations with Normal Coefficient Matrices and the Degree of the Minimal Polyanalytic Polynomial

The generalized Lanczos process applied to a normal matrix A builds up a condensed form of A, which can be described as a band matrix with slowly growing bandwidth. For certain classes of normal matrices, the bandwidth turns out to be constant. It is shown that, in such cases, the bandwidth is determined by the degree of the minimal polyanalytic polynomial of A. It was in relation to the generalized Lanczos process thatM.Huhtanen introduced the concept of the minimal polyanalytic polynomial of a normal matrix.     

Ergodic theorems with arithmetical weights

We prove that the divisor function d(n) counting the number of divisors of the integer n is a good weighting function for the pointwise ergodic theorem. For any measurable dynamical system (X, A, ν, τ) and any f ∈ L ^p (ν), p > 1, the limit

$$\mathop {\lim }\limits_{n \to \infty } \frac{1}{{\Sigma _{k = 1}^nd\left( k \right)}}\sum\limits_{k = 1}^n {d\left( k \right)f\left( {{\tau ^k}x} \right)} $$

exists ν-almost everywhere. The proof is based on Bourgain’s method, namely the circle method based on the shift model. Using more elementary ideas we also obtain similar results for other arithmetical functions, like the θ(n) function counting the number of squarefree divisors of n and the generalized Euler totient function J _s (n) = Σ _d|n d ^s μ(n/d), s > 0.

     

Semi-Heavy Tails

In this paper, we study properties of functions and sequences with a semi-heavy tail, that is, functions and sequences of the form w(x) = e^?βxf(x), β > 0, resp., w_n = cⁿf_n, 0 < c < 1, where the function f(x), resp., the sequence (f_n), is regularly varying. Among others, we give a representation theorem and study convolution properties. The paper includes several examples and applications in probability theory.     

Order of the length of Boolean functions in the class of exclusive-OR sums of pseudoproducts

An exclusive-OR sum of pseudoproducts (ESPP) is a modufo-2 sum of products of affine (linear) Boolean functions. The length of an ESPP is defined as the number of summands in this sum; the length of a Boolean function in the class of ESPPs is the minimum length of an ESPP representing this function. The Shannon length function L ^ESPP(n) on the set of Boolean functions in the class of ESPPs is considered; it is defined as the maximum length of a Boolean function of n variables in the class of ESPPs. It is proved that L ^ESPP(n) = ? (2 ⁿ /n ²). The quantity L ^ESPP(n) also equals the least number l such that any Boolean function of n variables can be represented as a modulo-2 sum of at most l multiaffine functions.     

Embedding of Sobolev spaces with limit exponent revisited

An embedding of the Sobolev spaces W _p ^s (? ⁿ ) in Lizorkin-type spaces of locally integrable functions of smoothness zero is obtained; a similar assertion for Riesz and Bessel potentials is presented. The embedding theorem is extended to Sobolev spaces on irregular domains in n-dimensional Euclidean space. The statement of the theorem depends on geometric parameters of the domain of functions.     

Graded Lie algebras with few nontrivial components

We prove that if a (?/n?)-graded Lie algebra L = ? _i=0 ^n?1 L _i has d nontrivial components L _i and the null component L ₀ has finite dimension m, then L has a homogeneous solvable ideal of derived length bounded by a function of d and of codimension bounded by a function of m and d. An analogous result holds also for the (?/n?)-graded Lie rings L = ? _i=0 ^n?1 with few nontrivial components L _i if the null component L ₀ has finite order m. These results generalize Kreknin’s theorem on the solvability of the (?/n?)-graded Lie rings L = ? _i=0 ^n?1 L _i with trivial component L ₀ and Shalev’s theorem on the solvability of such Lie rings with few nontrivial components L _i . The proof is based on the method of generalized centralizers which was created by E. I. Khukhro for Lie rings and nilpotent groups with almost regular automorphisms of prime order [1], as well as on the technique developed in the work of N. Yu. Makarenko and E. I. Khukhro on the almost solvability of Lie algebras with an almost regular automorphism of finite order [2].     

Length-type parameters of finite groups with almost unipotent automorphisms

Let α be an automorphism of a finite group G. For a positive integer n, let E _G,n (α) be the subgroup generated by all commutators [...[[x,α],α],…,α] in the semidirect product G 〈α〉 over x ∈ G, where α is repeated n times. By Baer’s theorem, if E _G,n (α)=1, then the commutator subgroup [G,α] is nilpotent. We generalize this theorem in terms of certain length parameters of E _G,n (α). For soluble G we prove that if, for some n, the Fitting height of E _G,n (α) is equal to k, then the Fitting height of [G,α] is at most k + 1. For nonsoluble G the results are in terms of the nonsoluble length and generalized Fitting height. The generalized Fitting height h*(H) of a finite group H is the least number h such that F _h* (H) = H, where F ₀* (H) = 1, and F _i+1* (H) is the inverse image of the generalized Fitting subgroup F*(H/F _i *(H)). Let m be the number of prime factors of the order |α| counting multiplicities. It is proved that if, for some n, the generalized Fitting height E _G,n (α) of is equal to k, then the generalized Fitting height of [G,α] is bounded in terms of k and m. The nonsoluble length λ(H) of a finite group H is defined as the minimum number of nonsoluble factors in a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. It is proved that if λE _G,n (α)= k, then the nonsoluble length of [G,α] is bounded in terms of k and m. We also state conjectures of stronger results independent of m and show that these conjectures reduce to a certain question about automorphisms of direct products of finite simple groups.     

On a result by geronimus

In 1935, Ya.L. Geronimus found the best integral approximation on the period [?π,π) of the function sin(n + 1)t ? 2q sin nt, q ∈ ?, by the subspace of trigonometric polynomials of degree at most n ? 1. This result is an integral analog of the known theorem by E.I. Zolotarev (1868). At present, there are several methods of proving this fact. We propose one more variant of the proof. In the case |q| ≥ 1, we apply the (2π/n)-periodization and the fact that the function | sin nt| is orthogonal to the harmonic cos t on the period. In the case |q| < 1, we use the duality relations for Chebyshev’s theorem (1859) on a rational function least deviating from zero on a closed interval with respect to the uniform metric.     

New Applications of the <Emphasis Type="Italic">p</Emphasis>-Adic Nevanlinna Theory

Let IK be an algebraically closed field of characteristic 0 complete for an ultrametric absolute value. Following results obtained in complex analysis, here we examine problems of uniqueness for meromorphic functions having finitely many poles, sharing points or a pair of sets (C.M. or I.M.) defined either in the whole field IK or in an open disk, or in the complement of an open disk. Following previous works in C, we consider functions fⁿ(x)f^m(ax + b), gⁿ(x)g^m(ax + b) with |a| = 1 and n ≠ m, sharing a rational function and we show that f/g is a n + m-th root of 1 whenever n + m ≥ 5. Next, given a small function w, if n, m ∈ IN are such that |n ? m|_∞ ≥ 5, then fⁿ(x)f^m(ax + b) ? w has infinitely many zeros. Finally, we examine branched values for meromorphic functions fⁿ(x)f^m(ax + b).     

A New Class of Generalized Polynomials Associated with Hermite and Euler Polynomials

In this paper, we introduce a new class of generalized polynomials associated with the modified Milne-Thomson’s polynomials \({\Phi_{n}^{(\alpha)}(x,\nu)}\) of degree n and order α introduced by Dere and Simsek. The concepts of Euler numbers E _n , Euler polynomials E _n (x), generalized Euler numbers E _n (a, b), generalized Euler polynomials E _n (x; a, b, c) of Luo et al., Hermite–Bernoulli polynomials \({{_HE}_n(x,y)}\) of Dattoli et al. and \({{_HE}_n^{(\alpha)} (x,y)}\) of Pathan are generalized to the one \({ {_HE}_n^{(\alpha)}(x,y,a,b,c)}\) which is called the generalized polynomials depending on three positive real parameters. Numerous properties of these polynomials and some relationships between E _n , E _n (x), E _n (a, b), E _n (x; a, b, c) and \({{}_HE_n^{(\alpha)}(x,y;a,b,c)}\) are established. Some implicit summation formulae and general symmetry identities are derived using different analytical means and applying generating functions.     

Quasiregular mappings to generalized manifolds

We establish the basic analytic and geometric properties of quasiregular maps f: ω → X, where ω ? ? ⁿ is a domain and X is a generalized n-manifold with a suitably controlled geometry. Generalizing the classical Väisälä and Poletsky inequalities, our main theorem shows that the path family method applies to these maps.     

Adaptive age replacement strategies based on nonparametric predictive inference

We consider an age replacement problem using nonparametric predictive inference (NPI) for the lifetime of a future unit. Based on n observed failure times, NPI provides lower and upper bounds for the survival function for a future lifetime X_n+1, which are lower and upper survival functions in the theory of interval probability, and which lead to upper and lower cost functions, respectively, for age replacement based on the renewal reward theorem. Optimal age replacement times for X_n+1 follow by minimizing these cost functions. Although the renewal reward theorem implicitly assumes that the corresponding optimal strategy will be used for a long period, we study the effect on this strategy when the observed value for X_n+1, which is either an observed failure time or a right-censored observation, becomes available. This is possible due to the fully adaptive nature of our nonparametric approach, and the next optimal strategy will be for X_n+2. We compare the optimal strategies for X_n+1 and X_n+2 both analytically and via simulation studies. Our NPI-based approach is fully adaptive to the data, to which it adds only few structural assumptions. We discuss the possible use of this approach, and indeed the wider importance of the conclusions of this study to situations where one wishes to combine the statistical aspects of estimating a lifetime distribution with the more traditional operational research approach of determining optimal replacement strategies for lifetime distributions that are assumed to be known.     

The Lipschitzianity of convex vector and set-valued functions

It is well known that every scalar convex function is locally Lipschitz on the interior of its domain in finite dimensional spaces. The aim of this paper is to extend this result for both vector functions and set-valued mappings acting between infinite dimensional spaces with an order generated by a proper convex cone C. Under the additional assumption that the ordering cone C is normal, we prove that a locally C-bounded C-convex vector function is Lipschitz on the interior of its domain by two different ways. Moreover, we derive necessary conditions for Pareto minimal points of vector-valued optimization problems where the objective function is C-convex and C-bounded. Corresponding results are derived for set-valued optimization problems.     

Optimal Embeddings of Bessel-Potential-Type Spaces into Generalized Hölder Spaces Involving <Emphasis Type="Italic">k</Emphasis>-Modulus of Smoothness

We establish necessary and sufficient conditions for embeddings of Bessel potential spaces H ^σ X(IR ⁿ ) with order of smoothness σ?∈?(0, n), modelled upon rearrangement invariant Banach function spaces X(IR ⁿ ), into generalized Hölder spaces (involving k-modulus of smoothness). We apply our results to the case when X(IR ⁿ ) is the Lorentz-Karamata space \(L_{p,q;b}({{\rm I\kern-.17em R}}^n)\). In particular, we are able to characterize optimal embeddings of Bessel potential spaces \(H^{\sigma}L_{p,q;b}({{\rm I\kern-.17em R}}^n)\) into generalized Hölder spaces. Applications cover both superlimiting and limiting cases. We also show that our results yield new and sharp embeddings of Sobolev-Orlicz spaces W ^k?+?1 L ^n/k(logL) ^α (IR ⁿ ) and W ^k L ^n/k(logL) ^α (IR ⁿ ) into generalized Hölder spaces.     

Some relations among multiplicative and <Emphasis Type="Italic">q</Emphasis>-additive functions

We give all solutions of the equation f(n) = g(n) + h(n) for every n ∈ ?, where f is a completely multiplicative, g is a 2-additive, and h is a 3-additive function. We also determine all completely multiplicative functions f and all q-additive functions g for which f(n) = g ²(n) for every n ∈ ?.     

Modified Kantorovich theorem and asymptotic approximations of solutions to singularly perturbed systems of ordinary differential equations

The functional equation f(x,ε) = 0 containing a small parameter ε and admitting regular and singular degeneracy as ε → 0 is considered. By the methods of small parameter, a function x _n ⁰(ε) satisfying this equation within a residual error of O(ε ⁿ⁺¹) is found. A modified Newton’s sequence starting from the element x _n ⁰(ε) is constructed. The existence of the limit of Newton’s sequence is based on the NK theorem proven in this work (a new variant of the proof of the Kantorovich theorem substantiating the convergence of Newton’s iterative sequence). The deviation of the limit of Newton’s sequence from the initial approximation x _n ⁰(ε) has the order of O(ε ⁿ⁺¹), which proves the asymptotic character of the approximation x _n ⁰(ε). The method proposed is implemented in constructing an asymptotic approximation of a system of ordinary differential equations on a finite or infinite time interval with a small parameter multiplying the derivatives, but it can be applied to a wider class of functional equations with a small parameters.     

A local mean value theorem for functions on non-archimedean field extensions of the real numbers

In this paper, we review the definition and properties of locally uniformly differentiable functions on N, a non-Archimedean field extension of the real numbers that is real closed and Cauchy complete in the topology induced by the order. Then we define and study n-times locally uniform differentiable functions at a point or on a subset of N. In particular, we study the properties of twice locally uniformly differentiable functions and we formulate and prove a local mean value theorem for such functions.     

On the Completeness of Products of Harmonic Functions and the Uniqueness of the Solution of the Inverse Acoustic Sounding Problem

It is proved that the family of all pairwise products of regular harmonic functions on D and of the Newtonian potentials of points on the line L ? Rⁿ is complete in L₂(D), where D is a bounded domain in Rⁿ, n ≥ 3, such that \(\bar D\) ∩ L = ?. This result is used in the proof of uniqueness theorems for the inverse acoustic sounding problem in R³.     

Sum-free sets in abelian groups

An IP system is a functionn taking finite subsets ofN to a commutative, additive group Ω satisfyingn(α∪β)=n(α)+n(β) whenever α∩β=ø. In an extension of their Szemerédi theorem for finitely many commuting measure preserving transformations, Furstenberg and Katznelson showed that ifS _i ,1≤i≤k, are IP systems into a commutative (possibly infinitely generated) group Ω of measure preserving transformations of a probability space (X, B, μ, andA∈B with μ(A)>0, then for some ø≠α one has μ(? _i=1 ^k S _i({α})A>0). We extend this to so-called FVIP systems, which are polynomial analogs of IP systems, thereby generalizing as well joint work by the author and V. Bergelson concerning special FVIP systems of the formS(α)=T(p(n(α))), wherep:Z ^t →Z ^d is a polynomial vanishing at zero,T is a measure preservingZ ^d action andn is an IP system intoZ ^t . The primary novelty here is potential infinite generation of the underlying group action, however there are new applications inZ ^d as well, for example multiple recurrence along a wide class ofgeneralized polynomials (very roughly, functions built out of regular polynomials by iterated use of the greatest integer function).