Refinement equations and spline functions

In this paper, we exploit the relation between the regularity of refinable functions with non-integer dilations and the distribution of powers of a fixed number modulo 1, and show the nonexistence of a non-trivial C ^∞ solution of the refinement equation with non-integer dilations. Using this, we extend the results on the refinable splines with non-integer dilations and construct a counterexample to some conjecture concerning the refinable splines with non-integer dilations. Finally, we study the box splines satisfying the refinement equation with non-integer dilation and translations. Our study involves techniques from number theory and harmonic analysis.     

Multivariate F-splines and Fractional Box Splines

We introduce multivariate F-splines, including multivariate F-truncated powers T _f (?|M) and F-box splines B _f (?|M). The classical multivariate polynomial splines and multivariate E-splines can be considered as a special case of multivariate F-splines. We document the main properties of T _f (?|M) and B _f (?|M). Using T _f (?|M), we extend fractional B-splines to fractional box splines and show that these functions satisfy most of the properties of the traditional box splines. Our work unifies and generalizes results due to Dahmen-Micchelli, de Boor-Höllig, Ron and Unser-Blu, and also presents a new tool for computing the integration over polytopes.     

Cardinal interpolation,submodules and the 4-direction mesh

This paper introduces the idea of cardinal interpolation on submodules of Z^d by translates of box splines if the condition of global linear independence fails to hold. In particular, the special case of the 4-direction box splines is discussed, where the pertinent submodule is given by the pairs (k, l) of integersk, l withk+l even. For this case, one obtains results that parallel the known results for the 3-direction box splines.     

Bivariate box splines and smooth pp functions on a three direction mesh

Let S denote the space of bivariate piecewise polynomial functions of degree ? k and smoothness ρ on the regular mesh generated by the three directions (1, 0), (0, 1), (1, 1). We construct a basis for S in terms of box splines and truncated powers. This allows us to determine the polynomials which are locally contained in S and to give upper and lower bounds for the degree of approximation. For $\text{ρ = ?}\text{(2k ? 2)}\text{3}\text{?}$, k ? 2 (3), the case of minimal degree k for given smoothness ρ, we identify the elements of minimal support in S and give a basis for $\text{S}{}_{\mathrm{<mtext>loc</mtext>}}\text{= {f ∈ S:}\text{supp}\text{f ? Ω}}$, with Ω a convex subset of $\text{R}$².     

Derivation radical subspace arrangements

In this note we study modules of derivations on collections of linear subspaces in a finite dimensional vector space. The central aim is to generalize the notion of freeness from hyperplane arrangements to subspace arrangements. We call this generalization ‘derivation radical’. We classify all coordinate subspace arrangements that are derivation radical and show that certain subspace arrangements of the Braid arrangement are derivation radical. We conclude by proving that under an algebraic condition the subspace arrangement consisting of all codimension c intersections, where c is fixed, of a free hyperplane arrangement are derivation radical.     

Bernstein-Sato ideals and hyperplane arrangements

We study the relation between zero loci of Bernstein-Sato ideals and roots of b-functions and obtain a criterion to guarantee that roots of b-functions of a reducible polynomial are determined by the zero locus of the associated Bernstein-Sato ideal. Applying the criterion together with a result of Maisonobe we prove that the set of roots of the b-function of a free hyperplane arrangement is determined by its intersection lattice.We also study the zero loci of Bernstein-Sato ideals and the associated relative characteristic cycles for arbitrary central hyperplane arrangements. We prove the multivariable $n/d$ conjecture of Budur for complete factorizations of arbitrary hyperplane arrangements, which in turn proves the strong monodromy conjecture for the associated multivariable topological zeta functions.     

Multivariate compactly supported biorthogonal spline wavelets

We study biorthogonal bases of compactly supported wavelets constructed from box splines in ℝ ^N with any integer dilation factor. For a suitable class of box splines we write explicitly dual low-pass filters of arbitrarily high regularity and indicate how to construct the corresponding high-pass filters (primal and dual). Received: August 23, 2000; in final form: March 10, 2001?Published online: May 29, 2002     

