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.”     

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.     

Global existence of real roots and random Newton flow algorithm for nonlinear system of equations

To solve nonlinear system of equation, F(x) = 0, a continuous Newton flow x _t (t) = V (x) = ?(DF(x))^?1 F(x), x(0) = x ⁰ and its mathematical properties, such as the central field, global existence and uniqueness of real roots and the structure of the singular surface, are studied. We concisely introduce random Newton flow algorithm (NFA) for finding all roots, based on discrete Newton flow x ^j+1 = x ^j + hV (x ^j ) with random initial value x ⁰ and h ∈ (0, 1], and three computable quantities, g _j , d _j and K _j . The numerical experiments with dimension n = 300 are provided.     

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.     

On vanishing coefficients of algebraic power series over fields of positive characteristic

Let K be a field of characteristic p>0 and let f(t ₁,…,t _d ) be a power series in d variables with coefficients in K that is algebraic over the field of multivariate rational functions K(t ₁,…,t _d ). We prove a generalization of both Derksen’s recent analogue of the Skolem–Mahler–Lech theorem in positive characteristic and a classical theorem of Christol, by showing that the set of indices (n ₁,…,n _d )∈? ^d for which the coefficient of \(t_{1}^{n_{1}}\cdots t_{d}^{n_{d}}\) in f(t ₁,…,t _d ) is zero is a p-automatic set. Applying this result to multivariate rational functions leads to interesting effective results concerning some Diophantine equations related to S-unit equations and more generally to the Mordell–Lang Theorem over fields of positive characteristic.     

Systems that generate solutions with a small period

Let (j₁,..., j_n) be a permutation of the n-tuple (1, ..., n). A system of differential equations \(\dot x = {f_i}\left( {{x_{{j_i}}}} \right),i = 1, \ldots ,n\) in which each function f_i is continuous on ? is considered. This system is said to have the property of generation of solutions with a small period if, for any number M > 0, there exists a number ω₀ = ω₀(M) > 0 such that if 0 < ω ≤ ω₀ and h_i(t, x₁, ..., x_n) are continuous functions on ? × ?ⁿ ω-periodic in t that satisfy the inequalities |h_i| ≤ M the system \(\dot x = {f_i}\left( {{x_{{j_i}}}} \right),i = 1, \ldots ,n\) has an ω-periodic solution. It is shown that a system has the property of generation of solutions with a small period if and only if f_i(?) = ? for i = 1,..., n. It is also shown that the smallness condition on the period is essential.     

Solvability of Mixed Problems for the Klein–Gordon–Fock Equation in the Class <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> for <Emphasis Type="Italic">p</Emphasis> ≥ 1

We prove that the mixed problem for the Klein–Gordon–Fock equation u _tt (x, t) ? u _xx (x, t) + au(x, t) = 0, where a ≥ 0, in the rectangle Q _T = [0 ≤ x ≤ l] × [0 ≤ t ≤ T] with zero initial conditions and with the boundary conditions u(0, t) = μ(t) ∈ L _p [0, T ], u(l, t) = 0, has a unique generalized solution u(x, t) in the class L _p (Q _T ) for p ≥ 1. We construct the solution in explicit analytic form.     

On random arithmetical functions. I

Let A _Q be the group of complex unit roots of an integer order \( Q \geqslant 2 \). Let \( {\xi_p}\left( {p \in \mathcal{P}} \right) \) be independent random variables distributed uniformly on the set A _Q , where \( \mathcal{P} \)is the set of primes. Let f be a completely multiplicative function defined on \( \mathcal{P} \) by f(p) = ξ _p . We investigate the summatory function of f(n) and the density of those n for which f(n + j) = κ _j (j = 0, …, t), where κ _j ∈ A _Q .     

Singularly perturbed two-dimensional parabolic problem in the case of intersecting roots of the reduced equation

