On the sizes of Delaunay meshes

Let be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of with bounded vertex degree is within a factor of the size of any Delaunay mesh of with bounded radius-edge ratio. The term depends on the geometry of and it is likely a small constant when the boundaries of are fine triangular meshes. There are several consequences. First, among all Delaunay meshes with bounded radius-edge ratio, those returned by Delaunay refinement algorithms have asymptotically optimal sizes. This is another advantage of meshing with Delaunay refinement algorithms. Second, if no input angle is acute, the minimum Delaunay mesh with bounded radius-edge ratio is not much smaller than any minimum mesh with aspect ratio bounded by a particular constant.     

Asymptotic expression of the linear discrete best -approximation

Let h_p, 1<p<∞, be the best ℓ_p-approximation of the element from a proper affine subspace K of , hK, and let denote the strict uniform approximation of h from K. We prove that there are a vector and a real number a, 0a1, such that

for all p>1, where with γ_p=o(a^p/p).     

More Efficient Parallel Totally Monotone Matrix Searching

We give a parallel algorithm for computing all row minima in a totally monotonen × nmatrix which is simpler and more work efficient than previous polylog-time algorithms. It runs inO(lg n lg lg n) time doingwork on aCRCW PRAM, inO(lg n(lg lg n)²) time doingwork on aCREW PRAM, and intime doingwork on anEREW PRAM. Since finding the row minima of a totally monotone matrix has been shown to be fundamental in the efficient solution of a host of geometric and combinatorial problems, our algorithm leads directly to improved parallel solutions of many algorithms in terms of their work efficiency.     

On the layered nearest neighbour estimate, the bagged nearest neighbour estimate and the random forest method in regression and classification

Let be identically distributed random vectors in R^d, independently drawn according to some probability density. An observation is said to be a layered nearest neighbour (LNN) of a point if the hyperrectangle defined by and contains no other data points. We first establish consistency results on , the number of LNN of . Then, given a sample of independent identically distributed random vectors from R^d×R, one may estimate the regression function by the LNN estimate , defined as an average over the Y_i’s corresponding to those which are LNN of . Under mild conditions on r, we establish the consistency of towards 0 as n→∞, for almost all and all p≥1, and discuss the links between r_n and the random forest estimates of Breiman (2001) [8]. We finally show the universal consistency of the bagged (bootstrap-aggregated) nearest neighbour method for regression and classification.     

Combinatorial sums and finite differences

We present a new approach to evaluating combinatorial sums by using finite differences. Let and be sequences with the property that Δb_k=a_k for k?0. Let , and let . We derive expressions for g_n in terms of h_n and for h_n in terms of g_n. We then extend our approach to handle binomial sums of the form , , and , as well as sums involving unsigned and signed Stirling numbers of the first kind, and . For each type of sum we illustrate our methods by deriving an expression for the power sum, with a_k=k^m, and the harmonic number sum, with a_k=H_k=1+1/2+?+1/k. Then we generalize our approach to a class of numbers satisfying a particular type of recurrence relation. This class includes the binomial coefficients and the unsigned Stirling numbers of the first kind.     

Three positive solutions of semilinear elliptic equations in the half space with a hole

In this paper, assume that h is nonnegative and ‖hL²_‖>0, we prove that if ‖hL²_‖ is sufficiently small, then there are at least three positive solutions of Eq. (1) in , where D is a C1,1 bounded domain in .     

On the Number of Solutions of Polynomial Systems

We consider systems of homogenous polynomial equations of degreedin a projective space ^mover a finite field _q. We attempt to determine the maximum possible number of solutions of such systems. The complete answer for the caser= 2,d<q− 1 is given, as well as new conjectures about the general case. We also prove a bound on the number of points of an algebraic set of given codimension and degree. We also discuss an application of our results to coding theory, namely to the problem of computing generalized Hamming weights forq-ary projective Reed–Muller codes.     

