Related papers: Scalar Subdivision Schemes and Box Splines

Hartshorne developed a theory of generalized divisors on Gorenstein schemes to characterize codimension-one closed subschemes without embedded points. Generalized divisors can be viewed as a generalization of Weil divisors to non-normal…

In this paper we consider spaces of bivariate splines of bi-degree (m, n) with maximal order of smoothness over domains associated to a two-dimensional grid. We define admissible classes of domains for which suitable combinatorial technique…

The Hilbert scheme of n points in the projective plane parameterizes degree n zero-dimensional subschemes of the projective plane. We examine the dual cones of effective divisors and moving curves on the Hilbert scheme. By studying…

We study the polynomial algebra (over a ring containing the rationals) in an n by m matrix of variables, and subject to the relation that says that the product of any two variables in the same column is zero. We show that the sub-algebra of…

In this paper, we study the two natural polarizations, namely the standard polarization and the box polarization, of the d-th power of the maximal ideal in a polynomial ring. We show that these polarizations correspond to smooth points in…

This paper is devoted to the convergence and stability analysis of a class of nonlinear subdivision schemes and associated multi-resolution transforms. These schemes are defined as a perturbation of a linear subdivision scheme. Assuming a…

Semidefinite programs (SDPs) are standard convex problems that are frequently found in control and optimization applications. Interior-point methods can solve SDPs in polynomial time up to arbitrary accuracy, but scale poorly as the size of…

We analyze the space of bivariate functions that are piecewise polynomial of bi-degree \textless{}= (m, m') and of smoothness r along the interior edges of a planar T-mesh. We give new combinatorial lower and upper bounds for the dimension…

This paper reviews a class of univariate piecewise polynomial functions known as discrete splines, which share properties analogous to the better-known class of spline functions, but where continuity in derivatives is replaced by (a…

The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…

We call a matrix blocky if, up to row and column permutations, it can be obtained from an identity matrix by repeatedly applying one of the following operations: duplicating a row, duplicating a column, or adding a zero row or column.…

The paper proposes, an algorithm to produce novel m-point (for any integer m>=2) binary non-stationary subdivision scheme. It has been developed using uniform trigonometric B-spline basis functions and smoothness is being analyzed using the…

Prior to the parallel solution of a large linear system, it is required to perform a partitioning of its equations/unknowns. Standard partitioning algorithms are designed using the considerations of the efficiency of the parallel…

We investigate the theory of affine group schemes over a symmetric tensor category, with particular attention to the tangent space at the identity. We show that this carries the structure of a restricted Lie algebra, and can be viewed as…

This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…

Multi-degree splines are piecewise polynomial functions having sections of different degrees. For these splines, we discuss the construction of a B-spline basis by means of integral recurrence relations, extending the class of multi-degree…

The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several…

We investigate the problem of scanning and prediction ("scandiction", for short) of multidimensional data arrays. This problem arises in several aspects of image and video processing, such as predictive coding, for example, where an image…

We consider the problem of estimating high-dimensional covariance matrices of $K$-populations or classes in the setting where the sample sizes are comparable to the data dimension. We propose estimating each class covariance matrix as a…

In this paper, a second order finite difference scheme is investigated for time-dependent one-side space fractional diffusion equations with variable coefficients. The existing schemes for the equation with variable coefficients have…