The singularly perturbed parabolic equation ?u _t + ε²Δu ? f(u, x, ε) = 0, x ∈ D ? ?², t > 0 with Robin conditions on the boundary of D is considered. The asymptotic stability as t → ∞ and the global domain of attraction are analyzed for the stationary solution whose limit as ε → 0 is a nonsmooth solution to the reduced equation f(u, x, 0) = 0 that consists of two intersecting roots of this equation.     

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.     

On criteria of estimation of the errors of cubature formulas

The paper considers cubature formulas for calculating integrals of functions f(X), X = (x ₁, …, x _n ) which are defined on the n-dimensional unit hypercube K ⁿ = [0, 1] ⁿ and have integrable mixed derivatives of the kind \(\partial _{\begin{array}{*{20}c} {\alpha _1 \alpha _n } \\ {x_1 , \ldots , x_n } \\ \end{array} } f(X)\), 0 ≤ α _j ≤ 2. We estimate the errors R[f] = \(\smallint _{K^n } \) f(X)dX ? Σ _{k = 1} ^N c _k f(X(k)) of cubature formulas (c _k > 0) as functions of the weights c _k of nodes X(k) and properties of integrable functions. The error is estimated in terms of the integrals of the derivatives of f over r-dimensional faces (r≤n) of the hypercube K ⁿ : |R(f)| ≤ \(\sum _{\alpha _j } \) G(α _j )\(\int_{K^r } {\left| {\partial _{\begin{array}{*{20}c} {\alpha _1 \alpha _n } \\ {x_1 , \ldots , x_n } \\ \end{array} } f(X)} \right|} \) dX _r , where coefficients G(α _j ) are criteria which depend only on parameters c _k and X(k). We present an algorithm to calculate these criteria in the two- and n-dimensional cases. Examples are given. A particular case of the criteria is the discrepancy, and the algorithm proposed is a generalization of those used to compute the discrepancy. The results obtained can be used for optimization of cubature formulas as functions of c _k and X(k).     

Connecting orbits of Lagrangian systems in a nonstationary force field

We study connecting orbits of a natural Lagrangian system defined on a complete Riemannian manifold subjected to the action of a nonstationary force field with potential U(q, t) = f(t)V(q). It is assumed that the factor f(t) tends to ∞ as t→±∞ and vanishes at a unique point t ₀ ∈ ?. Let X ₊, X _? denote the sets of isolated critical points of V (x) at which U(x, t) as a function of x distinguishes its maximum for any fixed t > t ₀ and t < t ₀, respectively. Under nondegeneracy conditions on points of X _± we prove the existence of infinitely many doubly asymptotic trajectories connecting X _? and X ₊.     

Hyperquasipolynomials for the Theta-Function

Let g be a linear combination with quasipolynomial coefficients of shifts of the Jacobi theta function and its derivatives in the argument. All entire functions f: ? → ? satisfying f(x+y)g(x?y) = α₁(x)β₁(y)+· · ·+α_r(x)β_r(y) for some r ∈ ? and α_j, β_j: ? → ? are described.     

A Riemann-Hilbert Approach to the Chen-Lee-Liu Equation on the Half Line

In this paper, the Fokas unified method is used to analyze the initial-boundary value for the Chen- Lee-Liu equation

$i{\partial _t}u + {\partial_{xx}u - i |u{|^2}{\partial _x}u = 0}$

on the half line (?∞, 0] with decaying initial value. Assuming that the solution u(x, t) exists, we show that it can be represented in terms of the solution of a matrix Riemann-Hilbert problem formulated in the plane of the complex spectral parameter λ. The jump matrix has explicit (x, t) dependence and is given in terms of the spectral functions {a(λ), b(λ)} and {A(λ), B(λ)}, which are obtained from the initial data u₀(x) = u(x, 0) and the boundary data g₀(t) = u(0, t), g₁(t) = u_x(0, t), respectively. The spectral functions are not independent, but satisfy a so-called global relation.

     

