On the sum of powers of terms of a linear recurrence sequence

Let (F _n ) _n??0 be the Fibonacci sequence given by F _n+2 = F _n+1 + F _n , for n ?? 0, where F ₀ = 0 and F ₁ = 1. There are several interesting identities involving this sequence such as F _n ² + F _n+1 ² = F _2n+1, for all n ?? 0. In a very recent paper, Marques and Togbé proved that if F _n ^s + F _n+1 ^s is a Fibonacci number for all sufficiently large n, then s = 1 or 2. In this paper, we will prove, in particular, that if (G _m ) _m is a linear recurrence sequence (under weak assumptions) and G _n ^s + ... + G _n+k ^s ?? (G _m ) _m , for infinitely many positive integers n, then s is bounded by an effectively computable constant depending only on k and the parameters of G _m .     

The magid-ryan conjecture for 4-dimensional affine spheres

In this paper we prove the Magid-Ryan conjecture for 4-dimensional affine hyperspheres in R⁵. This conjecture states that every affine hypersphere with non-zero Pick invariant and constant sectional curvature is affinely equivalent with either (x ₁ ² ±x ₂ ² )(x ₃ ² ±x ₄ ² ...(x _2m−1 ² ±x _2m ² ) = 1 or (x ₁ ² ±x ₂ ² (x ₃ ² ±x ₄ ² )...(x _2m−1 ² ±x _2m ² )x _2m+1 = 1 where the dimensionn satisfiesn = 2m orn =2m + 1. This conjecture was proved in [11] in case the metric is positive definite and in [2] in case the metric is Lorentzian.     

On a generalization of cyclic semifields

A new construction is given of cyclic semifields of orders q ²ⁿ , n odd, with kernel (left nucleus) and right and middle nuclei isomorphic to , and the isotopism classes are determined. Furthermore, this construction is generalized to produce potentially new semifields of the same general type that are not isotopic to cyclic semifields. In particular, a new semifield plane of order 4⁵ and new semifield planes of order 16⁵ are constructed by this method.     

On the number of solutions of the generalized Ramanujan-Nagell equation D1X2 + DM2 = 2N+2

Let D₁, D₂ be coprime odd integers with min (D₁, D₂) > 1, and let N (D₁, D₂) denote the number of positive integer solutions (x, m, n) of the equation D₁x²+D^m₂ = 2ⁿ⁺². In this paper, we prove that N (D₁, D₂) ≤ 2 except for N (3, 5) = N (5, 3) = 4 and N (13, 3) = N (31, 97) = 3.     

Equally-weighted formulas for numerical differentiation

Equally-weighted formulas for numerical differentiation at a fixed pointx=a, which may be chosen to be 0 without loss in generality, are derived for (1) whereR _2n =0 whenf(x) is any (2n)^th degree polynomial. Equation (1) is equivalent to (2) ,r=1,2,..., 2n. By choosingf(x)=1/(z–x),x _i fori=1,..., n andx _i fori=n+1,..., 2n are shown to be roots ofg _n (z) andh _n (z) respectively, satisfying (3) . It is convenient to normalize withk=(m–1)!. LetP _s (z) denotez ^s · numerator of the (s+1)^th diagonal member of the Padé table fore ^x , frx=1/z, that numerator being a constant factor times the general Laguerre polynomialL _s ^–2s–1 (x), and letP _s (X _i )=0, i=1, ...,s. Then for anym, solutions to (1) are had, for2n=2ms, forx _i , i=1, ...,ms, andx _i , i=ms+1,..., 2ms, equal to all them ^th rootsX _i ^1/m and (–X _i )^1/m respectively, and they give {(2s+1)m–1}^th degree accuracy. For2sm2n(2s+1)m–1, these (2sm)-point solutions are proven to be the only ones giving (2n)^th degree accuracy. Thex _i 's in (1) always include complex values, except whenm=1, 2n=2. For2sm<2n(2s+1)m–1,g _n (z) andh _n (z) are (n–sm)-parameter families of polynomials whose roots include those ofg _ms (z) andh _ms (z) respectively, and whose remainingn–ms roots are the same forg _n (z) andh _n (z). Form>1, and either 2n<2m or(2s+1)m–1<2n<(2s+2)m, it is proven that there are no non-trivial solutions to (1), real or complex. Form=1(1)6, tables ofx _i are given to 15D, fori=1(1)2n, where 2n=2ms ands=1(1) [12/m], so that they are sufficient for attaining at least 24^th degree accuracy in (1).Presented at the Twelfth International Congress of Mathematicians, Stockholm, Sweden, August 15–22, 1962.General Dynamics/Astronautics. A Division of General Dynamics Corporation.     

On the neutrix composition of the distributions x −s ln m |x| and x r

Let F be a distribution and let f be a locally summable function. The distribution F(f) is defined as the neutrix limit of the sequence {F _n (f)}, where F _n (x) = F(x) * δ _n (x) and {δ _n (x)} is a certain sequence of infinitely differentiable functions converging to the Dirac delta-function δ(x). The composition of the distributions x ^?s ln ^m |x| and x ^r is proved to exist and be equal to r ^m x ^?rs ln ^m |x| for r, s, m = 2, 3….     

For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution

We consider linear equations y = Φx where y is a given vector in ?ⁿ and Φ is a given n × m matrix with n < m ≤ τn, and we wish to solve for x ∈ ?^m. We suppose that the columns of Φ are normalized to the unit ??₂‐norm, and we place uniform measure on such Φ. We prove the existence of ρ = ρ(τ) > 0 so that for large n and for all Φ's except a negligible fraction, the following property holds: For every y having a representation y = Φx₀ by a coefficient vector x₀ ∈ ?^m with fewer than ρ · n nonzeros, the solution x₁ of the ??₁‐minimization problem is unique and equal to x₀. In contrast, heuristic attempts to sparsely solve such systems—greedy algorithms and thresholding—perform poorly in this challenging setting. The techniques include the use of random proportional embeddings and almost‐spherical sections in Banach space theory, and deviation bounds for the eigenvalues of random Wishart matrices. © 2006 Wiley Periodicals, Inc.     

Generalized derivations and left multipliers on Lie ideals

Let m, n be two fixed positive integers and let R be a 2-torsion free prime ring, with Utumi quotient ring U and extended centroid C. We study the identity F(x ^m+n+1) = F(x)x ^m+n  + x ^m D(x)x ⁿ for x in a non-central Lie ideal of R, where both F and D are generalized derivations of R and then determine the relationship between the form of F and that of D. In particular the conclusions of the main theorem say that if D is the non-zero map in R, then R satisfies the standard identity s ₄(x ₁, . . . , x ₄) and D is a usual derivation of R.     

Existence of an Almost Periodic Solution in a Difference Equation with Infinite Delay

In order to obtain the existence of an almost periodic functional difference equation x(n + 1) = ?(n,x_n ),n ∈ Z ⁺ and where x_n is defined by x_n (s) = x(n + s) for s ∈ Z ^?, on an axiomatic phase space B, we consider a certain stability property, which is referred to as BS-stable under disturbances from Ω(?) with respect to K, this stability implies ρ-stable under disturbances from Ω(?) with respect to compact set K.     

The asymptotic formula in Waring’s problem for one square and seventeen fifth powers

Let R _k,s (n) denote the number of solutions of the equation n = x² + y₁^k + y₂^k + ?+ y_s^k{n= x^2 + y_1^k + y_2^k + \cdots + y_s^k} in natural numbers x, y ₁, . . . , y _s . By a straightforward application of the circle method, an asymptotic formula for R _k,s (n) is obtained when k ≥ 3 and s ≥ 2 ^k–1 + 2. When k ≥ 6, work of Heath-Brown and Boklan is applied to establish the asymptotic formula under the milder constraint s ≥ 7 · 2 ^k–4 + 3. Although the principal conclusions provided by Heath-Brown and Boklan are not available for smaller values of k, some of the underlying ideas are still applicable for k = 5, and the main objective of this article is to establish an asymptotic formula for R _5,17(n) by this strategy.     

Hypergraphs with no special cycles

A special cycle in a hypergraph is a cyclex ₁ E ₁ x ₂ E ₂ x ₃ ...x _n E _n x ₁ ofn distinct verticesx _i andn distinct edgesE _j (n≧3) whereE _i ∩{x ₁,x ₂, ...,x _n }={x _i ,x _i+1} (x _n+1=x ₁). In the equivalent (0, 1)-matrix formulation, a special cycle corresponds to a square submatrix which is the incidence matrix of a cycle of size at least 3. Hypergraphs with no special cycles have been called totally balanced by Lovász. Simple hypergraphs with no special cycles onm vertices can be shown to have at most ( ₂ ^m )+m+1 edges where the empty edge is allowed. Such hypergraphs with the maximum number of edges have a fascinating structure and are called solutions. The main result of this paper is an algorithm that shows that a simple hypergraph on at mostm vertices with no special cycles can be completed (by adding edges) to a solution. Support provided by NSERC.     

The limiting distribution of the trace of a random plane partition

We study the asymptotic behaviour of the trace (the sum of the diagonal parts) τ _n = τ _n (ω) of a plane partition ω of the positive integer n, assuming that ω is chosen uniformly at random from the set of all such partitions. We prove that (τ _n − c ₀ n ^2/3)/c ₁ n ^1/3 log^1/2 n converges weakly, as n → ∞, to the standard normal distribution, where c ₀ = ζ(2)/ [2ζ(3)]^2/3, c ₁ = √(1/3/) [2ζ(3)]^1/3 and ζ(s) = Σ _j=1^∞ j ^−s . Partial support given by the National Science Fund of the Bulgarian Ministry of Education and Science, grant No. VU-MI-105/2005.     

For most large underdetermined systems of equations,the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution

We consider inexact linear equations y ≈ Φx where y is a given vector in ?ⁿ, Φ is a given n × m matrix, and we wish to find x_0,? as sparse as possible while obeying ‖y ? Φx_0,?‖₂ ≤ ?. In general, this requires combinatorial optimization and so is considered intractable. On the other hand, the ??₁‐minimization problem is convex and is considered tractable. We show that for most Φ, if the optimally sparse approximation x_0,? is sufficiently sparse, then the solution x_1,? of the ??₁‐minimization problem is a good approximation to x_0,?. We suppose that the columns of Φ are normalized to the unit ??₂‐norm, and we place uniform measure on such Φ. We study the underdetermined case where m ～ τn and τ > 1, and prove the existence of ρ = ρ(τ) > 0 and C = C(ρ, τ) so that for large n and for all Φ's except a negligible fraction, the following approximate sparse solution property of Φ holds: for every y having an approximation ‖y ? Φx₀‖₂ ≤ ? by a coefficient vector x₀ ∈ ?^m with fewer than ρ · n nonzeros, This has two implications. First, for most Φ, whenever the combinatorial optimization result x_0,? would be very sparse, x_1,? is a good approximation to x_0,?. Second, suppose we are given noisy data obeying y = Φx₀ + z where the unknown x₀ is known to be sparse and the noise ‖z‖₂ ≤ ?. For most Φ, noise‐tolerant ??₁‐minimization will stably recover x₀ from y in the presence of noise z. We also study the barely determined case m = n and reach parallel conclusions by slightly different arguments. Proof techniques include the use of almost‐spherical sections in Banach space theory and concentration of measure for eigenvalues of random matrices. © 2006 Wiley Periodicals, Inc.     

Algebraic Approaches to Periodic Arithmetical Maps

A residue class a + n with weight λ is denoted by λ, a, n. For a finite system = {λ_s, a_s, n_s}^k_{s = 1} of such triples, the periodic map w (x) = ∑_{ns|x − as} λ_s is called the covering map of . Some interesting identities for those with a fixed covering map have been known; in this paper we mainly determine all those functions f : Ω → such that ∑^k_{s = 1} λ_sf(a_s + n_s ) depends only on w where Ω denotes the family of all residue classes. We also study algebraic structures related to such maps f, and periods of arithmetical functions ψ(x) = ∑^k_{s = 1} λ_se^2πia_sx/n_s and ω(x) = |{1 ≤ s ≤ k : (x + a_s, n_s) = 1}|.     

A note on the non-commutative neutrix product of distributions

The distributionF(x ₊, −r) Inx₊ andF(x ₋, −s) corresponding to the functionsx ₊ ^−r lnx₊ andx ₋ ^−s respectively are defined by the equations

Constant mean curvature hypersurfaces with two principal curvatures in a sphere

In this paper we consider a compact oriented hypersurface M ⁿ with constant mean curvature H and two distinct principal curvatures λ and μ with multiplicities (n − m) and m, respectively, immersed in the unit sphere S ⁿ⁺¹. Denote by f_ij{\phi_{ij}} the trace free part of the second fundamental form of M ⁿ , and Φ be the square of the length of f_ij{\phi_{ij}} . We obtain two integral formulas by using Φ and the polynomial P_H,m(x)=x²+ \fracn(n-2m)?{nm(n-m)}H x -n(1+H²){P_{H,m}(x)=x^{2}+ \frac{n(n-2m)}{\sqrt{nm(n-m)}}H x -n(1+H^{2})} . Assume that B _H,m is the square of the positive root of P _H,m (x) = 0. We show that if M ⁿ is a compact oriented hypersurface immersed in the sphere S ⁿ⁺¹ with constant mean curvatures H having two distinct principal curvatures λ and μ then either F = B_H,m{\Phi=B_{H,m}} or F = B_H,n-m{\Phi=B_{H,n-m}} . In particular, M ⁿ is the hypersurface S^n-m(r)×S^m(?{1-r²}){S^{n-m}(r)\times S^{m}(\sqrt{1-r^{2}})} .     

Ramanujan’s identities and representation of integers by certain binary and quaternary quadratic forms

We revisit old conjectures of Fermat and Euler regarding the representation of integers by binary quadratic form x ²+5y ². Making use of Ramanujan’s ₁ ψ ₁ summation formula, we establish a new Lambert series identity for $\sum_{n,m=-\infty }^{\infty}q^{n^{2}+5m^{2}}We revisit old conjectures of Fermat and Euler regarding the representation of integers by binary quadratic form x ²+5y ². Making use of Ramanujan’s ₁ ψ ₁ summation formula, we establish a new Lambert series identity for ?_n,m=-￥^￥q^n2+5m2\sum_{n,m=-\infty }^{\infty}q^{n^{2}+5m^{2}} . Conjectures of Fermat and Euler are shown to follow easily from this new formula. But we do not stop there. Employing various formulas found in Ramanujan’s notebooks and using a bit of ingenuity, we obtain a collection of new Lambert series for certain infinite products associated with quadratic forms such as x ²+6y ², 2x ²+3y ², x ²+15y ², 3x ²+5y ², x ²+27y ², x ²+5(y ²+z ²+w ²), 5x ²+y ²+z ²+w ². In the process, we find many new multiplicative eta-quotients and determine their coefficients.     

Critical exponent for a quasilinear parabolic equation with inhomogeneous density in a cone

In this paper, we study the initial-boundary value problem of porous medium equation ρ(x)u _t  = Δu ^m  + V(x)h(t)u ^p in a cone D = (0, ∞) × Ω, where V(x)  ~  |x|^s, h(t)  ~  t^s{V(x)\,{\sim}\, |x|^\sigma, h(t)\,{\sim}\, t^s}. Let ω ₁ denote the smallest Dirichlet eigenvalue for the Laplace-Beltrami operator on Ω and let l denote the positive root of l ² + (n − 2)l = ω ₁. We prove that if m < p ￡ 1+(m-1)(1+s)+\frac2(s+1)+sn+l{m < p \leq 1+(m-1)(1+s)+\frac{2(s+1)+\sigma}{n+l}}, then the problem has no global nonnegative solutions for any nonnegative u ₀ unless u ₀ = 0; if ${p >1 +(m-1)(1+s)+\frac{2(s+1)+\sigma}{n+l}}${p >1 +(m-1)(1+s)+\frac{2(s+1)+\sigma}{n+l}}, then the problem has global solutions for some u ₀ ≥ 0.     

Decomposing complete tripartite graphs into closed trails of arbitrary lengths

The complete tripartite graph K _n,n,n has 3_n ² edges. For any collection of positive integers x ₁, x ₂,...,x _m with and x _i ⩾ 3 for 1 ⩽ i ⩽ m, we exhibit an edge-disjoint decomposition of K _n,n,n into closed trails (circuits) of lengths x ₁, x ₂,..., x _m. Supported by Ministry of Education of the Czech Republic as project LN00A056.     

Приближение всплесками и поперечники Фурье классов периодических функций многих переменных. II

Estimates sharp in order for Fourier widths of the classes $ B_{pq}^{sm} (\mathbb{T}^k ) $ and $ L_{pq}^{sm} (\mathbb{T}^k ) $ of Nikol??skii-Besov and Lizorkin-Triebel types, respectively, in the space $ L_r (\mathbb{T}^k ) $ are established for a certain range of the parameters s, p, q, r (here s ?? (0,??) ⁿ , 1 ??p, r, q ???, 1 ?? n ?? k, m = (m ₁, ??,m _n ) ?? ? ⁿ : m ₁ + ?? + m _n = k).