supported by the Institute for Basic Science(IBS-R029-C4);supported by the National Key Research and Development Program of China(Grant No.2020YFA0712100);National Natural Science Foundation of China(Grant No.12231014);Beijing Scholars Program。
The Turán problem asks for the largest number of edges ex(n,H)in an n-vertex graph not containing a fixed forbidden subgraph H,which is one of the most important problems in extremal graph theory.However,the order of...
supported by Simons Foundation Collaboration Grants for Mathematicians (Grant No. 245269)
Among Thurston maps (orientation-preserving, postcritically finite branched coverings of the 2-sphere to itself), those that arise as subdivision maps of a finite subdivision rule form a special family. For such maps,...
supported by National Natural Science Foundation of China(Grant Nos.10071071&10471123).
This paper is concerned with multivariate refinement equations of the type where (?) is the unknown function defined on the s-dimensional Euclidean space Rs, a is a finitely supported nonnegative sequence on Zs, and M...
This work was supported by the National Natural Science Foundation of China(Grant No.10171007).
Starting with an initial vector λ=(λ(k)) k∈? ∈ ?p(?), the subdivision scheme generates a sequence (S a n λ) n=1 ∞ of vectors by the subdivision operator $$S_a \lambda (k) = \sum\limits_{j \in \mathbb{Z}} {\lambd...
Project supported by the National Natural Science Foundation of China.
A new fast ray tracing algorithm based on adaptive space subdivision is presented. Unlike the conventional octree and 3DDDA algorithms, the new algorithm subdivides the object space nonuniformly with the division plan...