Tauberian Theorems for Sequences linked by a Convolution

Given sequences g, λ: IN₀ → C, g (0) = 1, linked by the convolution λ g = g′¹ (g′¹(n)= (n + 1) g (n + 1)) we study what can be inferred about λ (n → ∞) from some concrete information about the behaviour of g (n → ∞).     

Asymptotic Limits for a Two-Dimensional Recursion

In this paper we consider the general two-dimensional recursion g(n + 1, r + 1) = g(n + 1, r) + bg(n, r) + g(n, r + 1) with boundary conditions g(n, 0) = g(0, r) = 1 We develop various exact and asymptotic formulas for the g(n, r).     

A method of constructing integrable linear equations and its application to Hill's equation

Starting with a given equation of the form $$\ddot x + [\lambda + \varepsilon f(t)] x = 0$$ , where λ > 0 and ? ? l is a small parameter [heref(t) may be periodic, and so Hill's equation is included], we construct an equation of the form y + [λ + ?f (t) + ?² _g (t)]y = 0, integrable by quadratures, close in a certain sense to the original equation. For x₀ = y₀ and x ₀ ^′ = y ₀ ^′ , an upper bound is obtained for ¦y—x¦ on an interval of length Δt.     

The connectivity of large digraphs and graphs

This paper studies the relation between the connectivity and other parameters of a digraph (or graph), namely its order n, minimum degree δ, maximum degree Δ, diameter D, and a new parameter l_pi;, 0 ≤ π ≤ δ ? 2, related with the number of short paths (in the case of graphs l₀ = ?(g ? 1)/2? where g stands for the girth). For instance, let G = (V,A) be a digraph on n vertices with maximum degree Δ and diameter D, so that n ≤ n(Δ, D) = 1 + Δ + Δ ² + … + Δ^D (Moore bound). As the main results it is shown that, if κ and λ denote respectively the connectivity and arc-connectivity of G, . Analogous results hold for graphs. © 1993 John Wiley & Sons, Inc.     

Recurrence relations based on minimization

This paper investigates solutions of the general recurrence M(0) = g(0), M(n + 1) = g(n + 1) + min_0?k?n(αM(k) + βM(n ? k)) for various choices of α, β, and g(n). In a large number of cases it is possible to prove that M(n) is a convex function whose values can be computed much more efficiently than would be suggested by the defining recurrence. The asymptotic behavior of M(n) can be deduced using combinatorial methods in conjunction with analytic techniques. In some cases there are strong connections between M(n) and the function H(x) defined by $\text{H(x) = 1}\text{for}\text{x < 1, H(x) = H(}\text{(x ? 1)}\text{α}\text{) + H(}\text{(x ? 1)}\text{β}\text{)}\text{for}\text{x ? 1}$. Special cases of these recurrences lead to a surprising number of interesting problems involving both discrete and continuous mathematics.     

CGS algorithms for constrained extremization of functions

CGS (conjugate Gram-Schmidt) algorithms are given for computing extreme points of a real-valued functionf(x) ofn real variables subject tom constraining equationsg(x)=0,M<n. The method of approach is to solve the system $$\begin{gathered} f'(x) + g'(x)*\lambda = 0 \hfill \\ g(x) = 0 \hfill \\ \end{gathered} $$ where λ is the Lagrange multiplier vector, by means of CGS algorithms for systems of nonlinear equations. Results of the algorithms applied to test problems are given, including several problems having inequality constraints treated by adjoining slack variables.     

Truncated Complex Moment Problems with a $ \widetilde{zz} $ Relation

We solve the truncated complex moment problem for measures supported on the variety K o \mathcal{K}\equiv { z ? \in C: z [(z)\tilde]\widetilde{z} = A+Bz+C [(z)\tilde]\widetilde{z} +Dz ² ,D 1 \neq 0}. Given a doubly indexed finite sequence of complex numbers g o g⁽²ⁿ⁾:g₀₀,g₀₁,g₁₀,?,g_0,2n,g_1,2n-1,?,g_2n-1,1,g_2n,0 \gamma\equiv\gamma^{(2n)}:\gamma_{00},\gamma_{01},\gamma_{10},\ldots,\gamma_{0,2n},\gamma_{1,2n-1},\ldots,\gamma_{2n-1,1},\gamma_{2n,0} , there exists a positive Borel measure m\mu supported in K \mathcal{K} such that g_ij=ò[`(z)]<sup>i</sup>z<sup>j</sup> dm (0 ￡ 1+j ￡ 2n) \gamma_{ij}=\int\overline{z}^{i}z^{j}\,d\mu\,(0\leq1+j\leq2n) if and only if the moment matrix M(n)( g\gamma ) is positive, recursively generated, with a column dependence relation Z [(Z)\tilde]\widetilde{Z} = A1+BZ +C [(Z)\tilde]\widetilde{Z} +DZ <sup>2</sup>, and card V(g) 3\mathcal{V}(\gamma)\geq rank M(n), where V(g)\mathcal{V}(\gamma) is the variety associated to g \gamma . The last condition may be replaced by the condition that there exists a complex number g<sub>n,n+1</sub> \gamma_{n,n+1} satisfying g<sub>n+1,n</sub> o [`(g)]_n,n+1=Ag_n,n-1+Bg_n,n+Cg_n+1,n-1+Dg_n,n+1 \gamma_{n+1,n}\equiv\overline{\gamma}_{n,n+1}=A\gamma_{n,n-1}+B\gamma_{n,n}+C\gamma_{n+1,n-1}+D\gamma_{n,n+1} . We combine these results with a recent theorem of J. Stochel to solve the full complex moment problem for K \mathcal{K} , and we illustrate the connection between the truncated and full moment problems for other varieties as well, including the variety z ^k = p(z, [(Z)\tilde] \widetilde{Z} ), deg p < k.     

On the log-concavity of Hilbert series of Veronese subrings and Ehrhart series

For every positive integer n, consider the linear operator U _n on polynomials of degree at most d with integer coefficients defined as follows: if we write ${\frac{h(t)}{(1 - t)^{d + 1}}=\sum_{m \geq 0} g(m) \, t^{m}}For every positive integer n, consider the linear operator U _n on polynomials of degree at most d with integer coefficients defined as follows: if we write \frach(t)(1 - t)^{d + 1}=?_{m 3 0} g(m)  t^m{\frac{h(t)}{(1 - t)^{d + 1}}=\sum_{m \geq 0} g(m) \, t^{m}} , for some polynomial g(m) with rational coefficients, then \fracU_nh(t)(1- t)^d+1 = ?_{m 3 0}g(nm)  t^m{\frac{{\rm{U}}_{n}h(t)}{(1- t)^{d+1}} = \sum_{m \geq 0}g(nm) \, t^{m}} . We show that there exists a positive integer n _d , depending only on d, such that if h(t) is a polynomial of degree at most d with nonnegative integer coefficients and h(0) = 1, then for n ≥ n _d , U _n h(t) has simple, real, negative roots and positive, strictly log concave and strictly unimodal coefficients. Applications are given to Ehrhart δ-polynomials and unimodular triangulations of dilations of lattice polytopes, as well as Hilbert series of Veronese subrings of Cohen–Macauley graded rings.     

Recurrence relations based on minimization and maximization

Explicit and asymptotic solutions are presented to the recurrence M(1) = g(1), M(n + 1) = g(n + 1) + min_{1 ? t ? n}(αM(t) + βM(n + 1 ? t)) for the cases (1) α + β < 1, $\text{log}{}_2\text{α}\text{log}{}_2\text{β}$ is rational, and g(n) = δ_nI. (2) α + β > 1, min(α, β) > 1, $\text{log}{}_2\text{α}\text{log}{}_2\text{β}$ is rational, and (a) g(n) = δ_n1, (b) g(n) = 1. The general form of this recurrence was studied extensively by Fredman and Knuth [J. Math. Anal. Appl.48 (1974), 534–559], who showed, without actually solving the recurrence, that in the above cases $\text{M(n) = Ω(n}{}^{\mathrm{<mtext>1\; +\; </mtext><mtext>1</mtext><mtext>\gamma </mtext>}}\text{)}$, where γ is defined by α^?γ + β^?γ = 1, and that $\text{lim}{}_{\mathrm{n\; \to \; \infty }}\text{M(n)}\text{n}{}^{\mathrm{1\; +\; \gamma }}$ does not exist. Using similar techniques, the recurrence M(1) = g(1), M(n + 1) = g(n + 1) + max_{1 ? t ? n}(αM(t) + βM(n + 1 ? t)) is also investigated for the special case α = β < 1 and g(n) = 1 if n is odd = 0 if n is even.     

Unboundedness of the large solutions of some asymmetric oscillators at resonance

In this paper, we consider the unboundedness of solutions of the following differential equation (φ_p(x′))′ + (p ? 1)[αφ_p(x⁺) ? βφ_p(x^?)] = f(x)x′ + g(x) + h(x) + e(t) where φ_p(u) = |u|^{p? 2} u, p > 1, x^± = max {±x, 0}, α and β are positive constants satisfying with m, n ∈ N and (m, n) = 1, f and g are continuous and bounded functions such that lim_x→±∞g(x) ? g(±∞) exists and h has a sublinear primitive, e(t) is 2π_p‐periodic and continuous. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Accelerating convergence of limit periodic continued fractionsK(a n /1)

Summary It is shown that the convergence of limit periodic continued fractionsK(a _n /1) with lima _n =a can be substantially accelerated by replacing the sequence of approximations {S _n (0)} by the sequence {S _n (x ₁)}, where . Specific estimates of the improvement are derived.     

On the genus of a random graph

Let p = p(n) be a function of n with 0<p<1. We consider the random graph model ??(n, p); that is, the probability space of simple graphs with vertex-set {1, 2,…, n}, where two distinct vertices are adjacent with probability p. and for distinct pairs these events are mutually independent. Archdeacon and Grable have shown that if p²(1 ? p²) ?? 8(log n)⁴/n. then the (orientable) genus of a random graph in ??(n, p) is (1 + o(1))pn²/12. We prove that for every integer i ? 1, if n^?i/(i + 1) «p «n^{?(i ? 1)/i}. then the genus of a random graph in ??(n, p) is (1 + o(1))i/4(i + 2) pn². If p = cn^?(i?1)/o, where c is a constant, then the genus of a random graph in ??(n, p) is (1 + o(1))g(i, c, n)pn² for some function g(i, c, n) with 1/12 ? g(i, c, n) ? 1. but for i > 1 we were unable to compute this function.     

Order and chaos in Hofstadter's Q(n) sequence

A number of observations are made on Hofstadter's integer sequence defined by Q(n) = Q(n − Q(n − 1)) + Q(n − Q(n − 2)), for n > 2, and Q(1) = Q(2) = 1. On short scales, the sequence looks chaotic. It turns out, however, that the Q(n) can be grouped into a sequence of generations. The k‐th generation has 2^k members that have “parents” mostly in generation k − 1 and a few from generation k − 2. In this sense, the sequence becomes Fibonacci type on a logarithmic scale. The variance of S(n) = Q(n) − n/2, averaged over generations, is ≅2^αk, with exponent α = 0.88(1). The probability distribution p*(x) of x = R(n) = S(n)/n^α, n ≫ 1, is well defined and strongly non‐Gaussian, with tails well described by the error function erfc. The probability distribution of x_m = R(n) − R(n − m) is given by p_m(x_m) = λ_m p*(x_m/λ_m), with λ_m → √2 for large m. © 1999 John Wiley & Sons, Inc.     

On cliques and bicliques

For integers m, n ≥ 2, let g(m, n) be the minimum order of a graph, where every vertex belongs to both a clique K_m of order m and a biclique K(n, n). We show that g(m, n) = 2(m + n − 2) if m ≤ n − 2. Furthermore, for m ≥ n − 1, we establish that ≡ 0 mod(n − 1) or, if m is sufficiently large and is not an integer. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 60–66, 2000     

Global dynamics of delay differential equations

In this survey paper the delay differential equation (t) = −μx(t) + g(x(t − 1)) is considered with μ ≥ 0 and a smooth real function g satisfying g(0) = 0. It is shown that the dynamics generated by this simple-looking equation can be very rich. The dynamics is completely understood only for a small class of nonlinearities. Open problems are formulated. Supported in part by the Hungarian NFSR, Grant No. T049516.     

On the Greatest Common Divisor of u ? 1 and v ? 1 with u and v Near S{\cal S}-units

In [2], it was shown that if a and b are multiplicatively independent integers and ɛ > 0, then the inequality gcd (aⁿ − 1,bⁿ − 1) < exp(ɛn) holds for all but finitely many positive integers n. Here, we generalize the above result. In particular, we show that if f(x),f₁(x),g(x),g₁(x) are non-zero polynomials with integer coefficients, then for every ɛ > 0, the inequality gcd (f(n)aⁿ+g(n), f₁(n)bⁿ+g₁(n)) < exp(ne){\rm gcd}\, (f(n)a^n+g(n), f_1(n)b^n+g_1(n)) < \exp(n\varepsilon) holds for all but finitely many positive integers n.     

Analyticity of a Nonlinear Operator Associated to the Conformal Representation in Schauder Spaces. An Integral Equation Approach

We consider the Riemann map g_ζ,w of the complex unit disk to the plane domain 𝕀[ζ] enclosed by the Jordan curve ζ and normalized by the conditions g_ζ,w(0) = w, g′_ζ,w(0) > 0, where w is a point of 𝕀[ζ], and we present a nonlinear singular integral equation approach to prove that the nonlinear operator which takes the pair (ζ, w) to the map g^(–1)_ζ,w ○ ζ is real analytic in Schauder spaces.     

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.     

Solvability of systems of partial differential equations for functions defined on nonconvex sets

We consider systems of partial differential equations with constant coefficients of the form ( R(D_x, D_y)f = 0, P(D_x)f = g), f,g ? C^￥(W),\big ( R(D_x, D_y)f = 0, P(D_x)f = {g}\big ), f,g \in {C}^{\infty}(\Omega),, where R (and P) are operators in (n + 1) variables (and in n variables, respectively), g satisfies the compatibility condition R(D_x, D_y)g = 0  and  W ì \Bbb Rⁿ⁺¹R(D_x, D_y){g} = 0 \ {\rm and} \ \Omega \subset {\Bbb R}^{n+1} is open. Let R be elliptic. We show that the solvability of such systems for certain nonconvex sets W\Omega implies that any localization at ￥\infty of the principle part P_m of P is hyperbolic. In contrast to this result such systems can always be solved on convex open sets W\Omega by the fundamental principle of Ehrenpreis-Palamodov.