The efficient construction of higher-order interlaced polynomial lattice rules introduced recently in [6] is considered and the computational performance of these higher-order QMC rules is investigated on a suite of parametric, highdimensional test integrand functions. After reviewing the principles of their construction by the “fast component-by-component” (CBC) algorithm due to Nuyens and Coo...

A digraph H is immersed in a digraph G if the vertices of H are mapped to (distinct) vertices of G, and the edges of H are mapped to directed paths joining the corresponding pairs of vertices of G, in such a way that the paths are pairwise edge-disjoint. For graphs the same relation (using paths instead of directed paths) is a well-quasi-order; that is, in every infinite set of graphs some one ...

in this paper we define ?-independent (a weak-version of independence), kronecker and dissociate sets on hypergroups and study their properties and relationships among them and some other thin sets such as independent and sidon sets. these sets have the lacunarity or thinness property and are very useful indeed. for example varopoulos used the kronecker sets to prove the malliavin theorem. in t...

A quasi-interpolation formula based on discrete function values is given in the form of a multivariate spline series that yields the local approximation order characterized by the Fix-Strang conditions. This formula can be considered as a partial sum of the formal Neumann series expansion of the formal interpolation operator, and hence, justifies that "quasi-interpolation" is indeed an appropri...

For every prime p and integer n > 3 we explicitly construct an abelian variety A/Fpn of dimension n such that for a suitable prime l the group of quasi-isogenies of A/Fpn of l-power degree is canonically a dense subgroup of the n-th Morava stabilizer group at p. We also give a variant of this result taking into account a polarization. This is motivated by the recent construction of topological ...

We present the construction of a multivariate normalized B-spline basis for the quadratic C-continuous spline space defined over a triangulation in R (s ≥ 1) with a generalized Powell-Sabin refinement. The basis functions have a local support, they are nonnegative, and they form a partition of unity. The construction can be interpreted geometrically as the determination of a set of s-simplices ...

Deterministic conditional rewrite systems are interesting because they permit extra variables on the right-hand sides of the rules. If such a system is quasi-reductive, then it is terminating and has a computable rewrite relation. It will be shown that every deterministic CTRS R can be transformed into an unconditional TRS U(R) such that termination of U(R) implies quasi-reductivity of R. The m...