On superpositions of continuous functions

We show that if Φ is an arbitrary countable set of continuous functions of n variables, then there exists a continuous, and even infinitely smooth, function ψ(x₁,...,x_n) such that ψ(x ₁, ...,x _n ) ?g [? (f ₁(x ₁, ... ,f _f (x _n ))] for any function ? from Φ and arbitrary continuous functions g and f_i, depending on a single variable.     

Linear-time certifying algorithms for near-graphical sequences

A sequence 〈d₁,d₂,…,d_n〉 of non-negative integers is graphical if it is the degree sequence of some graph, that is, there exists a graph G on n vertices whose ith vertex has degree d_i, for 1≤i≤n. The notion of a graphical sequence has a natural reformulation and generalization in terms of factors of complete graphs.If H=(V,E) is a graph and g and f are integer-valued functions on the vertex set V, then a (g,f)-factor of H is a subgraph G=(V,F) of H whose degree at each vertex v∈V lies in the interval [g(v),f(v)]. Thus, a (0,1)-factor is just a matching of H and a (1, 1)-factor is a perfect matching of H. If H is complete then a (g,f)-factor realizes a degree sequence that is consistent with the sequence of intervals 〈[g(v₁),f(v₁)],[g(v₂),f(v₂)],…,[g(v_n),f(v_n)]〉.Graphical sequences have been extensively studied and admit several elegant characterizations. We are interested in extending these characterizations to non-graphical sequences by introducing a natural measure of “near-graphical”. We do this in the context of minimally deficient (g,f)-factors of complete graphs. Our main result is a simple linear-time greedy algorithm for constructing minimally deficient (g,f)-factors in complete graphs that generalizes the method of Hakimi and Havel (for constructing (f,f)-factors in complete graphs, when possible). It has the added advantage of producing a certificate of minimum deficiency (through a generalization of the Erdös-Gallai characterization of (f,f)-factors in complete graphs) at no additional cost.     

Period Integrals and Rankin–Selberg L-functions on GL(n)

We compute the second moment of a certain family of Rankin–Selberg L-functions L(f ×?g, 1/2) where f and g are Hecke–Maass cusp forms on GL(n). Our bound is as strong as the Lindel?f hypothesis on average, and recovers individually the convexity bound. This result is new even in the classical case n?=?2.     

On the number of combinations without unit separation

Let f(n, k) denote the number of ways of selecting k objects from n objects arrayed in a line with no two selected having unit separation (i.e., having exactly one object between them). Then, if $\text{n ? 2(k ? 1), f(n,k)=}\text{∑}\text{i=0}\text{κ}\text{(}\text{n?k+I?2i}\text{k?2i}\text{)}$ (where $\text{κ = [}\text{k}\text{2}\text{]}$). If n < 2(k ? 1), then f(n, k) = 0. In addition, f(n, k) satisfies the recurrence relation f(n, k) = f(n ? 1, k) + f(n ? 3, k ? 1) + f(n ? 4, k ? 2). If the objects are arrayed in a circle, and the corresponding number is denoted by g(n, k), then for n > 3, g(n, k) = f(n ? 2, k) + 2f(n ? 5, k ? 1) + 3f(n ? 6, k ? 2). In particular, if n ? 2k + 1 then $\text{(n,k)=(}\text{n?k}\text{k}\text{)+(}\text{n?k?1}\text{k?1}\text{)}$.     

On oscillation of solutions of higher order forced functional differential inequalities

Oscillation criteria for the class of forced functional differential inequalities x(t){L_nx(t) + f(t, x(t), x[g₁(t)],…, x[g_m(t)]) ? h(t)} ? 0, for n even, and x(t){L_nx(t) ? f(t, x(t), x[g₁(t)],…, x[g_m(t)]) ? h(t)} ? 0, for n odd, are established.     

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.     

Uniqueness properties in finite-continuous additive measurement

Let ? be a binary relation on A×X, and suppose that there are real valued functions f on A and g on X such that, for all ax, by ∈ A×X, ax ? by if and only if f (a)+g(x) ? f(b)+g(y). This paper establishes uniqueness properties for f and g when A is a finite set, X is a real interval with g increasing on X, and for any a, b and x there is a y for which f(a)+g(x)=f(b)+g(y). The resultant uniqueness properties occupy an intermediate position among uniqueness properties for other structural cases of two-factor additive measurement.It is shown that f is unique up to a positive affine transformation (αf+β₁ with α > 0), but that g is unique up to a similar positive affine transformation (αg+β₂) if and only if the ratio [f(a)?f(b)]/[f(a)?f(c)] is irrational for some a, b, c ∈ A. When the f ratios are rational for all cases where they are defined, there will be a half-open interval (x₀, x₁) in X such that the restriction of g on (x₀, x₁) can be any increasing function for which sup {g(x)?g(x₀): x₀ ? x < x₁} does not exceed a specified bound, and, when g is thus defines on (x₀, x₁), it will be uniquely determined on the rest of X. In general, g must be continuous only in the ‘irrational’ case.     

What Is the Complexity of Stieltjes Integration?

We study the complexity of approximating the Stieltjes integral ∫¹₀ f(x) dg(x) for functions f having r continuous derivatives and functions g whose sth derivative has bounded variation. Let r(n) denote the nth minimal error attainable by approximations using at most n evaluations of f and g, and let comp(ε) denote the ε-complexity (the minimal cost of computing an ε-approximation). We show that r(n)≍n^{−min{r, s+1}} and that comp(ε)≍ε^{−1/min{r, s+1}}. We also present an algorithm that computes an ε-approximation at nearly minimal cost.     

Равносходимость разложений в кратный ряд и интеграл фурье, «прямоугольные частичные суммы» которых рассматриваются по некоторой подпоследовательности

In this paper we investigate the problem of the equiconvergence on T ^N = [-π, π) ^N of the expansions in multiple trigonometric series and Fourier integral of functions f ∈ L _p (T ^N ) and g ∈ L _p (? ^N ), where p > 1, N ≥ 3, g(x) = f(x) on T ^N , in the case when the “rectangular partial sums” of the indicated expansions, i.e.,– _n (x; f) and J _α(x; g), respectively, have indices n ∈ ? ^N and α ∈ ? ^N (n _j = [α _j ], j = 1,...,N, [t] is the integer part of t ∈ ?¹), in those certain components are the elements of “lacunary sequences”.     

When a smooth self-map of a semi-simple Lie group can realize the least number of periodic points

There are two algebraic lower bounds of the number of n-periodic points of a self-map f : M → M of a compact smooth manifold of dimension at least 3: NF_n(f) = min{#Fix(g~n); g ～ f; g continuous} and NJD_n(f) = min{#Fix(g~n); g ～ f; g smooth}. In general, NJD_n(f) may be much greater than NF_n(f). We show that for a self-map of a semi-simple Lie group, inducing the identity fundamental group homomorphism,the equality NF_n(f) = NJD_n(f) holds for all n ? all eigenvalues of a quotient cohomology homomorphism induced by f have moduli 1.     

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.     

Functional convergence of stochastic integrals with application to statistical inference

Assuming that {(U_n,V_n)} is a sequence of càdlàg processes converging in distribution to (U,V) in the Skorohod topology, conditions are given under which {?f_n(β,u,v)dU_ndV_n} converges weakly to ?f(β,x,y)dUdV in the space C(R), where f_n(β,u,v) is a sequence of “smooth” functions converging to f(β,u,v). Integrals of this form arise as the objective function for inference about a parameter β in a stochastic model. Convergence of these integrals play a key role in describing the asymptotics of the estimator of β which optimizes the objective function. We illustrate this with a moving average process.     

Approximations by convolutions and antiderivatives

Let g be a given function in L ¹ = L ¹(0, 1), and let B be one of the spaces L ^p (0, 1), 1 ≤ p < ∞, or C ₀[0, 1]. We prove that the set of all convolutions f * g, f ∈ B, is dense in B if and only if g is nontrivial in an arbitrary right neighborhood of zero. Under an additional restriction on g, we prove the equivalence in B of the systems f _n * g and I f _n , where f _n ∈ L ¹, n ∈ ?, and I f = f * 1 is the antiderivative of f. As a consequence, we obtain criteria for the completeness and basis property in B of subsystems of antiderivatives of g.     

Asymptotic properties of plug-in level set estimators for right censored data

We assume T1,...,Tn are i.i.d.data sampled from distribution function F with density function f and C1,...,Cn are i.i.d.data sampled from distribution function G.Observed data consists of pairs(Xi,δi),i=1,...,n,where Xi=min{Ti,Ci},δi=I(Ti Ci),I(A)denotes the indicator function of the set A.Based on the right censored data{Xi,δi},i=1,...,n,we consider the problem of estimating the level set{f c}of an unknown one-dimensional density function f and study the asymptotic behavior of the plug-in level set estimators.Under some regularity conditions,we establish the asymptotic normality and the exact convergence rate of theλg-measure of the symmetric difference between the level set{f c}and its plug-in estimator{fn c},where f is the density function of F,and fn is a kernel-type density estimator of f.Simulation studies demonstrate that the proposed method is feasible.Illustration with a real data example is also provided.     

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.     

Löwner expansions

A fundamental problem is to estimate the logarithmic coefficients of a power series with constant coefficient zero which represents a function which has distinct values at distinct points of the unit disk. A source of estimates is an expansion theorem for the Löwner equations which is obtained from a study of contractive substitutions in Hilbert spaces of analytic functions. The methods are an outgrowth of the theory of square summable power series [1]. Assume that σ_n is a given function of nonnegative integers n, with nonnegative values, such that σ₀ = 0 and such that σ_{n ? 1} ? σ_n when n is positive. Infinite values are allowed. The underlying Hilbert space is the set $\text{G}$_σ(0) of equivalence classes of power series f(z) = ∑ a_nzⁿ with constant coefficient zero such that f(z)²_{$\text{G}$σ⁽⁰⁾} = ∑(n/σ_n)|a_n|² is finite. Equivalence of power series f(z) and g(z) means that the coefficient of zⁿ in f(z) is equal to the coefficient of zⁿ in g(z) when σ_n is finite.     

Sur les entiers dont la somme des chiffres est moyenne

The goal of this paper is to study sets of integers with an average sum of digits. More precisely, let g be a fixed integer, s(n) be the sum of the digits of n in basis g. Let f:N→N such that, in any interval [g^ν,g^ν+1[, f(n) is constant and near from (g-1)ν/2. We give an asymptotic for the number of integers n<x such that s(n)=f(n) and we prove that for every irrational α the sequence (αn) is equidistributed mod 1, for n satisfying s(n)=f(n).     

Stirling polynomials

An investigation is made of the polynomials f_k(n) = S(n + k, n) and g_k(n) = (?1)^ks(n, n ? k), where S and s denote the Stirling numbers of the second and first kind, respectively. The main result gives a combinatorial interpretation of the coefficients of the polynomial (1 ? x)^2k+1Σ_n=0^∞f_k(n)xⁿ analogous to the well-known combinatorial interpretation of the Eulerian numbers in terms of descents of permutations.     

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.     

On strong chains of uncountable functions

For functionsf,g:ω₁ → ω₁, where ω₁ is the first uncountable cardinal, we write thatf?g if and only if {ξ ∈ ω₁ :f(ξ)≥g(ξ)} is finite. We prove the consistency of the existence of a well-ordered increasing ?-chain of length ω₁₂, solving a problem of A. Hajnal. The methods previously developed by us involveforcing with side conditions in morasses which is a variation on Todorcevic'sforcing with models as side conditions. The paper is self-contained and requires from the reader knowledge of Kunen's textbook and some basic experience with proper forcing and elementary submodels.