Dmitry Berdinsky

Learn More
In this paper we propose a strategy for generating consistent hierarchical T–meshes which allow local refinement and offer a way to obtain spline basis functions with highest order smoothness incrementally. We describe the required ordering of line–segments during refinement and the construction of spline basis functions. We give our strategy for generating(More)
mensions and bases of hierarchical tensor-product splines. HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte(More)
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 allows us to obtain the dimension of such spline spaces and the number of tensor–product B–splines acting effectively(More)
In this paper, we discuss the problem of instability in the dimension of a spline space over a T-mesh. For bivariate spline spaces S (5, 5, 3, 3) and S (4, 4, 2, 2), the instability in the dimension is shown over certain types of T-meshes. This result could be considered as an attempt to answer the question of how large the polynomial degree (m, m ′) should(More)
We construct the representations of Cayley graphs of wreath products using finite automata, pushdown automata and nested stack automata. These representations are in accordance with the notion of Cayley automatic groups introduced by Kharlampovich, Khoussainov and Miasnikov and its extensions introduced by Elder and Taback. We obtain the upper and lower(More)
This paper is devoted to the problem of finding characterizations for Cayley automatic groups. The concept of Cayley automatic groups was recently introduced by Kharlampovich, Khoussainov and Mi-asnikov. We address this problem by introducing three numerical characteristics of Turing transducers: growth functions, Følner functions and average length growth(More)
  • 1