Search

In the first part of the paper, we propose a different viewpoint on the theory of higher Airy structures (or Airy ideals), which may shed light on its origin. We define Airy ideals in the ħ -adic completion of the Rees Weyl algebra and show that Airy ideals are defined exactly such that they are always related to the canonical left ideal generated by derivatives by automorphisms of the Rees Weyl algebra of a simple type, which we call transvections. The standard existence and uniqueness result in the theory of Airy structures then follow immediately. In the second part of the paper, we construct Airy ideals generated by the nonnegative modes of the strong generators of the principal W -algebra of sp 2 N at level - N - 1 / 2 , following the approach developed in Borot et al. (Mem Am Math Soc, 2021). This provides an example of an Airy ideal in the Heisenberg algebra that requires realizing the zero modes as derivatives instead of variables, which leads to an interesting interpretation for the resulting partition function. [ABSTRACT FROM AUTHOR]

In this paper, we construct a symbol calculus yielding short exact sequences for the dual Toeplitz algebra generated by all bounded dual Toeplitz operators on the Hardy space associated with the polydisk D n in the unitary space C n , that have been introduced and well studied in our earlier paper (Benaissa and Guediri in Taiwan J Math 19: 31–49, 2015), as well as for the C*-subalgebra generated by dual Toeplitz operators with symbols continuous on the associated hypertorus T n . [ABSTRACT FROM AUTHOR]

In this paper, we consider a constructive proof of the termination of the normal form (NF) algorithm for multivariate polynomials, as well as the related concept of admissible ordering < on monomials. In classical mathematics, the well-quasiorder property of relation < is derived from Dickson's lemma, and this is sufficient to justify the termination of the NF algorithm. In provable programming based on constructive type theory (Coq and Agda), a somewhat stronger condition (in constructive mathematics) of the well-foundedness of the ordering (in its constructive version) is required. We propose a constructive proof of this theorem (T) for < , which is based on a known method that we refer to here as the "pattern method." This theorem on the well-foundedness of an arbitrary admissible ordering is also important in itself, independently of the NF algorithm. We are not aware of any other works on constructive proof of this theorem. However, it turns out that it follows, not very difficultly, from the results achieved by other researchers in 2003. We program this proof in the Agda language in the form of our library AdmissiblePPO-wellFounded of provable computational algebra programs. This development also uses the theorem to prove termination of the NF algorithm for polynomials. Thus, the library also contains a set of provable programs for polynomial algebra, which is significantly larger than that needed to prove Theorem T. [ABSTRACT FROM AUTHOR]

In the last decade, the Poincaré conjecture has probably been the most famous statement among all the contributions of Poincaré to the mathematics community. There have been many papers and books that describe various attempts and the final works of Perelman leading to a positive solution to the conjecture, but the evolution of Poincaré's works leading to this conjecture has not been carefully discussed or described, and some other historical aspects about it have not been addressed either. For example, one question is how it fits into the overall work of Poincaré in topology, and what are some other related questions that he had raised. Since Poincaré did not state the Poincaré conjecture as a conjecture but rather raised it as a question, one natural question is why he did this. In order to address these issues, in this paper, we examine Poincaré's works in topology in the framework of classifying manifolds through numerical and algebraic invariants. Consequently, we also provide a full history of the formulation of the Poincaré conjecture which is richer than what is usually described and accepted and hence gain a better understanding of overall works of Poincaré in topology. In addition, this analysis clarifies a puzzling question on the relation between Poincaré's stated motivations for topology and the Poincaré conjecture. [ABSTRACT FROM AUTHOR]

In this paper, the authors consider the range of a certain class of ASH algebras in [An, Q., Elliott, G. A., Li, Z. and Liu, Z., The classification of certain ASH C*-algebras of real rank zero, J. Topol. Anal., 14(1), 2022, 183–202], which is under the scheme of the Elliott program in the setting of real rank zero C*-algebras. As a reduction theorem, they prove that all these ASH algebras are still the AD algebras studied in [Dadarlat, M. and Loring, T. A., Classifying C*-algebras via ordered, mod-p K-theory, Math. Ann., 305, 1996, 601–616]. [ABSTRACT FROM AUTHOR]

In the paper (J Math Soc Jpn 72(1):303–331, 2020), Tse-Chung Yang and the first two current authors computed explicitly the number | SSp 2 (F q) | of isomorphism classes of superspecial abelian surfaces over an arbitrary finite field F q of even degree over the prime field F p . There it was assumed that certain commutative Z p -orders satisfy an étale condition that excludes the primes p = 2 , 3 , 5 . We treat these remaining primes in the present paper, where the computations are more involved because of the ramification. This completes the calculation of | SSp 2 (F q) | in the even degree case. The odd degree case was previous treated by Tse-Chung Yang and the first two current authors in (Doc Math 21:1607–1643, 2016). To complete the proof of our main theorem, we give a classification of lattices over local quaternion Bass orders, which is a new input to our previous works. [ABSTRACT FROM AUTHOR]

Self-efficacy in mathematics is related to engagement, persistence, and academic performance. Prior research focused mostly on examining changes to students' self-efficacy across large time intervals (months or years), and paid less attention to changes at the level of lesson sequences. Knowledge of how self-efficacy changes during a sequence of lessons is important as it can help teachers better support students' self-efficacy in their everyday work. In this paper, we expanded previous studies by investigating changes in students' self-efficacy across a sequence of 3–4 lessons when students were learning a new topic in mathematics (nStudents = 170, nTime-points = 596). Nine classes of Norwegian grade 6 (n = 77) and grade 10 students (n = 93) reported their self-efficacy for easy, medium difficulty, and hard tasks. Using multilevel models for change, we found (a) change of students' self-efficacy across lesson sequences, (b) differences in the starting point and change of students' self-efficacy according to perceived task difficulty and grade, (c) more individual variation of self-efficacy starting point and change in association with harder tasks, and (d) students in classes who were taught a new topic in geometry had stronger self-efficacy at the beginning of the first lesson as compared to those who were taught a new topic in algebra (grade 10), and students in classes who were taught a new topic in fractions had steeper growth across the lesson sequence as compared to those who were taught a new topic in measurement (grade 6). Implications for both research and practice on how new mathematics topics are introduced to students are discussed. [ABSTRACT FROM AUTHOR]