New Erdös-Kac type theorems

Assuming a quasi Generalized Riemann Hypothesis (quasi-GRH for short) for Dedekind zeta functions over Kummer fields of the type we prove the following prime analogue of a conjecture of Erd?s & Pomerance (1985) concerning the exponent function f_a(p) (defined to be the minimal exponent e for which a^e ≡ 1 modulo p):

Beurling primes with RH and Beurling primes with large oscillation

Two Beurling generalized number systems, both with and k > 0, are constructed. The associated zeta function of the first satisfies the RH and its prime counting function satisfies π(x) = li (x) + O(x ^1/2). The associated zeta function of the second has infinitely many zeros on the curve σ = 1−1/log t and no zeros to the right of the curve and the Chebyshev function ψ(x) of its primes satisfies

Smooth non-special surfaces of ℙ4

We consider smooth non-degenerate surfaces in ℙ⁴, and prove that there is a finite number of such surfaces which are:

Bloch-Bergman Pullbacks with Logarithmic Weights

We characterize the composition operators mapping Blochs boundedly into the weighted Bergman spaces of logarithmic weight. For 0 < p < ∞, 1 < α < ∞, let A^{p, log α} denote the space of holomorphic functions F in the unit disc D for which

Nonoverlap of the star unfolding

The star unfolding of a convex polytope with respect to a pointx on its surface is obtained by cutting the surface along the shortest paths fromx to every vertex, and flattening the surface on the plane. We establish two main properties of the star unfolding:

Packing-type Measures of the Sample Paths of Fractional Brownian Motion

Abstract   Let Λ = {λ _k } be an infinite increasing sequence of positive integers with λ _k →∞. Let X = {X(t), t ∈? R ^N } be a multi-parameter fractional Brownian motion of index α(0 < α < 1) in R ^d . Subject to certain hypotheses, we prove that if N < αd, then there exist positive finite constants K ₁ and K ₂ such that, with unit probability,

The minimal sublinear expectations and their related properties

In this paper, we prove that for a sublinear expectation ɛ[·] defined on L ²(Ω,), the following statements are equivalent:

Subdirect products of hereditary congruence lattices

A congruence lattice L of an algebra A is called power-hereditary if every 0-1 sublattice of Lⁿ is the congruence lattice of an algebra on Aⁿ for all positive integers n. Let A and B be finite algebras. We prove

Model theory of the regularity and reflection schemes

Abstract  This paper develops the model theory of ordered structures that satisfy Keisler’s regularity scheme and its strengthening REF (the reflection scheme) which is an analogue of the reflection principle of Zermelo-Fraenkel set theory. Here is a language with a distinguished linear order <, and REF consists of formulas of the form

Hadwiger Number and the Cartesian Product of Graphs

The Hadwiger number η(G) of a graph G is the largest integer n for which the complete graph K _n on n vertices is a minor of G. Hadwiger conjectured that for every graph G, η(G) ≥ χ(G), where χ(G) is the chromatic number of G. In this paper, we study the Hadwiger number of the Cartesian product of graphs. As the main result of this paper, we prove that for any two graphs G ₁ and G ₂ with η(G ₁) = h and η(G ₂) = l. We show that the above lower bound is asymptotically best possible when h ≥ l. This asymptotically settles a question of Z. Miller (1978). As consequences of our main result, we show the following:

Matlis reflexive and generalized local cohomology modules

Let (R,m) be a complete local ring, a an ideal of R and N and L two Matlis reflexive R-modules with Supp(L) ⊆ V(a). We prove that if M is a finitely generated R-module, then Exti _R ⁱ (L, H _a ^j (M,N)) is Matlis reflexive for all i and j in the following cases:

A geometrical problem arising in a signal restoration algorithm

Let ℤ_2N={0, ..., 2N-1} denote the group of integers modulo 2N, and let L be the space of all real functions of ℤ_2N which are supported on {0,...N−1}. The spectral phase of a function f:ℤ_2N→ℝ is given by φ_f(k)=arg for k ∈ ℤ_2N, where denotes the discrete Fourier transforms of f. For a fixed s∈L let K_s denote the cone of all f:ℤ_2N→ℝ which satisfy φ_f ≡ φ_s and let M_s be its linear span. The angle α_s between M_s and L determines the convergence rate of the signal restoration from phase algorithm of Levi and Stark [3]. Here we prove the following conjectures of Urieli et al. [7] who verified them for the N≤3 case:

