Equiconvergence of expansions in multiple Fourier series and in fourier integrals with “lacunary sequences of partial sums”

We investigate the equiconvergence on T^N = [?π, π)^N of expansions in multiple trigonometric Fourier series and in the Fourier integrals of functions f ∈ L_p(T^N) and g ∈ L_p(R^N), p > 1, N ≥ 3, g(x) = f(x) on T^N, in the case where the “partial sums” of these expansions, i.e., S_n(x; f) and J_α(x; g), respectively, have “numbers” n ∈ Z^N and α ∈ R^N (n_j = [α_j], j = 1,..., N, [t] is the integral part of t ∈ R¹) containing N ? 1 components which are elements of “lacunary sequences.”     

Asymptotic behavior of the spectrum of one-dimensional vibrations in a layered medium consisting of elastic and Kelvin–Voigt viscoelastic materials

For every algebraically closed field k of characteristic different from 2, we prove the following: (1) Finite-dimensional (not necessarily associative) k-algebras of general type of a fixed dimension, considered up to isomorphism, are parametrized by the values of a tuple of algebraically independent (over k) rational functions of the structure constants. (2) There exists an “algebraic normal form” to which the set of structure constants of every such algebra can be uniquely transformed by means of passing to its new basis—namely, there are two finite systems of nonconstant polynomials on the space of structure constants, {f_i}i∈I and {b_j}j∈J, such that the ideal generated by the set {f_i}i∈I is prime and, for every tuple c of structure constants satisfying the property b_j(c) ≠ 0 for all j ∈ J, there exists a unique new basis of this algebra in which the tuple c′ of its structure constants satisfies the property f_i(c′) = 0 for all i ∈ I.     

A Probabilistic Characterization of the Dominance Order on Partitions

We present a probabilistic characterization of the dominance order on partitions. Let ν be a partition and Y _ν its Ferrers diagram, i.e. a stack of rows of cells with row i containing ν _i cells. Let the cells of Y _ν be filled with independent and identically distributed draws from the random variable X = B i n(r, p) with r ≥ 1 and p ∈ (0, 1). Given j, t ≥ 0, let P(ν, j, t) be the probability that the sum of all the entries in Y _ν is j while the sum of the entries in each row of Y _ν is no more than t. It is shown that if ν and μ are two partitions of n, ν dominates μ if and only if P(ν, j, t) ≤ P(μ, j, t) for all j, t ≥ 0. It is shown that the same result holds if X is any log-concave integer valued random variable with {i : P(X = i) > 0} = {0, 1,…,r} for some r ≥ 1.     

Block partitions of sequences

Given a sequence A = (a ₁, …, a _n ) of real numbers, a block B of A is either a set B = {a _i , a _i+1, …, a _j } where i ≤ j or the empty set. The size b of a block B is the sum of its elements. We show that when each a _i ∈ [0, 1] and k is a positive integer, there is a partition of A into k blocks B ₁, …, B _k with |b _i ?b _j | ≤ 1 for every i, j. We extend this result in several directions.     

A Note on Campanato Spaces and Their Applications

In this paper, we obtain a version of the John–Nirenberg inequality suitable for Campanato spaces C_p,β with 0 < p < 1 and show that the spaces C_p,β are independent of the scale p ∈ (0,∞) in sense of norm when 0 < β < 1. As an application, we characterize these spaces by the boundedness of the commutators [b,B _α ] _j (j = 1, 2) generated by bilinear fractional integral operators B _α and the symbol b acting from L_p1 × L_p2 to L ^q for p1, p2 ∈ (1,∞), q ∈ (0,∞) and 1/q = 1/p1 + 1/p2 ? (α + β)/n.     

New algorithm for computing the Hermite interpolation polynomial

Let x ₀, x ₁,? , x _n , be a set of n + 1 distinct real numbers (i.e., x _i ≠ x _j , for i ≠ j) and y _{i, k} , for i = 0,1,? , n, and k = 0 ,1 ,? , n _i , with n _i ≥ 1, be given of real numbers, we know that there exists a unique polynomial p _{N ? 1}(x) of degree N ? 1 where \(N={\sum }_{i=0}^{n}(n_{i}+1)\), such that \(p_{N-1}^{(k)}(x_{i})=y_{i,k}\), for i = 0,1,? , n and k = 0,1,? , n _i . P _N?1(x) is the Hermite interpolation polynomial for the set {(x _i , y _{i, k} ), i = 0,1,? , n, k = 0,1,? , n _i }. The polynomial p _N?1(x) can be computed by using the Lagrange polynomials. This paper presents a new method for computing Hermite interpolation polynomials, for a particular case n _i = 1. We will reformulate the Hermite interpolation polynomial problem and give a new algorithm for giving the solution of this problem, the Matrix Recursive Polynomial Interpolation Algorithm (MRPIA). Some properties of this algorithm will be studied and some examples will also be given.     

