--- _id: '11125' abstract: - lang: eng text: Although nuclear envelope (NE) assembly is known to require the GTPase Ran, the membrane fusion machinery involved is uncharacterized. NE assembly involves formation of a reticular network on chromatin, fusion of this network into a closed NE and subsequent expansion. Here we show that p97, an AAA-ATPase previously implicated in fusion of Golgi and transitional endoplasmic reticulum (ER) membranes together with the adaptor p47, has two discrete functions in NE assembly. Formation of a closed NE requires the p97–Ufd1–Npl4 complex, not previously implicated in membrane fusion. Subsequent NE growth involves a p97–p47 complex. This study provides the first insights into the molecular mechanisms and specificity of fusion events involved in NE formation. article_processing_charge: No article_type: original author: - first_name: Martin W full_name: HETZER, Martin W id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed last_name: HETZER orcid: 0000-0002-2111-992X - first_name: Hemmo H. full_name: Meyer, Hemmo H. last_name: Meyer - first_name: Tobias C. full_name: Walther, Tobias C. last_name: Walther - first_name: Daniel full_name: Bilbao-Cortes, Daniel last_name: Bilbao-Cortes - first_name: Graham full_name: Warren, Graham last_name: Warren - first_name: Iain W. full_name: Mattaj, Iain W. last_name: Mattaj citation: ama: Hetzer M, Meyer HH, Walther TC, Bilbao-Cortes D, Warren G, Mattaj IW. Distinct AAA-ATPase p97 complexes function in discrete steps of nuclear assembly. Nature Cell Biology. 2001;3(12):1086-1091. doi:10.1038/ncb1201-1086 apa: Hetzer, M., Meyer, H. H., Walther, T. C., Bilbao-Cortes, D., Warren, G., & Mattaj, I. W. (2001). Distinct AAA-ATPase p97 complexes function in discrete steps of nuclear assembly. Nature Cell Biology. Springer Nature. https://doi.org/10.1038/ncb1201-1086 chicago: Hetzer, Martin, Hemmo H. Meyer, Tobias C. Walther, Daniel Bilbao-Cortes, Graham Warren, and Iain W. Mattaj. “Distinct AAA-ATPase P97 Complexes Function in Discrete Steps of Nuclear Assembly.” Nature Cell Biology. Springer Nature, 2001. https://doi.org/10.1038/ncb1201-1086. ieee: M. Hetzer, H. H. Meyer, T. C. Walther, D. Bilbao-Cortes, G. Warren, and I. W. Mattaj, “Distinct AAA-ATPase p97 complexes function in discrete steps of nuclear assembly,” Nature Cell Biology, vol. 3, no. 12. Springer Nature, pp. 1086–1091, 2001. ista: Hetzer M, Meyer HH, Walther TC, Bilbao-Cortes D, Warren G, Mattaj IW. 2001. Distinct AAA-ATPase p97 complexes function in discrete steps of nuclear assembly. Nature Cell Biology. 3(12), 1086–1091. mla: Hetzer, Martin, et al. “Distinct AAA-ATPase P97 Complexes Function in Discrete Steps of Nuclear Assembly.” Nature Cell Biology, vol. 3, no. 12, Springer Nature, 2001, pp. 1086–91, doi:10.1038/ncb1201-1086. short: M. Hetzer, H.H. Meyer, T.C. Walther, D. Bilbao-Cortes, G. Warren, I.W. Mattaj, Nature Cell Biology 3 (2001) 1086–1091. date_created: 2022-04-07T07:57:42Z date_published: 2001-11-02T00:00:00Z date_updated: 2022-07-18T08:58:07Z day: '02' doi: 10.1038/ncb1201-1086 extern: '1' external_id: pmid: - '11781570' intvolume: ' 3' issue: '12' keyword: - Cell Biology language: - iso: eng month: '11' oa_version: None page: 1086-1091 pmid: 1 publication: Nature Cell Biology publication_identifier: eissn: - 1476-4679 issn: - 1465-7392 publication_status: published publisher: Springer Nature quality_controlled: '1' scopus_import: '1' status: public title: Distinct AAA-ATPase p97 complexes function in discrete steps of nuclear assembly type: journal_article user_id: 72615eeb-f1f3-11ec-aa25-d4573ddc34fd volume: 3 year: '2001' ... --- _id: '11892' abstract: - lang: eng text: "We present the first fully dynamic algorithm for maintaining a minimum spanning forest in time \U0001D45C(\U0001D45B√) per operation. To be precise, the algorithm uses O(n1/3 log n) amortized time per update operation. The algorithm is fairly simple and deterministic. An immediate consequence is the first fully dynamic deterministic algorithm for maintaining connectivity and bipartiteness in amortized time O(n1/3 log n) per update, with O(1) worst case time per query." article_processing_charge: No article_type: original author: - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: Valerie full_name: King, Valerie last_name: King citation: ama: Henzinger MH, King V. Maintaining minimum spanning forests in dynamic graphs. SIAM Journal on Computing. 2001;31(2):364-374. doi:10.1137/s0097539797327209 apa: Henzinger, M. H., & King, V. (2001). Maintaining minimum spanning forests in dynamic graphs. SIAM Journal on Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/s0097539797327209 chicago: Henzinger, Monika H, and Valerie King. “Maintaining Minimum Spanning Forests in Dynamic Graphs.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics, 2001. https://doi.org/10.1137/s0097539797327209. ieee: M. H. Henzinger and V. King, “Maintaining minimum spanning forests in dynamic graphs,” SIAM Journal on Computing, vol. 31, no. 2. Society for Industrial & Applied Mathematics, pp. 364–374, 2001. ista: Henzinger MH, King V. 2001. Maintaining minimum spanning forests in dynamic graphs. SIAM Journal on Computing. 31(2), 364–374. mla: Henzinger, Monika H., and Valerie King. “Maintaining Minimum Spanning Forests in Dynamic Graphs.” SIAM Journal on Computing, vol. 31, no. 2, Society for Industrial & Applied Mathematics, 2001, pp. 364–74, doi:10.1137/s0097539797327209. short: M.H. Henzinger, V. King, SIAM Journal on Computing 31 (2001) 364–374. date_created: 2022-08-17T08:43:43Z date_published: 2001-03-01T00:00:00Z date_updated: 2023-02-17T14:24:55Z day: '01' doi: 10.1137/s0097539797327209 extern: '1' intvolume: ' 31' issue: '2' language: - iso: eng month: '03' oa_version: None page: 364-374 publication: SIAM Journal on Computing publication_identifier: eissn: - 1095-7111 issn: - 0097-5397 publication_status: published publisher: Society for Industrial & Applied Mathematics quality_controlled: '1' scopus_import: '1' status: public title: Maintaining minimum spanning forests in dynamic graphs type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 31 year: '2001' ... --- _id: '11914' abstract: - lang: eng text: 'Previous studies of the Web graph structure have focused on the graph structure at the level of individual pages. In actuality the Web is a hierarchically nested graph, with domains, hosts and Web sites introducing intermediate levels of affiliation and administrative control. To better understand the growth of the Web we need to understand its macro-structure, in terms of the linkage between Web sites. We approximate this by studying the graph of the linkage between hosts on the Web. This was done based on snapshots of the Web taken by Google in Oct 1999, Aug 2000 and Jun 2001. The connectivity between hosts is represented by a directed graph, with hosts as nodes and weighted edges representing the count of hyperlinks between pages on the corresponding hosts. We demonstrate how such a "hostgraph" can be used to study connectivity properties of hosts and domains over time, and discuss a modified "copy model" to explain observed link weight distributions as a function of subgraph size. We discuss changes in the Web over time in the size and connectivity of Web sites and country domains. We also describe a data mining application of the hostgraph: a related host finding algorithm which achieves a precision of 0.65 at rank 3.' article_processing_charge: No author: - first_name: K. full_name: Bharat, K. last_name: Bharat - first_name: Bay-Wei full_name: Chang, Bay-Wei last_name: Chang - first_name: Monika H full_name: Henzinger, Monika H id: 540c9bbd-f2de-11ec-812d-d04a5be85630 last_name: Henzinger orcid: 0000-0002-5008-6530 - first_name: M. full_name: Ruhl, M. last_name: Ruhl citation: ama: 'Bharat K, Chang B-W, Henzinger MH, Ruhl M. Who links to whom: Mining linkage between Web sites. In: 1st IEEE International Conference on Data Mining. Institute of Electrical and Electronics Engineers; 2001:51-58. doi:10.1109/ICDM.2001.989500' apa: 'Bharat, K., Chang, B.-W., Henzinger, M. H., & Ruhl, M. (2001). Who links to whom: Mining linkage between Web sites. In 1st IEEE International Conference on Data Mining (pp. 51–58). San Jose, CA, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ICDM.2001.989500' chicago: 'Bharat, K., Bay-Wei Chang, Monika H Henzinger, and M. Ruhl. “Who Links to Whom: Mining Linkage between Web Sites.” In 1st IEEE International Conference on Data Mining, 51–58. Institute of Electrical and Electronics Engineers, 2001. https://doi.org/10.1109/ICDM.2001.989500.' ieee: 'K. Bharat, B.-W. Chang, M. H. Henzinger, and M. Ruhl, “Who links to whom: Mining linkage between Web sites,” in 1st IEEE International Conference on Data Mining, San Jose, CA, United States, 2001, pp. 51–58.' ista: 'Bharat K, Chang B-W, Henzinger MH, Ruhl M. 2001. Who links to whom: Mining linkage between Web sites. 1st IEEE International Conference on Data Mining. ICMD: International Conference on Data Mining, 51–58.' mla: 'Bharat, K., et al. “Who Links to Whom: Mining Linkage between Web Sites.” 1st IEEE International Conference on Data Mining, Institute of Electrical and Electronics Engineers, 2001, pp. 51–58, doi:10.1109/ICDM.2001.989500.' short: K. Bharat, B.-W. Chang, M.H. Henzinger, M. Ruhl, in:, 1st IEEE International Conference on Data Mining, Institute of Electrical and Electronics Engineers, 2001, pp. 51–58. conference: end_date: 2001-12-02 location: San Jose, CA, United States name: 'ICMD: International Conference on Data Mining' start_date: 2001-11-29 date_created: 2022-08-18T07:12:46Z date_published: 2001-12-01T00:00:00Z date_updated: 2023-02-17T09:59:47Z day: '01' doi: 10.1109/ICDM.2001.989500 extern: '1' language: - iso: eng month: '12' oa_version: None page: 51-58 publication: 1st IEEE International Conference on Data Mining publication_identifier: isbn: - 0-7695-1119-8 issn: - '15504786' publication_status: published publisher: Institute of Electrical and Electronics Engineers quality_controlled: '1' scopus_import: '1' status: public title: 'Who links to whom: Mining linkage between Web sites' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2001' ... --- _id: '3507' abstract: - lang: eng text: A molecular classification method is based on a space filling description of a molecule. The three dimensional body corresponding to the space filling molecular structure is divided into Voronoi regions to provide a basis for efficiently processing local structural information. A Delaunay triangulation provides a basis for systematically processing information relating to the Voronoi regions into shape descriptors in the form of topological elements. Preferably, additional shape and/or property descriptors are included in the classification method. The classification methods generally are used to identify similarities between molecules that can be used as property predictors for a variety of applications. Generally, the property predictions are the basis for selection of compounds for incorporation into efficacy evaluations. applicant: - Jie Liang, Herbert Edelsbrunner article_processing_charge: No author: - first_name: Jie full_name: Liang, Jie last_name: Liang - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 citation: ama: Liang J, Edelsbrunner H. Molecular classification for property prediction. 2001. apa: Liang, J., & Edelsbrunner, H. (2001). Molecular classification for property prediction. chicago: Liang, Jie, and Herbert Edelsbrunner. “Molecular Classification for Property Prediction,” 2001. ieee: J. Liang and H. Edelsbrunner, “Molecular classification for property prediction.” 2001. ista: Liang J, Edelsbrunner H. 2001. Molecular classification for property prediction. mla: Liang, Jie, and Herbert Edelsbrunner. Molecular Classification for Property Prediction. 2001. short: J. Liang, H. Edelsbrunner, (2001). date_created: 2018-12-11T12:03:41Z date_published: 2001-01-30T00:00:00Z date_updated: 2022-01-05T15:12:42Z day: '30' extern: '1' ipc: G16C20/70 ; G16B15/00 ipn: US6182016B1 main_file_link: - open_access: '1' url: https://patents.google.com/patent/US6182016B1 month: '01' oa: 1 oa_version: Published Version publication_date: 2001-01-30 publist_id: '2880' status: public title: Molecular classification for property prediction type: patent user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2001' ... --- _id: '3586' abstract: - lang: eng text: The book combines topics in mathematics (geometry and topology), computer science (algorithms), and engineering (mesh generation). The original motivation for these topics was the difficulty faced (both conceptually and in the technical execution) in any attempt to combine elements of combinatorial and of numerical algorithms. Mesh generation is a topic where a meaningful combination of these different approaches to problem solving is inevitable. The book develops methods from both areas that are amenable to combination, and explains recent breakthrough solutions to meshing that fit into this category.The book should be an ideal graduate text for courses on mesh generation. The specific material is selected giving preference to topics that are elementary, attractive, lend themselves to teaching, useful, and interesting. article_processing_charge: No author: - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 citation: ama: Edelsbrunner H. Geometry and Topology for Mesh Generation. Vol 7. Cambridge University Press; 2001. doi:10.1017/CBO9780511530067 apa: Edelsbrunner, H. (2001). Geometry and Topology for Mesh Generation (Vol. 7). Cambridge University Press. https://doi.org/10.1017/CBO9780511530067 chicago: Edelsbrunner, Herbert. Geometry and Topology for Mesh Generation. Vol. 7. Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press, 2001. https://doi.org/10.1017/CBO9780511530067. ieee: H. Edelsbrunner, Geometry and Topology for Mesh Generation, vol. 7. Cambridge University Press, 2001. ista: Edelsbrunner H. 2001. Geometry and Topology for Mesh Generation, Cambridge University Press, 190p. mla: Edelsbrunner, Herbert. Geometry and Topology for Mesh Generation. Vol. 7, Cambridge University Press, 2001, doi:10.1017/CBO9780511530067. short: H. Edelsbrunner, Geometry and Topology for Mesh Generation, Cambridge University Press, 2001. date_created: 2018-12-11T12:04:06Z date_published: 2001-05-28T00:00:00Z date_updated: 2021-12-22T08:46:46Z day: '28' doi: 10.1017/CBO9780511530067 extern: '1' intvolume: ' 7' language: - iso: eng month: '05' oa_version: None page: '190' publication_identifier: eisbn: - ' 978-0-5115-3006-7' isbn: - 0-521-79309-2 publication_status: published publisher: Cambridge University Press publist_id: '2798' quality_controlled: '1' related_material: link: - description: available via catalog IST BookList relation: other url: https://koha.app.ist.ac.at/cgi-bin/koha/opac-detail.pl?biblionumber=3508 series_title: Cambridge Monographs on Applied and Computational Mathematics status: public title: Geometry and Topology for Mesh Generation type: book user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 7 year: '2001' ... --- _id: '3447' author: - first_name: Krishnendu full_name: Krishnendu Chatterjee id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: Pallab full_name: Dasgupta, Pallab last_name: Dasgupta - first_name: Partha full_name: Chakrabarti, Partha P last_name: Chakrabarti citation: ama: 'Chatterjee K, Dasgupta P, Chakrabarti P. Weighted quantified computation tree logic. In: Elsevier; 2001.' apa: 'Chatterjee, K., Dasgupta, P., & Chakrabarti, P. (2001). Weighted quantified computation tree logic. Presented at the CIT: Conference on Information Technology, Elsevier.' chicago: Chatterjee, Krishnendu, Pallab Dasgupta, and Partha Chakrabarti. “Weighted Quantified Computation Tree Logic.” Elsevier, 2001. ieee: 'K. Chatterjee, P. Dasgupta, and P. Chakrabarti, “Weighted quantified computation tree logic,” presented at the CIT: Conference on Information Technology, 2001.' ista: 'Chatterjee K, Dasgupta P, Chakrabarti P. 2001. Weighted quantified computation tree logic. CIT: Conference on Information Technology.' mla: Chatterjee, Krishnendu, et al. Weighted Quantified Computation Tree Logic. Elsevier, 2001. short: K. Chatterjee, P. Dasgupta, P. Chakrabarti, in:, Elsevier, 2001. conference: name: 'CIT: Conference on Information Technology' date_created: 2018-12-11T12:03:23Z date_published: 2001-11-14T00:00:00Z date_updated: 2021-01-12T07:43:31Z day: '14' extern: 1 month: '11' publication_status: published publisher: Elsevier publist_id: '2940' quality_controlled: 0 status: public title: Weighted quantified computation tree logic type: conference year: '2001' ... --- _id: '8522' abstract: - lang: eng text: For diffeomorphisms of smooth compact manifolds, we consider the problem of how fast the number of periodic points with period $n$grows as a function of $n$. In many familiar cases (e.g., Anosov systems) the growth is exponential, but arbitrarily fast growth is possible; in fact, the first author has shown that arbitrarily fast growth is topologically (Baire) generic for $C^2$ or smoother diffeomorphisms. In the present work we show that, by contrast, for a measure-theoretic notion of genericity we call ``prevalence'', the growth is not much faster than exponential. Specifically, we show that for each $\delta > 0$, there is a prevalent set of ( $C^{1+\rho}$ or smoother) diffeomorphisms for which the number of period $n$ points is bounded above by $\operatorname{exp}(C n^{1+\delta})$ for some $C$ independent of $n$. We also obtain a related bound on the decay of the hyperbolicity of the periodic points as a function of $n$. The contrast between topologically generic and measure-theoretically generic behavior for the growth of the number of periodic points and the decay of their hyperbolicity shows this to be a subtle and complex phenomenon, reminiscent of KAM theory. article_processing_charge: No article_type: original author: - first_name: Vadim full_name: Kaloshin, Vadim id: FE553552-CDE8-11E9-B324-C0EBE5697425 last_name: Kaloshin orcid: 0000-0002-6051-2628 - first_name: Brian R. full_name: Hunt, Brian R. last_name: Hunt citation: ama: Kaloshin V, Hunt BR. A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms I. Electronic Research Announcements of the American Mathematical Society. 2001;7(4):17-27. doi:10.1090/s1079-6762-01-00090-7 apa: Kaloshin, V., & Hunt, B. R. (2001). A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms I. Electronic Research Announcements of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/s1079-6762-01-00090-7 chicago: Kaloshin, Vadim, and Brian R. Hunt. “A Stretched Exponential Bound on the Rate of Growth of the Number of Periodic Points for Prevalent Diffeomorphisms I.” Electronic Research Announcements of the American Mathematical Society. American Mathematical Society, 2001. https://doi.org/10.1090/s1079-6762-01-00090-7. ieee: V. Kaloshin and B. R. Hunt, “A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms I,” Electronic Research Announcements of the American Mathematical Society, vol. 7, no. 4. American Mathematical Society, pp. 17–27, 2001. ista: Kaloshin V, Hunt BR. 2001. A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms I. Electronic Research Announcements of the American Mathematical Society. 7(4), 17–27. mla: Kaloshin, Vadim, and Brian R. Hunt. “A Stretched Exponential Bound on the Rate of Growth of the Number of Periodic Points for Prevalent Diffeomorphisms I.” Electronic Research Announcements of the American Mathematical Society, vol. 7, no. 4, American Mathematical Society, 2001, pp. 17–27, doi:10.1090/s1079-6762-01-00090-7. short: V. Kaloshin, B.R. Hunt, Electronic Research Announcements of the American Mathematical Society 7 (2001) 17–27. date_created: 2020-09-18T10:49:56Z date_published: 2001-04-18T00:00:00Z date_updated: 2021-01-12T08:19:51Z day: '18' doi: 10.1090/s1079-6762-01-00090-7 extern: '1' intvolume: ' 7' issue: '4' keyword: - General Mathematics language: - iso: eng month: '04' oa_version: None page: 17-27 publication: Electronic Research Announcements of the American Mathematical Society publication_identifier: issn: - 1079-6762 publication_status: published publisher: American Mathematical Society quality_controlled: '1' status: public title: A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms I type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7 year: '2001' ... --- _id: '8521' abstract: - lang: eng text: We continue the previous article's discussion of bounds, for prevalent diffeomorphisms of smooth compact manifolds, on the growth of the number of periodic points and the decay of their hyperbolicity as a function of their period $n$. In that article we reduced the main results to a problem, for certain families of diffeomorphisms, of bounding the measure of parameter values for which the diffeomorphism has (for a given period $n$) an almost periodic point that is almost nonhyperbolic. We also formulated our results for $1$-dimensional endomorphisms on a compact interval. In this article we describe some of the main techniques involved and outline the rest of the proof. To simplify notation, we concentrate primarily on the $1$-dimensional case. article_processing_charge: No article_type: original author: - first_name: Vadim full_name: Kaloshin, Vadim id: FE553552-CDE8-11E9-B324-C0EBE5697425 last_name: Kaloshin orcid: 0000-0002-6051-2628 - first_name: Brian R. full_name: Hunt, Brian R. last_name: Hunt citation: ama: Kaloshin V, Hunt BR. A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms II. Electronic Research Announcements of the American Mathematical Society. 2001;7(5):28-36. doi:10.1090/s1079-6762-01-00091-9 apa: Kaloshin, V., & Hunt, B. R. (2001). A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms II. Electronic Research Announcements of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/s1079-6762-01-00091-9 chicago: Kaloshin, Vadim, and Brian R. Hunt. “A Stretched Exponential Bound on the Rate of Growth of the Number of Periodic Points for Prevalent Diffeomorphisms II.” Electronic Research Announcements of the American Mathematical Society. American Mathematical Society, 2001. https://doi.org/10.1090/s1079-6762-01-00091-9. ieee: V. Kaloshin and B. R. Hunt, “A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms II,” Electronic Research Announcements of the American Mathematical Society, vol. 7, no. 5. American Mathematical Society, pp. 28–36, 2001. ista: Kaloshin V, Hunt BR. 2001. A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms II. Electronic Research Announcements of the American Mathematical Society. 7(5), 28–36. mla: Kaloshin, Vadim, and Brian R. Hunt. “A Stretched Exponential Bound on the Rate of Growth of the Number of Periodic Points for Prevalent Diffeomorphisms II.” Electronic Research Announcements of the American Mathematical Society, vol. 7, no. 5, American Mathematical Society, 2001, pp. 28–36, doi:10.1090/s1079-6762-01-00091-9. short: V. Kaloshin, B.R. Hunt, Electronic Research Announcements of the American Mathematical Society 7 (2001) 28–36. date_created: 2020-09-18T10:49:43Z date_published: 2001-04-24T00:00:00Z date_updated: 2021-01-12T08:19:51Z day: '24' doi: 10.1090/s1079-6762-01-00091-9 extern: '1' intvolume: ' 7' issue: '5' keyword: - General Mathematics language: - iso: eng month: '04' oa_version: None page: 28-36 publication: Electronic Research Announcements of the American Mathematical Society publication_identifier: issn: - 1079-6762 publication_status: published publisher: American Mathematical Society quality_controlled: '1' status: public title: A stretched exponential bound on the rate of growth of the number of periodic points for prevalent diffeomorphisms II type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 7 year: '2001' ... --- _id: '8524' abstract: - lang: eng text: 'A number α∈R is diophantine if it is not well approximable by rationals, i.e. for some C,ε>0 and any relatively prime p,q∈Z we have |αq−p|>Cq−1−ε. It is well-known and is easy to prove that almost every α in R is diophantine. In this paper we address a noncommutative version of the diophantine properties. Consider a pair A,B∈SO(3) and for each n∈Z+ take all possible words in A, A -1, B, and B - 1 of length n, i.e. for a multiindex I=(i1,i1,…,im,jm) define |I|=∑mk=1(|ik|+|jk|)=n and \( W_n(A,B ) = \{W_{\cal I}(A,B) = A^{i_1} B^{j_1} \dots A^{i_m} B^{j_m}\}_{|{\cal I|}=n \).¶Gamburd—Jakobson—Sarnak [GJS] raised the problem: prove that for Haar almost every pair A,B∈SO(3) the closest distance of words of length n to the identity, i.e. sA,B(n)=min|I|=n∥WI(A,B)−E∥, is bounded from below by an exponential function in n. This is the analog of the diophantine property for elements of SO(3). In this paper we prove that s A,B (n) is bounded from below by an exponential function in n 2. We also exhibit obstructions to a “simple” proof of the exponential estimate in n.' article_processing_charge: No article_type: original author: - first_name: Vadim full_name: Kaloshin, Vadim id: FE553552-CDE8-11E9-B324-C0EBE5697425 last_name: Kaloshin orcid: 0000-0002-6051-2628 - first_name: I. full_name: Rodnianski, I. last_name: Rodnianski citation: ama: Kaloshin V, Rodnianski I. Diophantine properties of elements of SO(3). Geometric And Functional Analysis. 2001;11(5):953-970. doi:10.1007/s00039-001-8222-8 apa: Kaloshin, V., & Rodnianski, I. (2001). Diophantine properties of elements of SO(3). Geometric And Functional Analysis. Springer Nature. https://doi.org/10.1007/s00039-001-8222-8 chicago: Kaloshin, Vadim, and I. Rodnianski. “Diophantine Properties of Elements of SO(3).” Geometric And Functional Analysis. Springer Nature, 2001. https://doi.org/10.1007/s00039-001-8222-8. ieee: V. Kaloshin and I. Rodnianski, “Diophantine properties of elements of SO(3),” Geometric And Functional Analysis, vol. 11, no. 5. Springer Nature, pp. 953–970, 2001. ista: Kaloshin V, Rodnianski I. 2001. Diophantine properties of elements of SO(3). Geometric And Functional Analysis. 11(5), 953–970. mla: Kaloshin, Vadim, and I. Rodnianski. “Diophantine Properties of Elements of SO(3).” Geometric And Functional Analysis, vol. 11, no. 5, Springer Nature, 2001, pp. 953–70, doi:10.1007/s00039-001-8222-8. short: V. Kaloshin, I. Rodnianski, Geometric And Functional Analysis 11 (2001) 953–970. date_created: 2020-09-18T10:50:11Z date_published: 2001-12-01T00:00:00Z date_updated: 2021-01-12T08:19:52Z day: '01' doi: 10.1007/s00039-001-8222-8 extern: '1' intvolume: ' 11' issue: '5' language: - iso: eng month: '12' oa_version: None page: 953-970 publication: Geometric And Functional Analysis publication_identifier: issn: - 1016-443X - 1420-8970 publication_status: published publisher: Springer Nature quality_controlled: '1' status: public title: Diophantine properties of elements of SO(3) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 11 year: '2001' ... --- _id: '9444' abstract: - lang: eng text: Epigenetic silenced alleles of the Arabidopsis SUPERMANlocus (the clark kent alleles) are associated with dense hypermethylation at noncanonical cytosines (CpXpG and asymmetric sites, where X = A, T, C, or G). A genetic screen for suppressors of a hypermethylated clark kent mutant identified nine loss-of-function alleles of CHROMOMETHYLASE3(CMT3), a novel cytosine methyltransferase homolog. These cmt3 mutants display a wild-type morphology but exhibit decreased CpXpG methylation of the SUP gene and of other sequences throughout the genome. They also show reactivated expression of endogenous retrotransposon sequences. These results show that a non-CpG DNA methyltransferase is responsible for maintaining epigenetic gene silencing. article_processing_charge: No article_type: original author: - first_name: A. M. full_name: Lindroth, A. M. last_name: Lindroth - first_name: Xiaofeng full_name: Cao, Xiaofeng last_name: Cao - first_name: James P. full_name: Jackson, James P. last_name: Jackson - first_name: Daniel full_name: Zilberman, Daniel id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1 last_name: Zilberman orcid: 0000-0002-0123-8649 - first_name: Claire M. full_name: McCallum, Claire M. last_name: McCallum - first_name: Steven full_name: Henikoff, Steven last_name: Henikoff - first_name: Steven E. full_name: Jacobsen, Steven E. last_name: Jacobsen citation: ama: Lindroth AM, Cao X, Jackson JP, et al. Requirement of CHROMOMETHYLASE3 for maintenance of CpXpG methylation. Science. 2001;292(5524):2077-2080. doi:10.1126/science.1059745 apa: Lindroth, A. M., Cao, X., Jackson, J. P., Zilberman, D., McCallum, C. M., Henikoff, S., & Jacobsen, S. E. (2001). Requirement of CHROMOMETHYLASE3 for maintenance of CpXpG methylation. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.1059745 chicago: Lindroth, A. M., Xiaofeng Cao, James P. Jackson, Daniel Zilberman, Claire M. McCallum, Steven Henikoff, and Steven E. Jacobsen. “Requirement of CHROMOMETHYLASE3 for Maintenance of CpXpG Methylation.” Science. American Association for the Advancement of Science, 2001. https://doi.org/10.1126/science.1059745. ieee: A. M. Lindroth et al., “Requirement of CHROMOMETHYLASE3 for maintenance of CpXpG methylation,” Science, vol. 292, no. 5524. American Association for the Advancement of Science, pp. 2077–2080, 2001. ista: Lindroth AM, Cao X, Jackson JP, Zilberman D, McCallum CM, Henikoff S, Jacobsen SE. 2001. Requirement of CHROMOMETHYLASE3 for maintenance of CpXpG methylation. Science. 292(5524), 2077–2080. mla: Lindroth, A. M., et al. “Requirement of CHROMOMETHYLASE3 for Maintenance of CpXpG Methylation.” Science, vol. 292, no. 5524, American Association for the Advancement of Science, 2001, pp. 2077–80, doi:10.1126/science.1059745. short: A.M. Lindroth, X. Cao, J.P. Jackson, D. Zilberman, C.M. McCallum, S. Henikoff, S.E. Jacobsen, Science 292 (2001) 2077–2080. date_created: 2021-06-02T13:35:16Z date_published: 2001-06-15T00:00:00Z date_updated: 2021-12-14T08:40:32Z day: '15' department: - _id: DaZi doi: 10.1126/science.1059745 extern: '1' external_id: pmid: - '11349138' intvolume: ' 292' issue: '5524' keyword: - Multidisciplinary language: - iso: eng month: '06' oa_version: None page: 2077-2080 pmid: 1 publication: Science publication_identifier: eissn: - 1095-9203 issn: - 0036-8075 publication_status: published publisher: American Association for the Advancement of Science quality_controlled: '1' scopus_import: '1' status: public title: Requirement of CHROMOMETHYLASE3 for maintenance of CpXpG methylation type: journal_article user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 volume: 292 year: '2001' ...