Inversion of the exponential X-ray transform. II: Numerics

The exponential X-ray transform arises in single photon emission computed tomography and is defined on functions on the plane by ??_μf(φ,x) = ∫f (x + tφ)e^μt where μ is a constant. In [MMAS(10), 561–574, 1988], we derived analytical formulae for filters K corresponding to a general point spread function E that can be used to invert the exponential X-ray transform via a filtered backprojection algorithm. Here, we use those formulae to derive expressions suitable for numerical computation of the filters corresponding to a specific family of bandlimited point spread functions and give the results of reconstructions of a mathematical phantom using these filters. Also included is an analogue of the Shepp–Logan ellipse theorem, [IEEE Trans. Nucl. Sci. (21), 21–43, 1974], for the exponential X-ray transform.     

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

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     

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.     

Non-linear parabolic problem associated with the penetration of a magnetic field into a substance

We study the following initial and boundary value problem: In section 1, with u₀ in L²(Ω), f continuous such that f(u) + ? non-decreasing for ? positive, we prove the existence of a unique solution on (0,T), for each T > 0. In section 2 it is proved that the unique soluition u belongs to L²(0, T; H ∩ H²) ∩ L^∞(0, T; H) if we assume u₀ in H and f in C¹(?,?). Numerical results are given for these two cases.     

Subelliptic Estimates for a Class of Degenerate Elliptic Integro-Differential Operators

In this paper we prove subelliptic estimates for operators of the form Δ_x + λ² (x)S in ?^N = ? × ?, where the operator S is an elliptic integro - differential operator in ?^N and λ is a nonnegative Lipschitz continuous function.     

On invariant measures of extensions of Markov transition functions

By using the LITTLEWOOD matrices A_2n we generalize CLARKSON' S inequalities, or equivalently, we determine the norms ‖A_2n: l(L_P) → l(L_P)‖ completely. The result is compared with the norms ‖A_2n: l → l‖, which are calculated implicitly in PIETSCH [6].     

On a conjecture on maximal planar sequences

Let d1 d2 dp denote the nonincreasing sequence d₁, …, d₁, d₂, …, d₂, …, d_p, …, d_p, where the term d_i appears k_i times (i = 1, 2, …, p). In this work the author proves that the maximal 2-sequences: 7³6¹5¹⁵, 7⁵6¹5¹⁷, 7⁷6¹5¹⁹ are planar graphical, in contrast to a conjecture by Schmeichel and Hakimi.     

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.     

Word maps and spectra of random graph lifts

We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ₁ and ρ are the spectral radii of G and T respectively, then, as shown by Friedman (Graphs Duke Math J 118 (2003), 19–35), in almost every n‐lift H of G, all “new” eigenvalues of H are ≤ O(λ ρ^1/2). Here we improve this bound to O(λ ρ^2/3). It is conjectured in (Friedman, Graphs Duke Math J 118 (2003) 19–35) that the statement holds with the bound ρ + o(1) which, if true, is tight by (Greenberg, PhD thesis, 1995). For G a bouquet with d/2 loops, our arguments yield a simple proof that almost every d‐regular graph has second eigenvalue O(d^2/3). For the bouquet, Friedman (2008). has famously proved the (nearly?) optimal bound of . Central to our work is a new analysis of formal words. Let w be a formal word in letters g,…,g. The word map associated with w maps the permutations σ₁,…,σ_k ∈ S_n to the permutation obtained by replacing for each i, every occurrence of g_i in w by σ_i. We investigate the random variable X that counts the fixed points in this permutation when the σ_i are selected uniformly at random. The analysis of the expectation ??(X) suggests a categorization of formal words which considerably extends the dichotomy of primitive vs. imprimitive words. A major ingredient of a our work is a second categorization of formal words with the same property. We establish some results and make a few conjectures about the relation between the two categorizations. These conjectures suggest a possible approach to (a slightly weaker version of) Friedman's conjecture. As an aside, we obtain a new conceptual and relatively simple proof of a theorem of A. Nica (Nica, Random Struct Algorithms 5 (1994), 703–730), which determines, for every fixed w, the limit distribution (as n →∞) of X. A surprising aspect of this theorem is that the answer depends only on the largest integer d so that w = u^d for some word u. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2010     

Strong asymptotics of orthogonal polynomials with respect to exponential weights

We consider asymptotics of orthogonal polynomials with respect to weights w(x)dx = e^−Q(x) dx on the real line, where Q(x) = Σ q_k x^k, q_2m > 0, denotes a polynomial of even order with positive leading coefficient. The orthogonal polynomial problem is formulated as a Riemann‐Hilbert problem following [22, 23]. We employ the steepest‐descent‐type method introduced in [18] and further developed in [17, 19] in order to obtain uniform Plancherel‐Rotach‐type asymptotics in the entire complex plane, as well as asymptotic formulae for the zeros, the leading coefficients, and the recurrence coefficients of the orthogonal polynomials. © 1999 John Wiley & Sons, Inc.     

