相关论文: A Muntz Type Theorem for a Family of Corner Cuttin…

We show that the limiting polygon generated by the dimension elevation algorithm with respect to the \muntz space $span(1,t^{r_1},t^{r_2},...,t^{r_m},...)$, with $0 < r_1 < r_2 < ... < r_m < ...$ and $\lim_{n\to\infty}r_n = \infty$, over an…

We show that the generalized Bernstein bases in Muntz spaces defined by Hirschman and Widder [7] and extended by Gelfond [6] can be obtained as limits of the Chebyshev-Bernstein bases in Muntz spaces with respect to an interval [a,1] as the…

For Bezier curves, subdivision algorithms create control polygons as piecewise linear (PL) approximations that converge in terms of Hausdorff distance. We prove that the exterior angles of control polygons under subdivision converge to 0 at…

The notion of blossom in extended Chebyshev spaces offers adequate generalizations and extra-utilities to the tools for free-form design schemes. Unfortunately, such advantages are often overshadowed by the complexity of the resulting…

In this paper, we present a novel approach to the problem of merging of B\'ezier curves with respect to the $L_2$-norm. We give illustrative examples to show that the solution of the conventional merging problem may not be suitable for…

The preservation of ambient isotopic equivalence under piecewise linear (PL) approximation for smooth knots are prominent in molecular modeling and simulation. Sufficient conditions are given regarding: (1) Hausdorff distance, and (2) a sum…

We show that the dimension of the Cuntz semigroup of a C*-algebra is determined by the dimensions of the Cuntz semigroups of its separable sub-C*-algebras. This allows us to remove separability assumptions from previous results on the…

Farin proposed a method for designing Bezier curves with monotonic curvature and torsion. Such curves are relevant in design due to their aesthetic shape. The method relies on applying a matrix M to the first edge of the control polygon of…

This study aims on proposing a new structure for constructing Bernstein-like bases. The structure uses an auxiliary function and a shape parameter to construct a new family of bases from any family of blending functions. The new family of…

The rational points of a smooth curve $X$ over a number field $k$ map to the set of augmentations of the associated motivic algebra. An expectation, related to Kim's conjecture, is that for $X$ hyperbolic, the set of augmentations which…

We introduce a novel technique to generate Benders' cuts from a conic relaxation ("corner") derived from a basis of a higher-dimensional polyhedron that we aim to outer approximate in a lower-dimensional space. To generate facet-defining…

In this paper, we use the blending functions of Bernstein polynomials with shifted knots for construction of Bezier curves and surfaces. We study the nature of degree elevation and degree reduction for Bezier Bernstein functions with…

This paper establishes the consistency of a family of graph-cut-based algorithms for clustering of data clouds. We consider point clouds obtained as samples of a ground-truth measure. We investigate approaches to clustering based on…

We prove the Berenstein-Zelevinsky conjecture that the quantized coordinate rings of the double Bruhat cells of all finite dimensional simple algebraic groups admit quantum cluster algebra structures with initial seeds as specified by [4].…

We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…

Bundle methods have been intensively studied for solving both convex and nonconvex optimization problems. In most of the bundle methods developed thus far, at least one quadratic programming (QP) subproblem needs to be solved in each…

We introduce the concept of quotient-convergence for sequences of submodular set functions, providing, among others, a new framework for the study of convergence of matroids through their rank functions. Extending the limit theory of…

Properties of a parametric curve in R^3 are often determined by analysis of its piecewise linear (PL) approximation. For Bezier curves, there are standard algorithms, known as subdivision, that recursively create PL curves that converge to…

For a subfamily of multiplicative measures on integer partitions we give conditions for properly rescaled associated Young diagrams to converge in probability to a certain deterministic curve named the limit shape of partitions. We provide…

The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…