Solving Equations of Free Vibration for a Cylindrical Shell Rotating on Rollers by the Fourier Method

The small free vibrations of an infinite circular cylindrical shell rotating about its axis at a constant angular velocity are considered. The shell is supported on n absolutely rigid cylindrical rollers equispaced on its circle. The roller-supported shell is a model of an ore benefication centrifugal concentrator with a floating bed. The set of linear differential equations of vibrations is sought in the form of a truncated Fourier series containing N terms along the circumferential coordinate. A system of 2N–n linear homogeneous algebraic equations with 2N–n unknowns is derived for the approximate estimation of vibration frequencies and mode shapes. The frequencies ω _k , k = 1, 2, …, 2N–n, are positive roots of the (2N–n)th-order algebraic equation D(ω²) = 0, where D is the determinant of this set. It is shown that the system of 2N–n equations is equivalent to several independent systems with a smaller number of unknowns. As a consequence, the (2N–n)th-order determinant D can be written as a product of lower-order determinants. In particular, the frequencies at N = n are the roots of algebraic equations of an order is lower than 2 and can be found in an explicit form. Some frequency estimation algorithms have been developed for the case of N > n. When N increases, the number of found frequencies also grows, and the frequencies determined at N = n are refined. However, in most cases, the vibration frequencies can not be found for N > n in an explicit form.     

Stability of nonlocal difference schemes in a subspace

We consider a family of two-layer difference schemes for the heat equation with nonlocal boundary conditions containing the parameter γ. In some interval γ ∈ (1, γ ₊), the spectrum of the main difference operator contains a unique eigenvalue λ ₀ in the left complex half-plane, while the remaining eigenvalues λ ₁, λ ₂, …, λ _N?1 lie in the right half-plane. The corresponding grid space H _N is represented as the direct sum H _N = H ₀⊕H _N?1 of a one-dimensional subspace and the subspace H _N?1 that is the linear span of eigenvectors µ⁽¹⁾, µ⁽²⁾, …, µ^(N?1). We introduce the notion of stability in the subspace H _N?1 and derive a stability criterion.     

Liouville type results for a <Emphasis Type="Italic">p</Emphasis>-Laplace equation with negative exponent

Positive entire solutions of the equation \(\Delta _p u = u^{ - q} in \mathbb{R}^N (N \geqslant 2)\) where 1 < p ≤ N, q > 0, are classified via their Morse indices. It is seen that there is a critical power q = q _c such that this equation has no positive radial entire solution that has finite Morse index when q > q _c but it admits a family of stable positive radial entire solutions when 0 < q ≤ q _c. Proof of the stability of positive radial entire solutions of the equation when 1 < p < 2 and 0 < q ≤ q _c relies on Caffarelli–Kohn–Nirenberg’s inequality. Similar Liouville type result still holds for general positive entire solutions when 2 < p ≤ N and q > q _c. The case of 1 < p < 2 is still open. Our main results imply that the structure of positive entire solutions of the equation is similar to that of the equation with p = 2 obtained previously. Some new ideas are introduced to overcome the technical difficulties arising from the p-Laplace operator.     

Spectral multipliers for sub-Laplacians on solvable extensions of stratified groups

Let G = N ? A, where N is a stratified group and A = ? acts on N via automorphic dilations. Homogeneous sub-Laplacians on N and A can be lifted to left-invariant operators on G, and their sum is a sub-Laplacian Δ on G. We prove a theorem of Mihlin–Hörmander type for spectral multipliers of Δ. The proof of the theorem hinges on a Calderón–Zygmund theory adapted to a sub-Riemannian structure of G and on L¹-estimates of the gradient of the heat kernel associated to the sub-Laplacian Δ.     

Randomness of the square root of 2 and the giant leap,part 2

