Strengths and Weaknesses of LH Arithmetic

In this paper we provide a new arithmetic characterization of the levels of the og‐time hierarchy (LH). We define arithmetic classes and that correspond to ‐LOGTIME and ‐LOGTIME, respectively. We break and into natural hierarchies of subclasses and . We then define bounded arithmetic deduction systems ′ whose ‐definable functions are precisely B( ‐LOGTIME). We show these theories are quite strong in that (1) LIOpen proves for any fixed m that , (2) TAC, a theory that is slightly stronger than ′ whose (LH)‐definable functions are LH, proves LH is not equal to ‐TIME(s) for any m> 0, where 2^s ∈L, s(n) ∈ ω(log n), and (3) TAC proves LH ≠ for all k and m. We then show that the theory TAC cannot prove the collapse of the polynomial hierarchy. Thus any such proof, if it exists, must be argued in a stronger systems than ours.     

A local compactness theorem for Maxwell's equations

The paper gives a proof, valid for a large class of bounded domains, of the following compactness statements: Let G be a bounded domain, β be a tensor-valued function on G satisfying certain restrictions, and let {_n} be a sequence of vector-valued functions on G where the L₂-norms of {_n}, {curl _n}, and {div(β _n)} are bounded, and where all _n either satisfy x _n = 0 or (β F_n) = 0 at the boundary ?G of G ( = normal to ?G): then {_n} has a L₂-convergent subsequence. The first boundary condition is satisfied by electric fields, the second one by magnetic fields at a perfectly conducting boundary ?G if β is interpreted as electric dielectricity ? or as magnetic permeability μ, respectively. These compactness statements are essential for the application of abstract scattering theory to the boundary value problem for Maxwell's equations.     

The isoperimetric constant of the random graph process

The isoperimetric constant of a graph G on n vertices, i(G), is the minimum of , taken over all nonempty subsets S ⊂ V (G) of size at most n/2, where ∂S denotes the set of edges with precisely one end in S. A random graph process on n vertices, , is a sequence of graphs, where is the edgeless graph on n vertices, and is the result of adding an edge to , uniformly distributed over all the missing edges. The authors show that in almost every graph process equals the minimal degree of as long as the minimal degree is o(log n). Furthermore, it is shown that this result is essentially best possible, by demonstrating that along the period in which the minimum degree is typically Θ(log n), the ratio between the isoperimetric constant and the minimum degree falls from 1 to , its final value. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

Compactness Conditions for the Green Operator in Lp(ℝ) Corresponding to a General Sturm–Liouville Operator

We consider the equation ℝ, where , for ℝ, (ℝ), (ℝ), (ℝ), (ℝ) := C(ℝ)). We give necessary and sufficient conditions under which, regardless of , the following statements hold simultaneously: I) For any (ℝ) Equation (0.1) has a unique solution (ℝ) where $\int ^{\infty}_{-\infty}$ ℝ. II) The operator (ℝ) → (ℝ) is compact. Here is the Green function corresponding to (0.1). This result is applied to study some properties of the spectrum of the Sturm–Liouville operator.     

On Mean Convergence of Fourier-Bessel Series of Negative Order

The expansion of f ∈ L^p(0, 1) Fourier series of Bessel functions of order converges to f in L^p whenever Let be the space of p-integrable functions with respect to the measure t dt and where {s_n}, n = 1, 2, …, is the set of positive zeros of J_v. Then, the expansion of in a Fourier series of functions ψ_n, ?1 < ν < ?½, converges to in whenever      

Quasilinear degenerate parabolic equations of Kirchhoff type

We investigate the evolution problem where H is a Hilbert space, A is a self‐adjoint linear non‐negative operator on H with domain D(A), and is a continuous function. We prove that if , and , then there exists at least one global solution, which is unique if either m never vanishes, or m is locally Lipschitz continuous. Moreover, we prove that if for all , then this problem is well posed in H. On the contrary, if for some it happens that for all , then this problem has no solution if with β small enough. We apply these results to degenerate parabolic PDEs with non‐local non‐linearities. Copyright © 1999 John Wiley & Sons, Ltd.     

Uniqueness of Integrable Solutions ∇ζ = Gζ, ζ∣Γ = 0 for Integrable Tensor-Coefficients G and Applications to Elasticity