On smallest triangles

Pick n points independently at random in ?², according to a prescribed probability measure μ, and let Δ ≤ Δ ≤ … be the areas of the () triangles thus formed, in nondecreasing order. If μ is absolutely continuous with respect to Lebesgue measure, then, under weak conditions, the set {n³Δ : i ≥ 1} converges as n → ∞ to a Poisson process with a constant intensity κ(μ). This result, and related conclusions, are proved using standard arguments of Poisson approximation, and may be extended to functionals more general than the area of a triangle. It is proved in addition that if μ is the uniform probability measure on the region S, then κ(μ) ≤ 2/|S|, where |S| denotes the area of S. Equality holds in that κ(μ) = 2/|S| if S is convex, and essentially only then. This work generalizes and extends considerably the conclusions of a recent paper of Jiang, Li, and Vitányi. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 23: 206–223, 2003     

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     

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.     

Tangential Convergence of Temperatures and Harmonic Functions in Besov and in Triebel-Lizorkin Spaces

We study the maximal function Mf(x) = sup |f(x + y, t)| when Ω is a region in the (y,t) Ω upper half space R and f(x, t) is the harmonic extension to R₊^N+1 of a distribution in the Besov space B^α_p,q(R^N) or in the Triebel-Lizorkin space F^α_p,q(R^N). In particular, we prove that when Ω= {|_y|^{N/ (N-αp)} < t < 1} the operator M is bounded from F (R^N) into L^p (R^N). The admissible regions for the spaces B (R^N) with p < q are more complicated.     

On a Relation between Intrinsic and Extrinsic Dirichlet Forms for Interacting Particle Systems

In this paper we extend the result obtained in [AKR98] (see also [AKR96a]) on the representation of the intrinsic pre–Dirichlet form ℰ^Γ of the Poisson measure π_σ in terms of the extrinsic one ℰ^P. More precisely, replacing π_σ by a Gibbs measure μ on the configuration space Γ_X we derive a relation between the intrinsic prend–Dirichlet form ℰ^Γ_μ of the measure μ and the extrinsic one ℰ^P. As a consequence we prove the closability of ℰ^Γ_μ on L²(Γ_X, μ) under very general assumptions on the interaction potential of the Gibbs measures μ.     

Hardy-Littlewood Maximal Operator,Singular Integral Operators and the Riesz Potentials on Generalized Morrey Spaces

Any continuous linear operator T: L^p → L^q has a natural vector-valued extension T: L^p(l) → L^q(l) which is automatically continuous. Relations between the norms of these operators in the cases of p = q and r = 2 were considered by Marcinkiewicz -Zygmund [28], Herz [14] and Krivine [19] - [21]. In this paper we study systematically these relations and given some applications. It turns out that some known results can be proved in a simple way as a consequence of these developments.     

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.     

Superconvergence of a 3D finite element method for stationary Stokes and Navier‐Stokes problems

For the Poisson equation on rectangular and brick meshes it is well known that the piecewise linear conforming finite element solution approximates the interpolant to a higher order than the solution itself. In this article, this type of supercloseness property is established for a special interpolant of the Q₂ ? P element applied to the 3D stationary Stokes and Navier‐Stokes problem, respectively. Moreover, applying a Q₃ ? P postprocessing technique, we can also state a superconvergence property for the discretization error of the postprocessed discrete solution to the solution itself. Finally, we show that inhomogeneous boundary values can be approximated by the Lagrange Q₂‐interpolation without influencing the superconvergence property. Numerical experiments verify the predicted convergence rates. Moreover, a cost‐benefit analysis between the two third‐order methods, the post‐processed Q₂ ? P discretization, and the Q₃ ? P discretization is carried out. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

The determining number of a Cartesian product

A set S of vertices is a determining set for a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of G, denoted Det(G), is the size of a smallest determining set. This paper begins by proving that if G=G□?□G is the prime factor decomposition of a connected graph then Det(G)=max{Det(G)}. It then provides upper and lower bounds for the determining number of a Cartesian power of a prime connected graph. Further, this paper shows that Det(Q_n)=?log₂n?+1 which matches the lower bound, and that Det(K)=?log₃(2n+1)?+1 which for all n is within one of the upper bound. The paper concludes by proving that if H is prime and connected, Det(Hⁿ)=Θ(logn). © 2009 Wiley Periodicals, Inc. J Graph Theory