Finite element analysis of an A– method for time-dependent Maxwell’s equations based on explicit-magnetic-field scheme

In this paper, error analysis of a finite element A– method for the time-dependent Maxwell’s equations is presented. An explicit-magnetic-field scheme is applied. Provided that the time-stepsize τ is sufficiently small, the proposed algorithm yields for finite time T an error of in the L²-norm for the electric field E and the magnetic field H, where h is the mesh size.     

Oscillation of second-order damped dynamic equations on time scales

The study of dynamic equations on time scales has been created in order to unify the study of differential and difference equations. The general idea is to prove a result for a dynamic equation where the domain of the unknown function is a so-called time scale, which may be an arbitrary closed subset of the reals. This way results not only related to the set of real numbers or set of integers but those pertaining to more general time scales are obtained. In this paper, by employing the Riccati transformation technique we will establish some oscillation criteria for second-order linear and nonlinear dynamic equations with damping terms on a time scale . Our results in the special case when and extend and improve some well-known oscillation results for second-order linear and nonlinear differential and difference equations and are essentially new on the time scales , h>0, for q>1, , etc. Some examples are considered to illustrate our main results.     

Backward Shift Invariant Operator Ranges

Results on first order Ext groups for Hilbert modules over the disk algebra are used to study certain backward shift invariant operator ranges, namely de Branges–Rovnyak spaces and a more general class called (W; B) spaces. Necessary and sufficient conditions are given for the groups Ext¹_A()(, (W; B)) to vanish whereis thedualof the vector-valued Hardy module, H². One condition involves an extension problem for the Hankel operator with symbolB,Γ_B, but viewed as a module map from H²into (W; B). The group Ext¹_A()(, (W; B))=(0) precisely whenΓ_Bextends to a module map from L²into (W; B) and this in turn is equivalent to the injectivity of (W; B) in the category of contractive HilbertA()-modules. This result applied to the de Branges–Rovnyak spaces yields a connection between the extension problem for the HankelΓ_B and the operator corona problem.     

An inverse scattering problem for the Schrödinger equation in a semiclassical process

We study a direct and an inverse scattering problem for a pair of Hamiltonians (H(h),H₀(h)) on , where H₀(h)=−h²Δ and H(h)=H₀(h)+V, V is a short-range potential and h is the semiclassical parameter. First, we show that if two potentials are equal in the classical allowed region for a fixed non-trapping energy, the associated scattering matrices coincide up to O(h^∞) in . Then, for potentials with a regular behaviour at infinity, we study the inverse scattering problem. We show that in dimension n3, the knowledge of the scattering operators S(h), , up to O(h^∞) in , and which are localized near a fixed energy λ>0, determine the potential V at infinity.     

Weight distribution of some reducible cyclic codes

Let q=p^m where p is an odd prime, m3, k1 and gcd(k,m)=1. Let Tr be the trace mapping from to and . In this paper we determine the value distribution of following two kinds of exponential sums

and

where is the canonical additive character of . As an application, we determine the weight distribution of the cyclic codes and over with parity-check polynomial h₂(x)h₃(x) and h₁(x)h₂(x)h₃(x), respectively, where h₁(x), h₂(x) and h₃(x) are the minimal polynomials of π⁻¹, π⁻² and π^−(pk+1) over , respectively, for a primitive element π of .     

Asymptotic cone of semisimple orbits for symmetric pairs

Let G be a reductive algebraic group over C and denote its Lie algebra by g. Let Oh be a closed G-orbit through a semisimple element h∈g. By a result of Borho and Kraft (1979) [4], it is known that the asymptotic cone of the orbit Oh is the closure of a Richardson nilpotent orbit corresponding to a parabolic subgroup whose Levi component is the centralizer ZG(h) in G. In this paper, we prove an analogue on a semisimple orbit for a symmetric pair.More precisely, let θ be an involution of G, and K=Gθ a fixed point subgroup of θ. Then we have a Cartan decomposition g=k+s of the Lie algebra g=Lie(G) which is the eigenspace decomposition of θ on g. Let {x,h,y} be a normal sl₂ triple, where x,y∈s are nilpotent, and h∈k semisimple. In addition, we assume , where denotes the complex conjugation which commutes with θ. Then is a semisimple element in s, and we can consider a semisimple orbit Ad(K)a in s, which is closed. Our main result asserts that the asymptotic cone of Ad(K)a in s coincides with , if x is even nilpotent.     

Problems arising from jackknifing the estimate of a Kaplan-Meier integral

Stute and Wang (1994) considered the problem of estimating the integral S^θ = ∫ θ dF, based on a possibly censored sample from a distribution F, where θ is an F-integrable function. They proposed a Kaplan-Meier integral to approximate S^θ and derived an explicit formula for the delete-1 jackknife estimate . differs from only when the largest observation, X_(n), is not censored (δ_(n) = 1 and next-to-the-largest observation, X_(n-1), is censored (δ_(n-1) = 0). In this note, it will pointed out that when X_(n) is censored is based on a defective distribution, and therefore can badly underestimate . We derive an explicit formula for the delete-2 jackknife estimate . However, on comparing the expressions of and , their difference is negligible. To improve the performance of and , we propose a modified estimator according to Efron (1980). Simulation results demonstrate that is much less biased than and and .     

Higher power moments of the Riesz mean error term of symmetric square L-function

Let be the error term of the Riesz mean of the symmetric square L-function. We give the higher power moments of and show that if there exists a real number A₀:=A₀(ρ)>3 such that , then we can derive asymptotic formulas for , 3?h<A₀, h∈N. Particularly, we get asymptotic formulas for , h=3,4,5 unconditionally.     

Supersequences, rearrangements of sequences, and the spectrum of bases in additive number theory

The set of nonnegative integers is an asymptotic basis of order h if every sufficiently large integer can be represented as the sum of h elements of A. If an∼αnh for some real number α>0, then α is called an additive eigenvalue of order h. The additive spectrum of order h is the set N(h) consisting of all additive eigenvalues of order h. It is proved that there is a positive number ηh?1/h! such that N(h)=(0,ηh) or N(h)=(0,ηh]. The proof uses results about the construction of supersequences of sequences with prescribed asymptotic growth, and also about the asymptotics of rearrangements of infinite sequences. For example, it is proved that there does not exist a strictly increasing sequence of integers such that bn∼n² and B contains a subsequence such that bnk∼k³.     

Stability of a streamline diffusion finite element method for turning point problems

A one-dimensional singularly perturbed problem with a boundary turning point is considered in this paper. Let V^h be the linear finite element space on a suitable grid . A variant of streamline diffusion finite element method is proved to be almost uniform stable in the sense that the numerical approximation u_h satisfies u-u_h∞C|lnε| inf_vhV^hu-v_h∞, where C is independent with the small diffusion coefficient ε and the mesh . Such stability result is applied to layer-adapted grids to obtain almost ε-uniform second order scheme for turning point problems.     

Generic initial ideals and graded Artinian-level algebras not having the Weak-Lefschetz Property

We find a sufficient condition that is not level based on a reduction number. In particular, we prove that a graded Artinian algebra of codimension 3 with Hilbert function cannot be level if h_d≤2d+3, and that there exists a level O-sequence of codimension 3 of type for h_d≥2d+k for k≥4. Furthermore, we show that is not level if , and also prove that any codimension 3 Artinian graded algebra A=R/I cannot be level if . In this case, the Hilbert function of A does not have to satisfy the condition h_d−1>h_d=h_d+1.Moreover, we show that every codimension n graded Artinian level algebra having the Weak-Lefschetz Property has a strictly unimodal Hilbert function having a growth condition on (h_d−1−h_d)≤(n−1)(h_d−h_d+1) for every d>θ where

h₀<h₁<<h_α==h_θ>>h_s−1>h_s.