Corps biquadratiques monogènes

Let be a biquadratic number field (where d,m,n∈ℤ, are uniquely determined); we say that it is monogenic if its ring of integers O_K is of the form ℤ[θ]. We show that K is monogenic if and only if the two following conditions are satisfied:

A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra

We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration of the vertices of an arrangement or of a convex polyhedron, in arbitrary dimension. The algorithm has the following properties:

Optimal Partition Trees

We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Matoušek (Discrete Comput. Geom. 10:157–182, 1993) gave a partition tree method for d-dimensional simplex range searching achieving O(n) space and O(n ^1−1/d ) query time. Although this method is generally believed to be optimal, it is complicated and requires O(n ^1+ε ) preprocessing time for any fixed ε>0. An earlier method by Matoušek (Discrete Comput. Geom. 8:315–334, 1992) requires O(nlogn) preprocessing time but O(n ^1−1/d log ^O(1) n) query time. We give a new method that achieves simultaneously O(nlogn) preprocessing time, O(n) space, and O(n ^1−1/d ) query time with high probability. Our method has several advantages:

Sparse finite element methods for operator equations with stochastic data

Let A: V → V′ be a strongly elliptic operator on a d-dimensional manifold D (polyhedra or boundaries of polyhedra are also allowed). An operator equation Au = f with stochastic data f is considered. The goal of the computation is the mean field and higher moments of the solution. We discretize the mean field problem using a FEM with hierarchical basis and N degrees of freedom. We present a Monte-Carlo algorithm and a deterministic algorithm for the approximation of the moment for k⩾1. The key tool in both algorithms is a “sparse tensor product” space for the approximation of with O(N(log N) ^k−1) degrees of freedom, instead of N ^k degrees of freedom for the full tensor product FEM space. A sparse Monte-Carlo FEM with M samples (i.e., deterministic solver) is proved to yield approximations to with a work of O(M N(log N) ^k−1) operations. The solutions are shown to converge with the optimal rates with respect to the Finite Element degrees of freedom N and the number M of samples. The deterministic FEM is based on deterministic equations for in D ^k ⊂ ℝ^kd. Their Galerkin approximation using sparse tensor products of the FE spaces in D allows approximation of with O(N(log N) ^k−1) degrees of freedom converging at an optimal rate (up to logs). For nonlocal operators wavelet compression of the operators is used. The linear systems are solved iteratively with multilevel preconditioning. This yields an approximation for with at most O(N (log N) ^k+1) operations. This work was supported under IHP Network “Breaking Complexity” by the Swiss BBW under grant No. 02.0418     

Some properties of unbounded operators with closed range

Let H ₁, H ₂ be Hilbert spaces and T be a closed linear operator defined on a dense subspace D(T) in H ₁ and taking values in H ₂. In this article we prove the following results:

Rational points on the unit sphere

It is known that the unit sphere, centered at the origin in ℝ ⁿ , has a dense set of points with rational coordinates. We give an elementary proof of this fact that includes explicit bounds on the complexity of the coordinates: for every point ν on the unit sphere in ℝ ⁿ , and every ν > 0; there is a point r = (r ₁; r ₂;…;r _n) such that:

Linear series onk-gonal curves

Here we prove the following result. Theorem 1.1.Let X be an integral projective curve of arithmetic genus g and k≧ ≧4 an integer. Assume the existence of L ∈ Pic^k (X) with h ⁰ (X, L)=2 and L spanned. Fix a rank 1 torsion free sheaf M on X with h ⁰(X,M)=r+1≧2, h¹ (X, M)≧2 and M spanned by its global sections. Set d≔deg(M) and s≔max {n≧0:h ⁰ (X, M ⊗(L^*)^⊗n)>0}. Then one of the following cases occur: