On Σ1-definable Functions Provably Total in I ∏

We prove the following theorem: Let φ(x) be a formula in the language of the theory PA^? of discretely ordered commutative rings with unit of the form ?yφ′(x,y) with φ′ and let ∈ Δ₀ and let fφ: ? → ? such that f_φ(x) = y iff φ′(x,y) & (?z < y) φ′(x,z). If I ∏ ∈(?x ≥ 0), φ then there exists a natural number K such that I ∏ ? ?y?x(x > y ? ?φ(x) < x^K). Here I ∏₁^? denotes the theory PA^? plus the scheme of induction for formulas φ(x) of the form ?yφ′(x,y) (with φ′) with φ′ ∈ Δ₀.     

Function Spaces with Exponential Weights II

This paper is a continuation of [8]. We study weighted function spaces of type B and F on the Euclidean space Rⁿ, where u is a weight function of at most exponential growth. In particular, u(χ (±|χ|) is an admissible weight. We deal with atomic decompositions of these spaces. Furthermore, we prove that the spaces B and F are isomorphic to the corresponding unweighted spaces B and F.     

Subgraphs smaller than the girth

For graphs A, B, let () denote the number of subsets of nodes of A for which the induced subgraph is B. If G and H both have girth > k, and if () = () for every k-node tree T, then for every k-node forest F, () = (). Say the spread of a tree is the number of nodes in a longest path. If G is regular of degree d, on n nodes, with girth > k, and if F is a forest of total spread ≤k, then the value of () depends only on n and d.     

Resonance phenomena for a class of partial differential equations of higher order in cylindrical waveguides

We consider a domain Ω in ?ⁿ of the form Ω = ?^l × Ω′ with bounded Ω′ ? ?^n?l. In Ω we study the Dirichlet initial and boundary value problem for the equation ? u + [(? ? ?… ? ?)^m + (? ? ?… ? ?)^m]u = fe^?iωt. We show that resonances can occur if 2m ≥ l. In particular, the amplitude of u may increase like t^α (α rational, 0<α<1) or like in t as t∞∞. Furthermore, we prove that the limiting amplitude principle holds in the remaining cases.     

m‐ary Search trees when m ≥ 27: A strong asymptotics for the space requirements

It is known that the joint distribution of the number of nodes of each type of an m‐ary search tree is asymptotically multivariate normal when m ≤ 26. When m ≥ 27, we show the following strong asymptotics of the random vector X_n = ^t(X, … , X), where X denotes the number of nodes containing i ? 1 keys after having introduced n ? 1 keys in the tree: There exist (nonrandom) vectors X, C, and S and random variables ρ and φ such that (X_n ? nX)/n ? ρ(C cos(τ₂log n + φ) + S sin(τ₂log n + φ)) →_n→∞ 0 almost surely and in L²; σ₂ and τ₂ denote the real and imaginary parts of one of the eigenvalues of the transition matrix, having the second greatest real part. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

On the density of 2‐colorable 3‐graphs in which any four points span at most two edges

Let ex₂(n, K) be the maximum number of edges in a 2‐colorable K‐free 3‐graph (where K={123, 124, 134} ). The 2‐chromatic Turán density of K is $\pi_{2}({K}_{4}^-) =lim_{{n}\to \infty} {ex}_{2}({n}, {K}_{4}^-)/\left(_{3}^{n}\right)Let ex₂(n, K) be the maximum number of edges in a 2‐colorable K‐free 3‐graph (where K={123, 124, 134} ). The 2‐chromatic Turán density of K is $\pi_{2}({K}_{4}^-) =lim_{{n}\to \infty} {ex}_{2}({n}, {K}_{4}^-)/\left(_{3}^{n}\right)$. We improve the previously best known lower and upper bounds of 0.25682 and 3/10?ε, respectively, by showing that This implies the following new upper bound for the Turán density of K In order to establish these results we use a combination of the properties of computer‐generated extremal 3‐graphs for small n and an argument based on “super‐saturation”. Our computer results determine the exact values of ex(n, K) for n≤19 and ex₂(n, K) for n≤17, as well as the sets of extremal 3‐graphs for those n. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 105–114, 2010     

A new construction of perfect nonlinear functions using Galois rings

For a prime p, we give a construction of perfect nonlinear functions from ? to ? when either of the following conditions holds: (1) n≥p; (2) n<p, and n is a composite number or is the sum of positive composite numbers. It follows that when n≥12, there is a perfect nonlinear function from ? to ? for any prime p. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 229‐239, 2009     

Entropy Numbers in Weighted Function Spaces and Eigenvalue Distributions of Some Degenerate Pseudodifferential Operators II

This paper is the continuation of [17]. We investigate mapping and spectral properties of pseudodifferential operators of type Ψ with χ χ ? ? and 0 ≤ γ ≤ 1 in the weighted function spaces B (?ⁿ, w(x)) and F (?ⁿ, w(x)) treated in [17]. Furthermore, we study the distribution of eigenvalues and the behaviour of corresponding root spaces for degenerate pseudodifferential operators preferably of type b₂(x) b(x, D) b₁(x), where b₁(x) and b₂(x) are appropriate functions and b(x, D) ? Ψ. Finally, on the basis of the Birman-Schwinger principle, we deal with the “negative spectrum” (bound states) of related symmetric operators in L₂.     

Stability of Cahn‐Hilliard fronts

We prove stability of the kink solution of the Cahn‐Hilliard equation ∂_tu = ∂( ∂u − u/2 + u³/2), x ∈ ℝ. The proof is based on an inductive renormalization group method, and we obtain detailed asymptotics of the solution as t → ∞. We prove stability of the kink solution of the Cahn‐Hilliard equation ∂_tu = ∂( ∂u − u/2 + u³/2), x ∈ ℝ. The proof is based on an inductive renormalization group method, and we obtain detailed asymptotics of the solution as t → ∞. © 1999 John Wiley & Sons, Inc.     

The circular chromatic number of the Mycielskian of G

In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski developed a graph transformation that transforms a graph G into a new graph μ(G), we now call the Mycielskian of G, which has the same clique number as G and whose chromatic number equals χ(G) + 1. Chang, Huang, and Zhu [G. J. Chang, L. Huang, & X. Zhu, Discrete Math, to appear] have investigated circular chromatic numbers of Mycielskians for several classes of graphs. In this article, we study circular chromatic numbers of Mycielskians for another class of graphs G. The main result is that χ_c(μ(G)) = χ(μ(G)), which settles a problem raised in [G. J. Chang, L. Huang, & X. Zhu, Discrete Math, to appear, and X. Zhu, to appear]. As χ_c(G) = and χ(G) = , consequently, there exist graphs G such that χ_c(G) is as close to χ(G) − 1 as you want, but χ_c(μ(G)) = χ(μ(G)). © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 63–71, 1999     

On the minimum size of tight hypergraphs

A k-graph, H = (V, E), is tight if for every surjective mapping f: V → {1,….k} there exists an edge α ? E sicj tjat f|_α is injective. Clearly, 2-graphs are tight if and only if they are connected. Bounds for the minimum number ? of edges in a tight k-graph with n vertices are given. We conjecture that ? for every n and prove the equality when 2n + 1 is prime. From the examples, minimal embeddings of complete graphs into surfaces follow. © 1992 John Wiley & Sons, Inc.     

Uniform stability of spectral nonlinear Galerkin methods

This article provides a stability analysis for the backward Euler schemes of time discretization applied to the spatially discrete spectral standard and nonlinear Galerkin approximations of the nonstationary Navier‐Stokes equations with some appropriate assumption of the data (λ, u₀, f). If the backward Euler scheme with the semi‐implicit nonlinear terms is used, the spectral standard and nonlinear Galerkin methods are uniform stable under the time step constraint Δt ≤ (2/λλ₁). Moreover, if the backward Euler scheme with the explicit nonlinear terms is used, the spectral standard and nonlinear Galerkin methods are uniform stable under the time step constraints Δt = O(λ) and Δt = O(λ), respectively, where λ ≤ λ, which shows that the restriction on the time step of the spectral nonlinear Galerkin method is less than that of the spectral standard Galerkin method. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2004     

Graph minors and linkages

Bollobás and Thomason showed that every 22k‐connected graph is k‐linked. Their result used a dense graph minor. In this paper, we investigate the ties between small graph minors and linkages. In particular, we show that a 6‐connected graph with a K minor is 3‐linked. Further, we show that a 7‐connected graph with a K minor is (2,5)‐linked. Finally, we show that a graph of order n and size at least 7n?29 contains a K minor. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 75–91, 2005     

Selbstadjungierte Relations-Erweiterungen für eine Klasse von symmetrischen Differential-Funktional-Operatoren

Symmetry- and selfadjointness-conditions are derived for ordinary differential-integral-interface operators under integral-interface conditions. Criteria for the existence of selfadjoint extensions in L×L are given. These extensions are characterized in a constructive way. The main tools are some extension-theorems for linear relations (subspaces), wich are developed in section 2.     

Enumeration of graphs by degree sequence

The degree sequence (d₀, d₁, …, d_p-1) of a graph G of order p is defined by d_k = the number of points of G of degree k. Methods of Robinson are extended to produce a generating function F(x₀, x₁, x₂, …) where the coefficient of x…x is the number of graphs of order p having degree sequence (d₀, …, d_p-1).     

Global attractors for 2‐D wave equations with displacement‐dependent damping

In this paper the long‐time behaviour of the solutions of 2‐D wave equation with a damping coefficient depending on the displacement is studied. It is shown that the semigroup generated by this equation possesses a global attractor in H(Ω) × L₂(Ω) and H²(Ω)∩H(Ω) × H(Ω). Copyright © 2009 John Wiley & Sons, Ltd.     

On Hardy - Littlewood Maximal Functions in Orlicz Spaces

Let Φ(t) and Ψ(t) be the functions having the following representations Φ(t) = ∫a(s)ds and Ψ(t) = ∫b(s) ds, where a(s) is a positive continuous function such that ∫a(s)/s ds = + ∞ and b(s) is an increasing function such that lim_s→ ∞ b(s) = + ∞. Then the following statements for the Hardy - Littlewood maximal function M f (x) are equivalent:

• 1 (i) there exist positive constants c₁ and s₀ such that
• 1 (ii) there exist positive constant c₂ and c₃ such that

.     

Markov chains on hypercubes: Spectral representations and several majorization relations

Various Markov chains on hypercubes ??are considered and their spectral representations are presentend in terms of Kronecker products. Special attention is given to random walks on the graphs ??(l = 1,n ? 2), where the vertex set is ?? and two vertices are connected if and only if their Hamming distance is at most l. It is shown that λ(??₁)>λ(??₁)>λ(??_n?1)>λ(??_n),l=2,…,n?2, where λ (??_I) is the specturum of the random walk on ??I, and > denotes the majorization ordering. A similar majorization relation is established for graphs V₁ where two veritces are connected if and only if their Hamming distance is exactly l. Some applications to mean times of these random walks are given. © 1993 John Wiley & Sons, Inc.     

On the Lorentz-Marcinkiewicz Operator Ideal

This article deals with the LORENTZ-MARCINKIEWICZ operator ideal ?? generated by an additive s-function and the LORENTZ-MARCINKIEWICZ sequence space λ^q(φ). We give eigenvalue distributions for operators belonging to ?? (E, E) and we show the interpolation properties of ??-ideals. Furthermore, we study certain SCHAUDER bases in ?? (H, K), H and K Hilbert spaces.