We prove that the “quadratic irrational rotation” exhibits a central limit theorem. More precisely, let α be an arbitrary real root of a quadratic equation with integer coefficients; say, \(\alpha = \sqrt 2\). Given any rational number 0 < x < 1 (say, x = 1/2) and any positive integer n, we count the number of elements of the sequence α, 2α, 3α, ..., nα modulo 1 that fall into the subinterval [0, x]. We prove that this counting number satisfies a central limit theorem in the following sense. First, we subtract the “expected number” nx from the counting number, and study the typical fluctuation of this difference as n runs in a long interval 1 ≤ n ≤ N. Depending on α and x, we may need an extra additive correction of constant times logarithm of N; furthermore, what we always need is a multiplicative correction: division by (another) constant times square root of logarithm of N. If N is large, the distribution of this renormalized counting number, as n runs in 1 ≤ n ≤ N, is very close to the standard normal distribution (bell shaped curve), and the corresponding error term tends to zero as N tends to infinity. This is the main result of the paper (see Theorem 1.1).     

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

Different prime <Emphasis Type="Italic">N</Emphasis>-ideals and IFP <Emphasis Type="Italic">N</Emphasis>-Ideals

We provide some characterizations of completely prime (completely semiprime) and 3-prime (3-semiprime) N-groups. The relationship between a 3-prime (completely prime) N-ideal P of an N-group Γ and the ideal (P: Γ) of the near-ring N is investigated. Moreover, the notion of IFP N-ideal is defined. We prove that the concept of IFP N-ideal occurs naturally where N is a left permutable (left self distributive, subcommutative) near-ring and Γ a monogenic N-group. Also, we obtain some relationships between an IFP N-ideal P of an N-group Γ and the ideal (P: Γ) of the near-ring N.     

Hirzebruch Functional Equation: Classification of Solutions

The Hirzebruch functional equation is \(\sum\nolimits_{i = 1}^n {\prod\nolimits_{j \ne i} {(1/f({z_j} - {z_i})) = c} } \) with constant c and initial conditions f(0) = 0 and f'(0) = 1. In this paper we find all solutions of the Hirzebruch functional equation for n ≤ 6 in the class of meromorphic functions and in the class of series. Previously, such results have been known only for n ≤ 4. The Todd function is the function determining the two-parameter Todd genus (i.e., the χ_a,b-genus). It gives a solution to the Hirzebruch functional equation for any n. The elliptic function of level N is the function determining the elliptic genus of level N. It gives a solution to the Hirzebruch functional equation for n divisible by N. A series corresponding to a meromorphic function f with parameters in U ? ?^k is a series with parameters in the Zariski closure of U in ?^k, such that for the parameters in U it coincides with the series expansion at zero of f. The main results are as follows: (1) Any series solution of the Hirzebruch functional equation for n = 5 corresponds either to the Todd function or to the elliptic function of level 5. (2) Any series solution of the Hirzebruch functional equation for n = 6 corresponds either to the Todd function or to the elliptic function of level 2, 3, or 6. This gives a complete classification of complex genera that are fiber multiplicative with respect to ?P^n?1 for n ≤ 6. A topological application of this study is an effective calculation of the coefficients of elliptic genera of level N for N = 2,..., 6 in terms of solutions of a differential equation with parameters in an irreducible algebraic variety in ?⁴.     

Analysis of some numerical methods on layer adapted meshes for singularly perturbed quasilinear systems

We consider a coupled system of first-order singularly perturbed quasilinear differential equations with given initial conditions. The leading term of each equation is multiplied by a distinct small positive parameter, which induces overlapping layers. The quasilinear system is discretized by using first and second order accurate finite difference schemes for which we derive general error estimates in the discrete maximum norm. As consequences of these error estimates we establish nodal convergence of O((N ^?1 lnN) ^p ),p=1,2, on the Shishkin mesh and O(N ^?p ),p=1,2, on the Bakhvalov mesh, where N is the number of mesh intervals and the convergence is robust in all of the parameters. Numerical computations are included which confirm the theoretical results.     

Under-recurrence in the Khintchine recurrence theorem

