Lattices on simplicial partitions

In this paper, (d+1)-pencil lattices on simplicial partitions in R^d are studied. The barycentric approach naturally extends the lattice from a simplex to a simplicial partition, providing a continuous piecewise polynomial interpolant over the extended lattice. The number of degrees of freedom is equal to the number of vertices of the simplicial partition. The constructive proof of this fact leads to an efficient computer algorithm for the design of a lattice.     

Entropy estimate for high-dimensional monotonic functions

We establish upper and lower bounds for the metric entropy and bracketing entropy of the class of d-dimensional bounded monotonic functions under L^p norms. It is interesting to see that both the metric entropy and bracketing entropy have different behaviors for p<d/(d-1) and p>d/(d-1). We apply the new bounds for bracketing entropy to establish a global rate of convergence of the MLE of a d-dimensional monotone density.     

Enumeration of three-dimensional convex polygons

A self-avoiding polygon (SAP) on a graph is an elementary cycle. Counting SAPs on the hypercubic lattice ℤ ^d withd≥2, is a well-known unsolved problem, which is studied both for its combinatorial and probabilistic interest and its connections with statistical mechanics. Of course, polygons on ℤ ^d are defined up to a translation, and the relevant statistic is their perimeter. A SAP on ℤ ^d is said to beconvex if its perimeter is “minimal”, that is, is exactly twice the sum of the side lengths of the smallest hyper-rectangle containing it. In 1984, Delest and Viennot enumerated convex SAPs on the square lattice [6], but no result was available in a higher dimension. We present an elementar approach to enumerate convex SAPs in any dimension. We first obtain a new proof of Delest and Viennot's result, which explains combinatorially the form of the generating function. We then compute the generating function for convex SAPs on the cubic lattice. In a dimension larger than 3, the details of the calculations become very cumbersome. However, our method suggests that the generating function for convex SAPs on ℤ ^d is always a quotient ofdifferentiably finite power series.     

A recursive method for computing interpolants

In this paper, we describe a recursive method for computing interpolants defined in a space spanned by a finite number of continuous functions in R^d${\mathbb{R}}^d$. We apply this method to construct several interpolants such as spline interpolants, tensor product interpolants and multivariate polynomial interpolants. We also give a simple algorithm for solving a multivariate polynomial interpolation problem and constructing the minimal interpolation space for a given finite set of interpolation points.     

New results for best approximation on Banach lattices

The purpose of this paper is to introduce and to discuss the concept of approximation preserving operators on Banach lattices with a strong unit. We show that every lattice isomorphism is an approximation preserving operator. Also we give a necessary and sufficient condition for uniqueness of the best approximation by closed normal subsets of X⁺$X^{+}$, and show that this condition is characterized by some special operators.     

Monoidal intervals of clones on infinite sets

Let X be an infinite set of cardinality κ. We show that if L is an algebraic and dually algebraic distributive lattice with at most 2^κ completely join irreducibles, then there exists a monoidal interval in the clone lattice on X which is isomorphic to the lattice 1+L obtained by adding a new smallest element to L. In particular, we find that if L is any chain which is an algebraic lattice, and if L does not have more than 2^κ completely join irreducibles, then 1+L appears as a monoidal interval; also, if λ?2^κ, then the power set of λ with an additional smallest element is a monoidal interval. Concerning cardinalities of monoidal intervals these results imply that there are monoidal intervals of all cardinalities not greater than 2^κ, as well as monoidal intervals of cardinality 2^λ, for all λ?2^κ.     

Integration and approximation in arbitrary dimensions

We study multivariate integration and approximation for various classes of functions of d variables with arbitrary d. We consider algorithms that use function evaluations as the information about the function. We are mainly interested in verifying when integration and approximation are tractable and strongly tractable. Tractability means that the minimal number of function evaluations needed to reduce the initial error by a factor of ɛ is bounded by C(d)ɛ^−p for some exponent p independent of d and some function C(d). Strong tractability means that C(d) can be made independent of d. The ‐exponents of tractability and strong tractability are defined as the smallest powers of ɛ{^-1} in these bounds. We prove that integration is strongly tractable for some weighted Korobov and Sobolev spaces as well as for the Hilbert space whose reproducing kernel corresponds to the covariance function of the isotropic Wiener measure. We obtain bounds on the ‐exponents, and for some cases we find their exact values. For some weighted Korobov and Sobolev spaces, the strong ‐exponent is the same as the ‐exponent for d=1, whereas for the third space it is 2. For approximation we also consider algorithms that use general evaluations given by arbitrary continuous linear functionals as the information about the function. Our main result is that the ‐exponents are the same for general and function evaluations. This holds under the assumption that the orthonormal eigenfunctions of the covariance operator have uniformly bounded L∞ norms. This assumption holds for spaces with shift-invariant kernels. Examples of such spaces include weighted Korobov spaces. For a space with non‐shift‐invariant kernel, we construct the corresponding space with shift-invariant kernel and show that integration and approximation for the non-shift-invariant kernel are no harder than the corresponding problems with the shift-invariant kernel. If we apply this construction to a weighted Sobolev space, whose kernel is non-shift-invariant, then we obtain the corresponding Korobov space. This enables us to derive the results for weighted Sobolev spaces. This revised version was published online in June 2006 with corrections to the Cover Date.     