The diffeomorphic types of the complements of arrangements in ℂℙ3 II

For any arrangement of hyperplanes in ??³, we introduce the soul of this arrangement. The soul, which is a pseudo-complex, is determined by the combinatorics of the arrangement of hyperplanes. In this paper, we give a sufficient combinatoric condition for two arrangements of hyperplanes to be diffeomorphic to each other. In particular we have found sufficient conditions on combinatorics for the arrangement of hyperplanes whose moduli space is connected. This generalizes our previous result on hyperplane point arrangements in ??³.     

A General Multiresolution Method for Fitting Functions on the Sphere

In [7], Lyche and Schumaker have described a method for fitting functions of class C ¹ on the sphere which is based on tensor products of quadratic polynomial splines and trigonometric splines of order three associated with uniform knots. In this paper, we present a multiresolution method leading to C ²-functions on the sphere, using tensor products of polynomial and trigonometric splines of odd order with arbitrary simple knot sequences. We determine the decomposition and reconstruction matrices corresponding to the polynomial and trigonometric spline spaces. We describe the general tensor product decomposition and reconstruction algorithms in matrix form which are convenient for the compression of surfaces. We give the different steps of the computer implementation of these algorithms and, finally, we present a test example.     

Characterization of a free arrangement and conjecture of Edelman and Reiner

We consider a hyperplane arrangement in a vector space of dimension four or higher. In this case, the freeness of the arrangement is characterized by properties around a fixed hyperplane. As an application, we prove the freeness of cones over certain truncated affine Weyl arrangements which was conjectured by Edelman and Reiner.     

The diffeomorphic types of the complements of arrangements in ??3 II

For any arrangement of hyperplanes in ℂℙ³, we introduce the soul of this arrangement. The soul, which is a pseudo-complex, is determined by the combinatorics of the arrangement of hyperplanes. In this paper, we give a sufficient combinatoric condition for two arrangements of hyperplanes to be diffeomorphic to each other. In particular we have found sufficient conditions on combinatorics for the arrangement of hyperplanes whose moduli space is connected. This generalizes our previous result on hyperplane point arrangements in ℂℙ³. This work was partially supported by NSA grant and NSF grant     

Exponential box splines

In a recent paper by Nira Dyn and the author, univariate cardinal exponential B-splines are shown to have a representation similar to the wellknown box spline representation of the univariate cardinal polynomialB-splines. Motivated by this, we construct, for a set ofn directions inZ ^s and a vector of constants λ ?R ⁿ, an “exponential box spline” which has the same smoothness and support as the polynomial box spline, and is a positive piecewise exponential in its support. We derive recurrence relations for the exponential box splines which are simpler than those for the polynomial case. A relatively simple structure of the space spanned by the translates of an exponential box spline is obtained for λ in a certain open dense set ofR ⁿ—the “simple” λ. In this case, the characterization of the local independence of the translates and related topics, as well as the proofs involved, are quite simple when compared with the polynomial case (corresponding toλ = 0).     

Oriented matroids with few mutations

This paper defines a “connected sum” operation on oriented matroids of the same rank. This construction is used for three different applications in rank 4. First it provides nonrealizable pseudoplane arrangements with a low number of simplicial regions. This contrasts the case of realizable hyperplane arrangements: by a classical theorem of Shannon every arrangement ofn projective planes in ℝP ^d-1 contains at leastn simplicial regions and every plane is adjacent to at leastd simplicial regions [17], [18]. We construct a class of uniform pseudoarrangements of 4n pseudoplanes in ℝP³ with only 3n+1 simplicial regions. Furthermore, we construct an arrangement of 20 pseudoplanes where one plane is not adjacent to any simplicial region. Finally we disprove the “strong-map conjecture” of Las Vergnas [1]. We describe an arrangement of 12 pseudoplanes containing two points that cannot be simultaneously contained in an extending hyperplane.     

Completely reducible hypersurfaces in a pencil