The Khintchine recurrence theorem asserts that in a measure preserving system, for every set A and ε > 0, we have μ(A ∩ T^?nA) ≥ μ(A)² ? ε for infinitely many n ∈ N. We show that there are systems having underrecurrent sets A, in the sense that the inequality μ(A ∩ T^?nA) < μ(A)² holds for every n ∈ N. In particular, all ergodic systems of positive entropy have under-recurrent sets. On the other hand, answering a question of V. Bergelson, we show that not all mixing systems have under-recurrent sets. We also study variants of these problems where the previous strict inequality is reversed, and deduce that under-recurrence is a much more rare phenomenon than over-recurrence. Finally, we study related problems pertaining to multiple recurrence and derive some interesting combinatorial consequences.     

Bilinear approach to <Emphasis Type="Italic">N</Emphasis> = 2 supersymmetric KdV equations

The N = 2 supersymmetric KdV equations are studied within the framework of Hirota bilinear method. For two such equations, namely N = 2, a = 4 and N = 2, a = 1 supersymmetric KdV equations, we obtain the corresponding bilinear formulations. Using them, we construct particular solutions for both cases. In particular, a bilinear Bäcklund transformation is given for the N = 2, a = 1 supersymmetric KdV equation.     

Extensions of representations of integral quadratic forms

Let N and M be quadratic ?-lattices, and K be a sublattice of N. A representation σ:K→M is said to be extensible to N if there exists a representation ρ:N→M such that ρ | _K =σ. We prove in this paper a local–global principle for extensibility of representation, which is a generalization of the main theorems on representations by positive definite ?-lattices by Hsia, Kitaoka and Kneser (J. Reine Angew. Math. 301:132–141, 1978) and Jöchner and Kitaoka (J. Number Theory 48:88–101, 1994). Applications to almost n-universal lattices and systems of quadratic equations with linear conditions are discussed.     

Toward a classification of quasirational solutions of the nonlinear Schrödinger equation

Based on a representation in terms of determinants of the order 2N, we attempt to classify quasirational solutions of the one-dimensional focusing nonlinear Schrödinger equation and also formulate several conjectures about the structure of the solutions. These solutions can be written as a product of a t-dependent exponential times a quotient of two N(N+1)th degree polynomials in x and t depending on 2N?2 parameters. It is remarkable that if all parameters are equal to zero in this representation, then we recover the P_N breathers.     

Difference scheme for an initial–boundary value problem for a singularly perturbed transport equation

An initial–boundary value problem for a singularly perturbed transport equation with a perturbation parameter ε multiplying the spatial derivative is considered on the set ? = G ∪ S, where ? = D? × [0 ≤ t ≤ T], D? = {0 ≤ x ≤ d}, S = S ^l ∪ S, and S ^l and S₀ are the lateral and lower boundaries. The parameter ε takes arbitrary values from the half-open interval (0,1]. In contrast to the well-known problem for the regular transport equation, for small values of ε, this problem involves a boundary layer of width O(ε) appearing in the neighborhood of S ^l ; in the layer, the solution of the problem varies by a finite value. For this singularly perturbed problem, the solution of a standard difference scheme on a uniform grid does not converge ε-uniformly in the maximum norm. Convergence occurs only if h=dN^-1 ? ε and N₀^-1 ? 1, where N and N₀ are the numbers of grid intervals in x and t, respectively, and h is the mesh size in x. The solution of the considered problem is decomposed into the sum of regular and singular components. With the behavior of the singular component taken into account, a special difference scheme is constructed on a Shishkin mesh, i.e., on a mesh that is piecewise uniform in x and uniform in t. On such a grid, a monotone difference scheme for the initial–boundary value problem for the singularly perturbed transport equation converges ε-uniformly in the maximum norm at an ?(N^?1 + N₀^?1) rate.     

The Richardson scheme for the singularly perturbed parabolic reaction-diffusion equation in the case of a discontinuous initial condition