On a question of Sárközy on gaps of product sequences

Motivated by a question of Sárközy, we study the gaps in the product sequence B = A · A = {b ₁ < b ₂ < …} of all products a _i a _j with a _i , a _j ∈ A when A has upper Banach density α > 0. We prove that there are infinitely many gaps b _n+1 ? b _n ? α ^?3 and that for t ≥ 2 there are infinitely many t-gaps b _n+t ? b _n ? t ² α ^?4. Furthermore, we prove that these estimates are best possible.We also discuss a related question about the cardinality of the quotient set A/A = {a _i /a _j , a _i , a _j ∈ A} when A ? {1, …, N} and |A| = αN.     

Acyclic edge coloring of planar graphs without adjacent cycles

A proper edge coloring of a graph G is said to be acyclic if there is no bicolored cycle in G.The acyclic edge chromatic number of G,denoted byχ′a(G),is the smallest number of colors in an acyclic edge coloring of G.Let G be a planar graph with maximum degree.In this paper,we show thatχ′a(G)+2,if G has no adjacent i-and j-cycles for any i,j∈{3,4,5},which implies a result of Hou,Liu and Wu(2012);andχ′a(G)+3,if G has no adjacent i-and j-cycles for any i,j∈{3,4,6}.     

Hausdorff dimension of the maximal run-length in dyadic expansion

For any x ∈ [0, 1), let x = [? ₁, ? ₂, …,] be its dyadic expansion. Call r _n (x):= max{j ? 1: ? _i+1 = … = ? _i+j = 1, 0 ? i ? n ? j} the n-th maximal run-length function of x. P.Erdös and A.Rényi showed that \(\mathop {\lim }\limits_{n \to \infty } \) r _n (x)/log₂ n = 1 almost surely. This paper is concentrated on the points violating the above law. The size of sets of points, whose runlength function assumes on other possible asymptotic behaviors than log₂ n, is quantified by their Hausdorff dimension.     

Two-Sided Estimates of Fourier Sums Lebesgue Functions with Respect to Polynomials Orthogonal on Nonuniform Grids

Let Ω = {t₀, t₁, …, t_N} and Ω_N = {x₀, x₁, …, x_N–1}, where x_j = (t_j + t_{j + 1})/2, j = 0, 1, …, N–1 be arbitrary systems of distinct points of the segment [–1, 1]. For each function f(x) continuous on the segment [–1, 1], we construct discrete Fourier sums S_{n, N}( f, x) with respect to the system of polynomials {p?_k,N(x)} _k=0 ^N–1 , forming an orthonormal system on nonuniform point systems Ω_N consisting of finite number N of points from the segment [–1, 1] with weight Δt_j = t_{j + 1}–t_j. We find the growth order for the Lebesgue function L_n,N (x) of the considered partial discrete Fourier sums S_n,N ( f, x) as n = O(δ _N ^?2/7 ), δ_N = max_{0≤ j≤N?1} Δt_j More exactly, we have a two-sided pointwise estimate for the Lebesgue function L_{n, N}(x), depending on n and the position of the point x from [–1, 1].     

On the Wick theorem for mixtures of centered Gaussian distributions

We consider centered conditionally Gaussian d-dimensional vectors X with random covariance matrix Ξ having an arbitrary probability distribution law on the set of nonnegative definite symmetric d × d matrices M _d ⁺. The paper deals with the evaluation problem of mean values \( E\left[ {\prod\nolimits_{i = 1}^{2n} {\left( {{c_i},X} \right)} } \right] \) for c _i ∈ ? ^d , i = 1, …, 2n, extending the Wick theorem for a wide class of non-Gaussian distributions. We discuss in more detail the cases where the probability law ?(Ξ) is infinitely divisible, the Wishart distribution, or the inverse Wishart distribution. An example with Ξ \( = \sum\nolimits_{j = 1}^m {{Z_j}{\sum_j}} \), where random variables Z _j , j = 1, …, m, are nonnegative, and Σ _j ∈ M _d ⁺, j = 1, …, m, are fixed, includes recent results from Vignat and Bhatnagar, 2008.     

Erdős measures on the Euclidean space and on the group of <Emphasis Type="Italic">A</Emphasis>-adic integers

Let A ∈ M _n (?) be a matrix with eigenvalues greater than 1 in absolute value. The ? ⁿ -valued random variables ξ _t , t ∈ ?, are i.i.d., and P(ξ _t = j) = p _j , j ∈ ? ⁿ , 0 < p ₀ < 1, ∑ _j p _j = 1. We study the properties of the distributions of the ? ⁿ -valued random variable ζ ₁ = ∑ _t=1 ^∞ A ^?t ξ _t and of the random variable ζ = ∑ _t=0 ^∞ A ^t ξ _?t taking integer A-adic values. We obtain a necessary and sufficient condition for the absolute continuity of these distributions. We define an invariant Erd?s measure on the compact abelian group of A-adic integers. We also define an A-invariant Erd?s measure on the n-dimensional torus. We show the connection between these invariant measures and functions of countable stationary Markov chains. In the case when |{j: p _j ≠ 0}| < ∞, we establish the relation between these invariant measures and finite stationary Markov chains.     

Thompson’s conjecture for the alternating group of degree 2<Emphasis Type="Italic">p</Emphasis> and 2<Emphasis Type="Italic">p</Emphasis>+1

For a finite group G denote by N(G) the set of conjugacy class sizes of G. In 1980s, J.G.Thompson posed the following conjecture: If L is a finite nonabelian simple group, G is a finite group with trivial center and N(G) = N(L), then G ? L. We prove this conjecture for an infinite class of simple groups. Let p be an odd prime. We show that every finite group G with the property Z(G) = 1 and N(G) = N(A _i ) is necessarily isomorphic to A _i , where i ∈ {2p, 2p + 1}.     

On multiple zeros of a partial theta function

We consider the partial theta function θ(q, x) := ∑_j=0^∞q^j(j+1)/2x^j, where x ∈ ? is a variable and q ∈ ?, 0 < |q| < 1, is a parameter. We show that, for any fixed q, if ζ is a multiple zero of the function θ(q, · ), then |ζ| ≤ 8¹¹.     

Series by Haar system with monotone coefficients

Let χ = {χ _n } _n=0 ^∞ be the Haar system normalized in L ²(0, 1) and M = {M _s } _s=1 ^∞ be an arbitrary, increasing sequence of nonnegative integers. For any subsystem of χ of the form {φ _k } = χS = {χ _n } _n∈S , where S = S(M) = {n _k } _k=1 ^∞ = {n ∈ V[p]: p ∈ M}, V[0] = {1, 2} and V[p] = {2 ^p + 1, 2 ^p + 2, …, 2 ^p+1} for p = 1, 2, … a series of the form Σ _i=1 ^∞ a _i φ _i with a _i ↘ 0 is constructed, that is universal with respect to partial series in all classes L ^r (0, 1), r ∈ (0, 1), in the sense of a.e. convergence and in the metric ofL ^r (0, 1). The constructed series is universal in the class of all measurable, finite functions on [0, 1] in the sense of a.e. convergence. It is proved that there exists a series by Haar system with decreasing coefficients, which has the following property: for any ? > 0 there exists a measurable function µ(x), x ∈ [0, 1], such that 0 ≤ µ(x) ≤ 1 and |{x ∈ [0, 1], µ(x) ≠ = 1}| < ?, and the series is universal in the weighted space L _µ[0, 1] with respect to subseries, in the sense of convergence in the norm of L _µ[0, 1].     

The optimal solution set of the interval linear programming problems

Several methods exist for solving the interval linear programming (ILP) problem. In most of these methods, we can only obtain the optimal value of the objective function of the ILP problem. In this paper we determine the optimal solution set of the ILP as the intersection of some regions, by the best and the worst case (BWC) methods, when the feasible solution components of the best problem are positive. First, we convert the ILP problem to the convex combination problem by coefficients 0 ≤ λ _j , μ _ij , μ _i  ≤ 1, for i = 1, 2, . . . , m and j = 1, 2, . . . , n. If for each i, j, μ _ij  = μ _i  = λ _j  = 0, then the best problem has been obtained (in case of minimization problem). We move from the best problem towards the worst problem by tiny variations of λ _j , μ _ij and μ _i from 0 to 1. Then we solve each of the obtained problems. All of the optimal solutions form a region that we call the optimal solution set of the ILP. Our aim is to determine this optimal solution set by the best and the worst problem constraints. We show that some theorems to validity of this optimal solution set.     