We study completely reducible fibers of pencils of hypersurfaces on Pn and associated codimension one foliations of Pn. Using methods from theory of foliations we obtain certain upper bounds for the number of these fibers as functions only of n. Equivalently this gives upper bounds for the dimensions of resonance varieties of hyperplane arrangements. We obtain similar bounds for the dimensions of the characteristic varieties of the arrangement complements.     

Lagrange Interpolation by Bivariate C 1-Splines with Optimal Approximation Order

We develop the first local Lagrange interpolation scheme for C ¹-splines of degree q≥3 on arbitrary triangulations. For doing this, we use a fast coloring algorithm to subdivide about half of the triangles by a Clough–Tocher split in an appropriate way. Based on this coloring, we choose interpolation points such that the corresponding fundamental splines have local support. The interpolating splines yield optimal approximation order and can be computed with linear complexity. Numerical examples with a large number of interpolation points show that our method works efficiently.     

A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing

Motivated by an open problem from graph drawing, we study several partitioning problems for line and hyperplane arrangements. We prove a ham-sandwich cut theorem: given two sets of n lines in ?², there is a line ? such that in both line sets, for both halfplanes delimited by ?, there are $\sqrt{n}$ lines which pairwise intersect in that halfplane, and this bound is tight; a centerpoint theorem: for any set of n lines there is a point such that for any halfplane containing that point there are $\sqrt{n/3}$ of the lines which pairwise intersect in that halfplane. We generalize those results in higher dimension and obtain a center transversal theorem, a same-type lemma, and a positive portion Erd?s–Szekeres theorem for hyperplane arrangements. This is done by formulating a generalization of the center transversal theorem which applies to set functions that are much more general than measures. Back to graph drawing (and in the plane), we completely solve the open problem that motivated our search: there is no set of n labeled lines that are universal for all n-vertex labeled planar graphs. In contrast, the main result by Pach and Toth (J. Graph Theory 46(1):39–47, 2004), has, as an easy consequence, that every set of n (unlabeled) lines is universal for all n-vertex (unlabeled) planar graphs.     

Relation spaces of hyperplane arrangements and modules defined by graphs of fiber zonotopes

We study the exactness of certain combinatorially defined complexes which generalize the Orlik-Solomon algebra of a geometric lattice. The main results pertain to complex reflection arrangements and their restrictions. In particular, we consider the corresponding relation complexes and give a simple proof of the n-formality of these hyperplane arrangements. As an application, we are able to bound the Castelnouvo-Mumford regularity of certain modules over polynomial rings associated to Coxeter arrangements (real reflection arrangements) and their restrictions. The modules in question are defined using the relation complex of the Coxeter arrangement and fiber polytopes of the dual Coxeter zonotope. They generalize the algebra of piecewise polynomial functions on the original arrangement.     

Cardinal hermite interpolation with box splines

The study of cardinal interpolation (CIP) by the span of the lattice translates of a box spline has met with limited success. Only the case of interpolation with the box spline determined by the three directionsd ₁=(1, 0),d ₂=(0, 1), andd ₃=(1, 1) inR ² has been treated in full generality [2]. In the case ofR ^d,d ≥ 3, the directions that define the box spline must satisfy a certain determinant condition [6], [9]. If the directions occur with even multiplicities, then this condition is also sufficient. For Hermite interpolation (CHIP) both even multiplicities and the determinant condition for the directions does not prevent the linear dependence of the basis functions. This leads to singularities in the characteristic multiplier when using the standard Fourier transform method. In the case of derivatives in one direction, these singularities can be removed and a set of fundamental splines can be given. This gives the existence of a solution to CHIP inL ^p (R ^d) for data inl ^p (Z ^d), 1≤p≤2.     

Construction of interpolation splines minimizing semi-norm in W_{2}^{(m,m-1)}(0,1) space

In the present paper using S.L. Sobolev’s method interpolation splines minimizing the semi-norm in a Hilbert space are constructed. Explicit formulas for coefficients of interpolation splines are obtained. The obtained interpolation spline is exact for polynomials of degree m?2 and e ^?x . Also some numerical results are presented.