Let be bounded Lipschitz and relatively open. We show that the solution to the linear first order system 1 : (1) vanishes if and , (e.g. ). We prove to be a norm if with , for some p, q > 1 with 1/p + 1/q = 1 and . We give a new proof for the so called ‘in-finitesimal rigid displacement lemma’ in curvilinear coordinates: Let , satisfy for some with . Then there are and a constant skew-symmetric matrix , such that . (© 2013 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Comparing Packing Measures to Hausdorff Measures on the Line

For each 0 < s < 1, define where , denote respectively the s‐dimensional packing measure and Hausdorff measure, and the infimum is taken over all the sets E ⊂ R with . In this paper we give a nontrivial estimation of c(s), namely, for each 0 < s < 1, where . As an application, we obtain a lower density theorem for Hausdorff measures.     

A note on backward errors for structured linear systems

Let x? be a computed solution to a linear system Ax=b with , where is a proper subclass of matrices in . A structured backward error (SBE) of x? is defined by a measure of the minimal perturbations and such that (1) and that the SBE can be used to distinguish the structured backward stability of the computed solution x?. For simplicity, we may define a partial SBE of x? by a measure of the minimal perturbation such that (2) Can one use the partial SBE to distinguish the structured backward stability of x?? In this note we show that the partial SBE may be much larger than the SBE for certain structured linear systems such as symmetric Toeplitz systems, KKT systems, and dual Vandermonde systems. Besides, certain backward errors for linear least squares are discussed. Copyright © 2004 John Wiley & Sons, Ltd.     

A note on the probabilistic analysis of patricia trees

We consider random PATRICIA trees constructed from n i.i.d. sequences of independent equiprobable bits. We study the height H_n (the maximal distance between the root and a leaf), and the minimal fill-up level F_n (the minimum distance between the root and a leaf). We give probabilistic proofs of .     

Finite element approximation of vector fields given by curl and divergence

In this paper a finite element approximation scheme for the system curl is considered. The use of pointwise approximation of the boundary condition leads to a nonconforming method. The error estimate is proved and numerically tested.     

On the Eigenvalues of Half‐Linear Boundary Value Problems

We consider the half‐linear boundary value problem where and the weight function q is assumed to change sign. We prove the existence of two sequences , of eigenvalues and derive asymptotic estimates for as .     

On the Points on the Unit Circle with Finite b–Adic Expansions

Let be an arbitrary integer base and let be the number of different prime factors of with , . Further let be the set of points on the unit circle with finite –adic expansions of their coordinates and let be the set of angles of the points . Then is an additive group which is the direct sum of infinite cyclic groups and of the finite cyclic group . If in case of the points of are arranged according to the number of digits of their coordinates, then the arising sequence is uniformly distributed on the unit circle. On the other hand, in case of the only points in are the exceptional points (1, 0), (0, 1), (–1, 0), (0, –1). The proofs are based on a canonical form for all integer solutions of .     

Convergence Laws for Very Sparse Random Structures with Generalized Quantifiers

We prove convergence laws for logics of the form , where is a properly chosen collection of generalized quantifiers, on very sparse finite random structures. We also study probabilistic collapsing of the logics , where is a collection of generalized quantifiers and k ∈ ℕ₊, under arbitrary probability measures of finite structures.     

Generalized herglotz domains

Let F(θ k, α) be the far field pattern arising from the scattering of a time harmonic plane acoustic wave of wave number k and direction a by a sound-soft cylinder of cross section D. Suppose F has the Fourier expansion where a_n = a_n(k, . Then if ?² is a Dirichlet eigenvalue for D, sufficient conditions are given on D for the existence of a nontrivial sequence |b_n| where the b_n are independent of such that for all directions Domains for which this is true are called generalized Herglotz domains. The conditions for a domain to be a generalized Herglotz domain are given either in terms of the Schwarz function for the analytic boundary ?D or in terms of the Rayleigh hypothesis in acoustic scattering theory and examples are given showing the applicability of these conditions.     

Hamilton decompositions of complete multipartite graphs with any 2-factor leave

For m ≥ 1 and p ≥ 2, given a set of integers s₁,…,s_q with for and , necessary and sufficient conditions are found for the existence of a hamilton decomposition of the complete p-partite graph , where U is a 2-factor of consisting of q cycles, the jth cycle having length s_j. This result is then used to completely solve the problem when p = 3, removing the condition that . © 2003 Wiley Periodicals, Inc. J Graph Theory 44: 208–214, 2003     

Data Based Regularization Matrices for the Tikhonov-Phillips Regularization

In Tikhonov-Phillips regularization of general form the given ill-posed linear system is replaced by a Least Squares problem including a minimization of the solution vector x, relative to a seminorm with some regularization matrix L. Based on the finite difference matrix L_k, given by a discretization of the first or second derivative, we introduce the seminorm where the diagonal matrix and is the best available approximate solution to x. (© 2012 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Appell Type Transformation for the Kolmogorov Operator

For the Kolmogorov operator we describe all transformations mapping solutions of the equation Lu = 0 into solutions.     

Derived Functors of Hom Relative to Flat Covers

We study the derived functors of Hom that are computed by using flat resolutions of Hom. These are denoted ⁿ. We compare these with the usual Extⁿ's and show that ¹⊂ Ext¹and indicate (using MacLane's terminology) why the class of associated short exact sequences is a proper class. When the ring is a Dedekind domain we classify the N such that ⁿ(–, N) = 0 and show that unlike the situation for other classically defined right derived functors of Hom, Hom is not balanced relative to the two classes of modules that make ¹ vanish.     

On the Range of Two Convolution Operators

Let _(ω)(ℝ) denote the non–quasianalytic class of Beurling type on ℝ. For μ, ν ∈ ′_(ω)(ℝ) we give necessary conditions for the inclusion T_ν( _(ω)(ℝ)) ⊂ T_μ( _(ω)(ℝ)), thus extending previous work of Malgrange and Ehrenpreis .