Constructing super Gabor frames: the rational time-frequency lattice case

For a time-frequency lattice Λ = A Z d B Z d , it is known that an orthonormal super Gabor frame of length L exists with respect to this lattice if and only if |det( AB) | = 1 L . The proof of this result involves various techniques from multi-lattice tiling and operator algebra theory, and it is far from constructive. In this paper we present a very general scheme for constructing super Gabor frames for the rational lattice case. Our method is based on partitioning an arbitrary fundamental domain of the lattice in the frequency domain such that each subset in the partition tiles R d by the lattice in the time domain. This approach not only provides us a simple algorithm of constructing various kinds of orthonormal super Gabor frames with flexible length and multiplicity, but also allows us to construct super Gabor (non-Riesz) frames with high order smoothness and regularity. Several examples are also presented.     

Comparability graphs of lattices

A theorem of N. Terai and T. Hibi for finite distributive lattices and a theorem of Hibi for finite modular lattices (suggested by R.P. Stanley) are equivalent to the following: if a finite distributive or modular lattice of rank d contains a complemented rank 3 interval, then the lattice is (d+1)-connected.In this paper, the following generalization is proved: Let L be a (finite or infinite) semimodular lattice of rank d that is not a chain (d∈N₀). Then the comparability graph of L is (d+1)-connected if and only if L has no simplicial elements, where z∈L is simplicial if the elements comparable to z form a chain.     

Error saturation in Gaussian radial basis functions on a finite interval

Radial basis function (RBF) interpolation is a “meshless” strategy with great promise for adaptive approximation. One restriction is “error saturation” which occurs for many types of RBFs including Gaussian RBFs of the form ?(x;α,h)=exp(−α²(x/h)²): in the limit h→0 for fixed α, the error does not converge to zero, but rather to E_S(α). Previous studies have theoretically determined the saturation error for Gaussian RBF on an infinite, uniform interval and for the same with a single point omitted. (The gap enormously increases E_S(α).) We show experimentally that the saturation error on the unit interval, x∈[−1,1], is about 0.06exp(−0.47/α²)‖f‖_∞ — huge compared to the O(2π/α²)exp(−π²/[4α²]) saturation error for a grid with one point omitted. We show that the reason the saturation is so large on a finite interval is that it is equivalent to an infinite grid which is uniform except for a gap of many points. The saturation error can be avoided by choosing α?1, the “flat limit”, but the condition number of the interpolation matrix explodes as O(exp(π²/[4α²])). The best strategy is to choose the largest α which yields an acceptably small saturation error: If the user chooses an error tolerance δ, then .     

Multiple zeta functions and asymptotic structure of free Abelian groups of finite rank

We define the multiple zeta function of the free Abelian group Z^d as

ζ_Z^d(s₁,…,s_d)=∑_|Z^d:H|<∞α₁(H)^−s₁?α_d(H)^−s_d,     

On the homogeneous algebraic graphs of large girth and their applications

Families of finite graphs of large girth were introduced in classical extremal graph theory. One important theoretical result here is the upper bound on the maximal size of the graph with girth ?2d established in Even Circuit Theorem by P. Erdös. We consider some results on such algebraic graphs over any field. The upper bound on the dimension of variety of edges for algebraic graphs of girth ?2d is established. Getting the lower bound, we use the family of bipartite graphs D(n,K) with n?2 over a field K, whose partition sets are two copies of the vector space Kⁿ. We consider the problem of constructing homogeneous algebraic graphs with a prescribed girth and formulate some problems motivated by classical extremal graph theory. Finally, we present a very short survey on applications of finite homogeneous algebraic graphs to coding theory and cryptography.     

Additive results for the Wg-Drazin inverse

In this paper we prove the formula for the expression (A+B)^d,W in terms of A,B,W,A^d,W,B^d,W, assuming some conditions for A,B and W. Here S^d,W denotes the generalized W-weighted Drazin inverse of a linear bounded operator S on a Banach space.     

On graphs whose star sets are (co-)cliques

