A theorem of M. F. Driscoll says that, under certain restrictions, the probability that a given Gaussian process has its sample paths almost surely in a given reproducing kernel Hilbert space (RKHS) is either or . Driscoll also found a necessary and sufficient condition for that probability to be .
Doing away with Driscoll's restrictions, R. Fortet generalized his condition and named it nuclear dominance. He stated a theorem claiming nuclear dominance to be necessary and sufficient for the existence of a process (not necessarily Gaussian) having its sample paths in a given RKHS. This theorem - specifically the necessity of the condition - turns out to be incorrect, as we will show via counterexamples. On the other hand, a weaker sufficient condition is available.
Using Fortet's tools along with some new ones, we correct Fortet's theorem and then find the generalization of Driscoll's result. The key idea is that of a random element in a RKHS whose values are sample paths of a stochastic process. As in Fortet's work, we make almost no assumptions about the reproducing kernels we use, and we demonstrate the extent to which one may dispense with the Gaussian assumption.
By the ``space of triangulations" of a finite point configuration we mean either of the following two objects: the graph of triangulations of , whose vertices are the triangulations of and whose edges are the geometric bistellar operations between them or the partially ordered set (poset) of all polyhedral subdivisions of ordered by coherent refinement. The latter is a modification of the more usual Baues poset of . It is explicitly introduced here for the first time and is of special interest in the theory of toric varieties.
We construct an integer point configuration in dimension 6 and a triangulation of it which admits no geometric bistellar operations. This triangulation is an isolated point in both the graph and the poset, which proves for the first time that these two objects cannot be connected.
The Fekete polynomials are defined as
where is the Legendre symbol. These polynomials arise in a number of contexts in analysis and number theory. For example, after cyclic permutation they provide sequences with smallest known norm out of the polynomials with coefficients.
The main purpose of this paper is to prove the following extremal property that characterizes the Fekete polynomials by their size at roots of unity.
Theorem 0.1. Let with odd and . If
then must be an odd prime and is . Here
This result also gives a partial answer to a problem of Harvey Cohn on character sums.
Let be a finite solvable group, and . Then , where denotes the Fitting height and denotes the composition length.
The purpose of this work is to give a treatment of the minimal configuration in this framework with additional conditions, yet without the coprimeness condition.
We prove that standard information in the randomized setting is as powerful as linear information in the worst case setting. Linear information means that algorithms may use arbitrary continuous linear functionals, and by the power of information we mean the speed of convergence of the th minimal errors, i.e., of the minimal errors among all algorithms using function evaluations. Previously, it was only known that standard information in the randomized setting is no more powerful than the linear information in the worst case setting.
We also study (strong) tractability of multivariate approximation in the randomized setting. That is, we study when the minimal number of function evaluations needed to reduce the initial error by a factor is polynomial in (strong tractability), and polynomial in and (tractability). We prove that these notions in the randomized setting for standard information are equivalent to the same notions in the worst case setting for linear information. This result is useful since for a number of important applications only standard information can be used and verifying (strong) tractability for standard information is in general difficult, whereas (strong) tractability in the worst case setting for linear information is known for many spaces and is relatively easy to check.
We illustrate the tractability results for weighted Korobov spaces. In particular, we present necessary and sufficient conditions for strong tractability and tractability. For product weights independent of , we prove that strong tractability is equivalent to tractability.
We stress that all proofs are constructive. That is, we provide randomized algorithms that enjoy the maximal speed of convergence. We also exhibit randomized algorithms which achieve strong tractability and tractability error bounds.
We investigate the uniqueness and agreement between different kinds of solutions for a free boundary problem in heat propagation that in classical terms is formulated as follows: to find a continuous function defined in a domain and such that
We also assume that the interior boundary of the positivity set, \nobreak 0\}$">, so-called free boundary, is a regular hypersurface on which the following conditions are satisfied:
Here denotes outward unit spatial normal to the free boundary. In addition, initial data are specified, as well as either Dirichlet or Neumann data on the parabolic boundary of . This problem arises in combustion theory as a limit situation in the propagation of premixed flames (high activation energy limit).
The problem admits classical solutions only for good data and for small times. Several generalized concepts of solution have been proposed, among them the concepts of limit solution and viscosity solution. We investigate conditions under which the three concepts agree and produce a unique solution.
Napoleon's theorem in elementary geometry describes how certain linear operations on plane polygons of arbitrary shape always produce regular polygons. More generally, certain triangulations of a polygon that tiles admit deformations which keep fixed the symmetry group of the tiling. This gives rise to isolation phenomena in cusped hyperbolic -manifolds, where hyperbolic Dehn surgeries on some collection of cusps leave the geometric structure at some other collection of cusps unchanged.
If is a properly immersed minimal surface in of finite topology that is eventually disjoint from then has finite total curvature.
The same question is also considered when the conclusion is finite type or parabolicity.
The sequence is called the iterated function system coming from the sequence We prove that a sufficient condition on the domain for all limit functions of any to be constant is also necessary. We prove that the condition is a quasiconformal invariant. Finally, we address the question of uniqueness of limit functions.
A (discrete) group is said to be maximally almost periodic if the points of are distinguished by homomorphisms into compact Hausdorff groups. A Hausdorff topology on a group is totally bounded if whenever there is such that . For purposes of this abstract, a family with a totally bounded topological group is a strongly extraresolvable family if (a) \vert G\vert$">, (b) each is dense in , and (c) distinct satisfy ; a totally bounded topological group with such a family is a strongly extraresolvable topological group.
We give two theorems, the second generalizing the first.
Theorem 1. Every infinite totally bounded group contains a dense strongly extraresolvable subgroup.
Corollary. In its largest totally bounded group topology, every infinite Abelian group is strongly extraresolvable.
Theorem 2. Let be maximally almost periodic. Then there are a subgroup of and a family such that
(i) is dense in every totally bounded group topology on ;
(ii) the family is a strongly extraresolvable family for every totally bounded group topology on such that ; and
(iii) admits a totally bounded group topology as in (ii).
Remark. In certain cases, for example when is Abelian, one must in Theorem 2 choose . In certain other cases, for example when the largest totally bounded group topology on is compact, the choice is impossible.