Designs associated with maximum independent sets of a graph

A (v, β _o , μ)-design over regular graph G = (V, E) of degree d is an ordered pair D = (V, B), where |V| = v and B is the set of maximum independent sets of G called blocks such that if i, j ∈ V, i ≠ j and if i and j are not adjacent in G then there are exactly μ blocks containing i and j. In this paper, we study (v, β _o , μ)-designs over the graphs K _n × K _n , T(n)-triangular graphs, L ₂(n)-square lattice graphs, Petersen graph, Shrikhande graph, Clebsch graph and the Schläfli graph and non-existence of (v, β _o , μ)-designs over the three Chang graphs T ₁(8), T ₂(8) and T ₃(8).     

On the optimal robust solution of IVPs with noisy information

We investigate the optimal solution of systems of initial-value problems with smooth right-hand side functions f from a Hölder class \(F^{r,\varrho }_{\text {reg}}\), where r ≥ 0 is the number of continuous derivatives of f, and ? ∈ (0, 1] is the Hölder exponent of rth partial derivatives. We consider algorithms that use n evaluations of f, the ith evaluation being corrupted by a noise δ_i of deterministic or random nature. For δ ≥ 0, in the deterministic case the noise δ_i is a bounded vector, ∥δ_i∥≤δ. In the random case, it is a vector-valued random variable bounded in average, (E(∥δ_i∥^q))^1/q ≤ δ, q ∈ [1, + ∞). We point out an algorithm whose L_p error (p ∈ [0, + ∞]) is O(n ^{? (r + ?)} + δ), independently of the noise distribution. We observe that the level n ^{? (r + ?)} + δ cannot be improved in a class of information evaluations and algorithms. For ε > 0, and a certain model of δ-dependent cost, we establish optimal values of n(ε) and δ(ε) that should be used in order to get the error at most ε with minimal cost.     

On existence of a universal function for <Emphasis Type="Italic">L</Emphasis> <Superscript> <Emphasis Type="Italic">p</Emphasis> </Superscript>[0, 1] with <Emphasis Type="Italic">p</Emphasis>∈(0, 1)

We show that, for every number p ∈ (0, 1), there is g ∈ L¹[0, 1] (a universal function) that has monotone coefficients c_k(g) and the Fourier–Walsh series convergent to g (in the norm of L¹[0, 1]) such that, for every f ∈ L^p[0, 1], there are numbers δ_k = ±1, 0 and an increasing sequence of positive integers N_q such that the series ∑ _k=0^+∞δ_kc_k(g)W_k (with {W_k} theWalsh system) and the subsequence \(\sigma _{{N_q}}^{\left( \alpha \right)}\), α ∈ (?1, 0), of its Cesáro means converge to f in the metric of L^p[0, 1].     

K?hler Manifolds with Almost Non-negative Ricci Curvature

Compact Kähler manifolds with semi-positive Ricci curvature have been investigated by various authors. From Peternell’s work, if M is a compact Kähler n-manifold with semi-positive Ricci curvature and finite fundamental group, then the universal cover has a decomposition \( \ifmmode\expandafter\tilde\else\expandafter\~\fi{M} \cong X_{1} \times \cdots \times X_{m} \), where X _j is a Calabi-Yau manifold, or a hyperKähler manifold, or X _j satisfies H ⁰(X _j , Ω ^p ) = 0. The purpose of this paper is to generalize this theorem to almost non-negative Ricci curvature Kähler manifolds by using the Gromov-Hausdorff convergence. Let M be a compact complex n-manifold with non-vanishing Euler number. If for any ∈ > 0, there exists a Kähler structure (J _∈, g _∈) on M such that the volume \({\text{Vol}}_{{g_{ \in } }} {\left( M \right)} < V\), the sectional curvature |K(g _∈)| < Λ², and the Ricci-tensor Ric(g _∈)> ?∈g _∈, where V and Λ are two constants independent of ∈. Then the fundamental group of M is finite, and M is diffeomorphic to a complex manifold X such that the universal covering of X has a decomposition, \( \ifmmode\expandafter\tilde\else\expandafter\~\fi{X} \cong X_{1} \times \cdots \times X_{s} \), where X _i is a Calabi-Yau manifold, or a hyperKähler manifold, or X _i satisfies H ⁰(X _i , Ω ^p ) = {0}, p > 0.