In this paper we study graphs all of whose star sets induce cliques or co-cliques. We show that the star sets of every tree for each eigenvalue are independent sets. Among other results it is shown that each star set of a connected graph G with three distinct eigenvalues induces a clique if and only if G=K_1,2 or K_2,…,2. It is also proved that stars are the only graphs with three distinct eigenvalues having a star partition with independent star sets.     

Quadrature formulas on the unit circle with prescribed nodes and maximal domain of validity

In this paper we investigate the Szeg?-Radau and Szeg?-Lobatto quadrature formulas on the unit circle. These are (n+m)-point formulas for which m nodes are fixed in advance, with m=1 and m=2 respectively, and which have a maximal domain of validity in the space of Laurent polynomials. This means that the free parameters (free nodes and positive weights) are chosen such that the quadrature formula is exact for all powers z^j, −p≤j≤p, with p=p(n,m) as large as possible.     

The Topological Tverberg Theorem and winding numbers

The Topological Tverberg Theorem claims that any continuous map of a (q-1)(d+1)-simplex to R^d identifies points from q disjoint faces. (This has been proved for affine maps, for d?1, and if q is a prime power, but not yet in general.)The Topological Tverberg Theorem can be restricted to maps of the d-skeleton of the simplex. We further show that it is equivalent to a “Winding Number Conjecture” that concerns only maps of the (d-1)-skeleton of a (q-1)(d+1)-simplex to R^d. “Many Tverberg partitions” arise if and only if there are “many q-winding partitions.”The d=2 case of the Winding Number Conjecture is a problem about drawings of the complete graphs K_3q-2 in the plane. We investigate graphs that are minimal with respect to the winding number condition.     

A finite dimensional approximation of the effective diffusivity for a symmetric random walk in a random environment

We consider a nearest neighbor, symmetric random walk on a homogeneous, ergodic random lattice Z^d${\mathbb{Z}}^d$. The jump rates of the walk are independent, identically Bernoulli distributed random variables indexed by the bonds of the lattice. A standard result from the homogenization theory, see [A. De Masi, P.A. Ferrari, S. Goldstein, W.D. Wick, An invariance principle for reversible Markov processes, Applications to random walks in random environments, J. Statist. Phys. 55(3/4) (1989) 787–855], asserts that the scaled trajectory of the particle satisfies the functional central limit theorem. The covariance matrix of the limiting normal distribution is called the effective diffusivity of the walk. We use the duality structure corresponding to the product Bernoulli measure to construct a numerical scheme that approximates this parameter when d?3$d?3$. The estimates of the convergence rates are also provided.     

Cardinal hermite interpolation with box splines II

Summary In the present work we extent the results in [RS] on CHIP, i.e. Cardinal Hermite Interpolation by the span of translates of directional derivatives of a box spline. These directional derivatives are that ones which define the type of the Hermite Interpolation. We admit here several (linearly independent) directions with multiplicities instead of one direction as in [RS]. Under the same assumptions on the smoothness of the box spline and its defining matrixT we can prove as in [RS]: CHIP has a system of fundamental solutions which are inL L ² together with its directional derivatives mentioned above. Moreover, for data sequences inl ^p ( ^d ), 1p2, there is a spline function inL ^p, 1/p+1/p=1, which solves CHIP.Research supported in part by NSERC Canada under Grant # A7687. This research was completed while this author was supported by a grant from the Deutscher Akademischer Austauschdienst     

An analogue of the Harer-Zagier formula for unicellular maps on general surfaces

A unicellular map is the embedding of a connected graph in a surface in such a way that the complement of the graph is simply connected. In a famous article, Harer and Zagier established a formula for the generating function of unicellular maps counted according to the number of vertices and edges. The keystone of their approach is a counting formula for unicellular maps on orientable surfaces with n edges, and with vertices colored using every color in [q] (adjacent vertices are authorized to have the same color). We give an analogue of this formula for general (locally orientable) surfaces.Our approach is bijective and is inspired by Lass?s proof of the Harer-Zagier formula. We first revisit Lass?s proof and twist it into a bijection between unicellular maps on orientable surfaces with vertices colored using every color in [q], and maps with vertex set [q] on orientable surfaces with a marked spanning tree. The bijection immediately implies Harer-Zagier?s formula and a formula by Jackson concerning bipartite unicellular maps. It also shed a new light on constructions by Goulden and Nica, Schaeffer and Vassilieva, and Morales and Vassilieva. We then extend the bijection to general surfaces and obtain a correspondence between unicellular maps on general surfaces with vertices colored using every color in [q], and maps on orientable surfaces with vertex set [q]with a marked planar submap. This correspondence gives an analogue of the Harer-Zagier formula for general surfaces. We also show that this formula implies a recursion formula due to Ledoux for the numbers of unicellular maps with given numbers of vertices and edges.