Math empowerment: a multidisciplinary example to engage primary school students in learning mathematics

This paper describes an educational project conducted in a primary school in Italy (Scuola Primaria Alessandro Manzoni at Mulazzano, near to Milan). The school requested our collaboration to help improve upon the results achieved on the National Tests for Mathematics, in which students, aged 7, registered performances lower than the national average the past year. From January to June, 2016, we supported teachers, providing them with information, tools and methods to increase their pupils’ curiosity and passion for mathematics. Mixing our different experiences and competences (instructional design and gamification, information technologies and psychology) we have tried to provide a broader spectrum of parameters, tools and keys to understand how to achieve an inclusive approach that is ‘personalised’ to each student. This collaboration with teachers and students allowed us to draw interesting observations about learning styles, pointing out the negative impact that standardized processes and instruments can have on the self‐esteem and, consequently, on student performance. The goal of this programme was to find the right learning levers to intrigue and excite students in mathematical concepts and their applications. Our hypothesis is that, by considering the learning of mathematics as a continuous process, in which students develop freely through their own experiments, observations, involvement and curiosity, students can achieve improved results on the National Tests (INVALSI). This paper includes results of a survey conducted by children ‐’About Me and Mathematics‘

Space-Time Isogeometric Analysis of Parabolic Evolution Equations

We present and analyze a new stable space-time Isogeometric Analysis (IgA) method for the numerical solution of parabolic evolution equations in fixed and moving spatial computational domains. The discrete bilinear form is elliptic on the IgA space with respect to a discrete energy norm. This property together with a corresponding boundedness property, consistency and approximation results for the IgA spaces yields an a priori discretization error estimate with respect to the discrete norm. The theoretical results are confirmed by several numerical experiments with low- and high-order IgA spaces

Theoretical and numerical comparison of hyperelastic and hypoelastic formulations for Eulerian non-linear elastoplasticity

The aim of this paper is to compare a hyperelastic with a hypoelastic model describing the Eulerian dynamics of solids in the context of non-linear elastoplastic deformations. Specifically, we consider the well-known hypoelastic Wilkins model, which is compared against a hyperelastic model based on the work of Godunov and Romenski. First, we discuss some general conceptual differences between the two approaches. Second, a detailed study of both models is proposed, where differences are made evident at the aid of deriving a hypoelastic-type model corresponding to the hyperelastic model and a particular equation of state used in this paper. Third, using the same high order ADER Finite Volume and Discontinuous Galerkin methods on fixed and moving unstructured meshes for both models, a wide range of numerical benchmark test problems has been solved. The numerical solutions obtained for the two different models are directly compared with each other. For small elastic deformations, the two models produce very similar solutions that are close to each other. However, if large elastic or elastoplastic deformations occur, the solutions present larger differences.Comment: 14 figure

Superiorization and Perturbation Resilience of Algorithms: A Continuously Updated Bibliography

This document presents a, (mostly) chronologically ordered, bibliography of scientific publications on the superiorization methodology and perturbation resilience of algorithms which is compiled and continuously updated by us at: http://math.haifa.ac.il/yair/bib-superiorization-censor.html. Since the beginings of this topic we try to trace the work that has been published about it since its inception. To the best of our knowledge this bibliography represents all available publications on this topic to date, and while the URL is continuously updated we will revise this document and bring it up to date on arXiv approximately once a year. Abstracts of the cited works, and some links and downloadable files of preprints or reprints are available on the above mentioned Internet page. If you know of a related scientific work in any form that should be included here kindly write to me on: [email protected] with full bibliographic details, a DOI if available, and a PDF copy of the work if possible. The Internet page was initiated on March 7, 2015, and has been last updated on March 12, 2020.Comment: Original report: June 13, 2015 contained 41 items. First revision: March 9, 2017 contained 64 items. Second revision: March 8, 2018 contained 76 items. Third revision: March 11, 2019 contains 90 items. Fourth revision: March 16, 2020 contains 112 item

Computational reverse mathematics and foundational analysis

Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theorems of ordinary, non-set-theoretic mathematics. The main philosophical application of reverse mathematics proposed thus far is foundational analysis, which explores the limits of different foundations for mathematics in a formally precise manner. This paper gives a detailed account of the motivations and methodology of foundational analysis, which have heretofore been largely left implicit in the practice. It then shows how this account can be fruitfully applied in the evaluation of major foundational approaches by a careful examination of two case studies: a partial realization of Hilbert's program due to Simpson [1988], and predicativism in the extended form due to Feferman and Sch\"{u}tte. Shore [2010, 2013] proposes that equivalences in reverse mathematics be proved in the same way as inequivalences, namely by considering only $\omega$-models of the systems in question. Shore refers to this approach as computational reverse mathematics. This paper shows that despite some attractive features, computational reverse mathematics is inappropriate for foundational analysis, for two major reasons. Firstly, the computable entailment relation employed in computational reverse mathematics does not preserve justification for the foundational programs above. Secondly, computable entailment is a $\Pi^1_1$ complete relation, and hence employing it commits one to theoretical resources which outstrip those available within any foundational approach that is proof-theoretically weaker than $\Pi^1_1\text{-}\mathsf{CA}_0$.Comment: Submitted. 41 page

A Meshfree Generalized Finite Difference Method for Surface PDEs

In this paper, we propose a novel meshfree Generalized Finite Difference Method (GFDM) approach to discretize PDEs defined on manifolds. Derivative approximations for the same are done directly on the tangent space, in a manner that mimics the procedure followed in volume-based meshfree GFDMs. As a result, the proposed method not only does not require a mesh, it also does not require an explicit reconstruction of the manifold. In contrast to existing methods, it avoids the complexities of dealing with a manifold metric, while also avoiding the need to solve a PDE in the embedding space. A major advantage of this method is that all developments in usual volume-based numerical methods can be directly ported over to surfaces using this framework. We propose discretizations of the surface gradient operator, the surface Laplacian and surface Diffusion operators. Possibilities to deal with anisotropic and discontinous surface properties (with large jumps) are also introduced, and a few practical applications are presented

Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization

In this paper, we propose a general framework for constructing IGA-suitable planar B-spline parameterizations from given complex CAD boundaries consisting of a set of B-spline curves. Instead of forming the computational domain by a simple boundary, planar domains with high genus and more complex boundary curves are considered. Firstly, some pre-processing operations including B\'ezier extraction and subdivision are performed on each boundary curve in order to generate a high-quality planar parameterization; then a robust planar domain partition framework is proposed to construct high-quality patch-meshing results with few singularities from the discrete boundary formed by connecting the end points of the resulting boundary segments. After the topology information generation of quadrilateral decomposition, the optimal placement of interior B\'ezier curves corresponding to the interior edges of the quadrangulation is constructed by a global optimization method to achieve a patch-partition with high quality. Finally, after the imposition of C1=G1-continuity constraints on the interface of neighboring B\'ezier patches with respect to each quad in the quadrangulation, the high-quality B\'ezier patch parameterization is obtained by a C1-constrained local optimization method to achieve uniform and orthogonal iso-parametric structures while keeping the continuity conditions between patches. The efficiency and robustness of the proposed method are demonstrated by several examples which are compared to results obtained by the skeleton-based parameterization approach