A tracing of the fractional temperature field

This paper is devoted to a study of L~q-tracing of the fractional temperature field u(t, x)—the weak solution of the fractional heat equation(?_t +(-?_x)~α)u(t, x) = g(t, x) in L~p(R_+~(1+n)) subject to the initial temperature u(0, x) = f(x) in L~p(R~n).     

Inverse problem with nonlocal observation of finding the coefficient multiplying <Emphasis Type="Italic">u</Emphasis> <Subscript> <Emphasis Type="Italic">t</Emphasis> </Subscript> in the parabolic equation

We study the inverse problem of the reconstruction of the coefficient ?(x, t) = ?⁰(x, t) + r(x) multiplying u_t in a nonstationary parabolic equation. Here ?⁰(x, t) ≥ ?⁰ > 0 is a given function, and r(x) ≥ 0 is an unknown function of the class L_∞(Ω). In addition to the initial and boundary conditions (the data of the direct problem), we pose the problem of nonlocal observation in the form ∫₀^Tu(x, t) dμ(t) = χ(x) with a known measure dμ(t) and a function χ(x). We separately consider the case dμ(t) = ω(t)dt of integral observation with a smooth function ω(t). We obtain sufficient conditions for the existence and uniqueness of the solution of the inverse problem, which have the form of ready-to-verify inequalities. We suggest an iterative procedure for finding the solution and prove its convergence. Examples of particular inverse problems for which the assumptions of our theorems hold are presented.     

Commutators with idempotent values on multilinear polynomials in prime rings

Let R be a prime ring of characteristic different from 2, C its extended centroid, d a nonzero derivation of R, f(x ₁, . . . , x _n ) a multilinear polynomial over C, ρ a nonzero right ideal of R and m > 1 a fixed integer such that

$$\qquad \left ([d(f(r_{1},\ldots ,r_{n})),f(r_{1},\ldots ,r_{n})]\right )^{m}=[d(f(r_{1},\ldots ,r_{n})),f(r_{1},\ldots ,r_{n})] $$

for all r ₁, . . . , r _n ∈ρ. Then either [f(x ₁,…,x _n ),x _n+1]x _n+2 is an identity for ρ or d(ρ)ρ = 0.

     

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.     

An improvement of the five halves theorem of J. Boardman

Let (M ^m , T) be a smooth involution on a closed smooth m-dimensional manifold and F = ∪ _j=0 ⁿ F ^j (n ≤ m) its fixed point set, where F ^j denotes the union of those components of F having dimension j. The famous Five Halves Theorem of J. Boardman, announced in 1967, establishes that, if F is nonbounding, then m ≤ 5/2n. In this paper we obtain an improvement of the Five Halves Theorem when the top dimensional component of F, F ⁿ , is nonbounding. Specifically, let ω = (i ₁, i ₂, …, i _r ) be a non-dyadic partition of n and s _ω (x ₁, x ₂, …, x _n ) the smallest symmetric polynomial over Z ₂ on degree one variables x ₁, x ₂, …, x _n containing the monomial \(x_1^{i_1 } x_2^{i_2 } \cdots x_r^{i_r }\). Write s _ω (F ⁿ ) ∈ H ⁿ (F ⁿ , Z ₂) for the usual cohomology class corresponding to s _ω (x ₁, x ₂, …, x _n ), and denote by ?(F ⁿ ) the minimum length of a nondyadic partition ω with s _ω (F ⁿ ) ≠ 0 (here, the length of ω = (i ₁, i ₂, …, i _r ) is r). We will prove that, if (M ^m , T) is an involution for which the top dimensional component of the fixed point set, F ⁿ , is nonbounding, then m ≤ 2n + ?(F ⁿ ); roughly speaking, the bound for m depends on the degree of decomposability of the top dimensional component of the fixed point set. Further, we will give examples to show that this bound is best possible.