The Dirichlet problem for a singularly perturbed parabolic reaction-diffusion equation with a piecewise continuous initial condition in a rectangular domain is considered. The higher order derivative in the equation is multiplied by a parameter ?², where ? ∈ (0, 1]. When ? is small, a boundary and an interior layer (with the characteristic width ?) appear, respectively, in a neighborhood of the lateral part of the boundary and in a neighborhood of the characteristic of the reduced equation passing through the discontinuity point of the initial function; for fixed ?, these layers have limited smoothness. Using the method of additive splitting of singularities (induced by the discontinuities of the initial function and its low-order derivatives) and the condensing grid method (piecewise uniform grids that condense in a neighborhood of the boundary layers), a finite difference scheme is constructed that converges ?-uniformly at a rate of O(N ^?2ln² N + n ₀ ^?1 ), where N + 1 and N ₀ + 1 are the numbers of the mesh points in x and t, respectively. Based on the Richardson technique, a scheme that converges ?-uniformly at a rate of O(N ^?3 + N ₀ ^?2 ) is constructed. It is proved that the Richardson technique cannot construct a scheme that converges in ?-uniformly in x with an order greater than three.     

Degenerations of Submodules and Composition Series

Let M and N be modules over an artin algebra such that M degenerates to N. We show that any submodule of M degenerates to a submodule of N. This suggests that a composition series of M will in some sense degenerate to a composition series of N. We then study a subvariety of the module variety, consisting of those representations where all matrices are upper triangular. We show that these representations can be seen as representations of composition series, and that the orbit closures describe the above mentioned degeneration of composition series.     

Regular variation of a random length sequence of random variables and application to risk assessment

When assessing risks on a finite-time horizon, the problem can often be reduced to the study of a random sequence C(N) = (C ₁,…,C _N ) of random length N, where C(N) comes from the product of a matrix A(N) of random size N × N and a random sequence X(N) of random length N. Our aim is to build a regular variation framework for such random sequences of random length, to study their spectral properties and, subsequently, to develop risk measures. In several applications, many risk indicators can be expressed from the extremal behavior of ∥C(N)∥, for some norm ∥?∥. We propose a generalization of Breiman’s Lemma that gives way to a tail estimate of ∥C(N)∥ and provides risk indicators such as the ruin probability and the tail index for Shot Noise Processes on a finite-time horizon. Lastly, we apply our main result to a model used in dietary risk assessment and in non-life insurance mathematics to illustrate the applicability of our method.     

<Emphasis Type="Italic">N</Emphasis>-extended symplectic connections in almost contact metric spaces

On a manifold with an almost contact metric structure we introduce the notions of intrinsic connection, N-extended connection and N-connection. It is shown that the Tanaka–Webster and Schouten–van Kampen connections are special cases of N-connection. We define new classes of N-connections, namely, the Vagner connection and canonical metric N-connection. We also define N-extended symplectic connection. It is proved that the N-extended symplectic connection exists on any manifold with a contact metric structure.     

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 the number of nonstationary bounded trajectories of a class of autonomous systems on the plane

We study the number of nonstationary bounded trajectories of autonomous systems of the form z′ = \(\overline {P_n (z)} \), z = x + iy ∈ C, where P _n (z) is a polynomial of degree n with complex coefficients that has k distinct roots, n, k > 1. We prove that the number N of nonstationary bounded trajectories of this system satisfies the following assertions (Theorem 1): (a) N = n + k ? N ₊, N ₊ = N _?, n + 1 ≤ N ₊ ≤ n + k, where N ₊ and N _? are the numbers of system trajectories unbounded as t → +∞ and t → ?∞, respectively; (b) if some r distinct roots \(c_{j_1 } \), ..., \(c_{j_r } \) of the polynomial P _n satisfy the relations V _n+1 (\(c_{j_1 } \)) = ··· = V _n+1 (\(c_{j_r } \)), where V _n+1 is the imaginary part of the indeterminate integral of P _n , then N ≥ \(m_{j_1 } \) + ··· + \(m_{j_r } \) + r ? n ? 1; (c) if k = 2, then the conditions N = 1 and V _n+1 (c ₁) = V _n+1 (c ₂) are equivalent. For n = k = 3, we derive a formula for the number of nonstationary bounded trajectories (Theorem 2).