Dynamic mathematics and the blending of knowledge structures in the calculus

This paper considers the role of dynamic aspects of mathematics specifically focusing on the calculus, including computer software that responds to physical action to produce dynamic visual effects. The development builds from dynamic human embodiment, uses arithmetic calculations in computer software to calculate ‘good enough’ values of required quantities and algebraic manipulation to develop precise symbolic values. The approach is based on a developmental framework blending human embodiment, with the symbolism of arithmetic and algebra leading to the formalism of real numbers and limits. It builds from dynamic actions on embodied objects to see the effect of those actions as a new embodiment that needs to be calculated accurately and symbolised precisely. The framework relates the growth of meaning in history to the mental conceptions of today’s students, focusing on the relationship between potentially infinite processes and their consequent embodiment as mental concepts. It broadens the strategy of process-object encapsulation by blending embodiment and symbolism.     

Bottom-up design of strategic options as finite automata

In this paper we look at the problem of strategic decision making. We start by presenting a new formalisation of strategic options as finite automata. Then, we show that these finite automata can be used to develop complex models of interacting options, such as option combinations and product options. Finally, we analyse real option games, presenting an algorithm to generate option games (based on automata).     

Sub-Riemannian calculus on hypersurfaces in Carnot groups

We develop a sub-Riemannian calculus for hypersurfaces in graded nilpotent Lie groups. We introduce an appropriate geometric framework, such as horizontal Levi-Civita connection, second fundamental form, and horizontal Laplace-Beltrami operator. We analyze the relevant minimal surfaces and prove some basic integration by parts formulas. Using the latter we establish general first and second variation formulas for the horizontal perimeter in the Heisenberg group. Such formulas play a fundamental role in the sub-Riemannian Bernstein problem.     

The arithmetic of cuts in models of arithmetic

We present a number of results on the structure of initial segments of models of Peano arithmetic with the arithmetic operations of addition, subtraction, multiplication, division, exponentiation and logarithm. Each of the binary operations introduced is defined in two dual ways, often with quite different results, and we attempt to systematise the issues and show how various calculations may be carried out. To understand the behaviour of addition and subtraction we introduce a notion of derivative on cuts, analogous to differentiation in the calculus. Multiplication, division and other operations are described by higher order versions of derivative. The work here is presented as important preliminary work related to a nonstandard measure theory of non‐definable bounded subsets of a model of Peano arithmetic.     

基于模糊隶属函数无损可见数字水印

设计了一种基于模糊隶属函数的可见水印算法.该方法通过定义隶属度函数建立起和遮蔽图像相关的融合系数,每种像素的融合系数不相同,克服了单一融合系数易非法消除的问题.该方法可以无损恢复载体图像.其具有自恢复性,可以在限制非法用户使用图像的同时,为合法用户提供和原始图像完全一致的信息.通过对遮蔽子图像RH加密运用,将一位错扩散到整个图像中.非法用户在没有密钥的情况下,无法恢复出载体图像,安全性高,具有广阔的应用前景.     

Optimal Goodwill Path to Introduce a New Product

We consider the problem of determining an optimal goodwill path for the introduction of a new product in a market, while looking for the maximum foreseen profit. The foreseen revenue depends on the product introduction time and on the goodwill level at the same time. We focus on the advertising costs associated with the goodwill evolution and assume that the cost function possesses some rather general features which are shared by the cost functions of the Nerlove-Arrow type models. The dynamic optimization problem is discussed in the calculus of variations framework. A few examples associated with special cost functions are discussed in detail.     

Labeled sequent calculus for justification logics

Justification logics are modal-like logics that provide a framework for reasoning about justifications. This paper introduces labeled sequent calculi for justification logics, as well as for combined modal-justification logics. Using a method due to Sara Negri, we internalize the Kripke-style semantics of justification and modal-justification logics, known as Fitting models, within the syntax of the sequent calculus to produce labeled sequent calculi. We show that all rules of these systems are invertible and the structural rules (weakening and contraction) and the cut rule are admissible. Soundness and completeness are established as well. The analyticity for some of our labeled sequent calculi are shown by proving that they enjoy the subformula, sublabel and subterm properties. We also present an analytic labeled sequent calculus for $\mathsf{S4LPN}$ based on Artemov–Fitting models.     

A non-canonical approach to arithmetic spin geometry and physical applications

A basic requirement of adelic physics is the principle of invariance of the fundamental physical laws under a change of the underlying number field proposed by I.V. Volovich (cf. [20]). In this paper, we develop a manifestly number field invariant approach to Yang-Mills theory, which is formulated within the framework of arithmetic geometry. As well source fields as the Higgs mechanism are incorporated. For this purpose a non-canonical approach to arithmetic spin geometry is proposed, and its physical applications are analyzed. The associated bundle construction is performed in the setting of arithmetic geometry. Furthermore the arithmetic analogue of the following well-known differential geometric fact is proven: Every covariant derivation on a torsor induces a canonical covariant derivation on the associated object.     

Boundary value problems on weighted networks

We present here a systematic study of general boundary value problems on weighted networks that includes the variational formulation of such problems. In particular, we obtain the discrete version of the Dirichlet Principle and we apply it to the analysis of the inverse problem of identifying the conductivities of the network in a very general framework. Our approach is based on the development of an efficient vector calculus on weighted networks which mimetizes the calculus in the smooth case. The key tool is an adequate construction of the tangent space at each vertex. This allows us to consider discrete vector fields, inner products and general metrics. Then, we obtain discrete versions of derivative, gradient, divergence and Laplace-Beltrami operators, satisfying analogous properties to those verified by their continuous counterparts. On the other hand we develop the corresponding integral calculus that includes the discrete versions of the Integration by Parts technique and Green’s Identities. Finally, we apply our discrete vector calculus to analyze the consistency of difference schemes used to solve numerically a Robin boundary value problem in a square.     

On modeling with multiplicative differential equations

This work is aimed to show that various problems from different fields can be modeled more efficiently using multiplicative calculus, in place of Newtonian calculus. Since multiplicative calculus is still in its infancy, some effort is put to explain its basic principles such as exponential arithmetic, multiplicative calculus, and multiplicative differential equations. Examples from finance, actuarial science, economics, and social sciences are presented with solutions using multiplicative calculus concepts. Based on the encouraging results obtained it is recommended that further research into this field be vested to exploit the applicability of multiplicative calculus in different fields as well as the development of multiplicative calculus concepts.     

Four (algorithms) in one (bag): an integrative framework of knowledge for teaching the standard algorithms of the basic arithmetic operations

In this article we present an integrative framework of knowledge for teaching the standard algorithms of the four basic arithmetic operations. The framework is based on a mathematical analysis of the algorithms, a connectionist perspective on teaching mathematics and an analogy with previous frameworks of knowledge for teaching arithmetic operations with rational numbers. In order to evaluate the potential applicability of the framework to task design, it was used for the design of mathematical learning tasks for teachers. The article includes examples of the tasks, their theoretical analysis, and empirical evidence of the sensitivity of the tasks to variations in teachers’ knowledge of the subject. This evidence is based on a study of 46 primary school teachers. The article concludes with remarks on the applicability of the framework to research and practice, highlighting its potential to encourage teaching the four algorithms with an emphasis on conceptual understanding.     

On some properties of the multidimensional Bochner-Phillips functional calculus

We develop the multidimensional functional calculus of semigroup generators which is based on the class of Bernstein functions in several variables. We establish spectral mapping theorems, give a holomorphy condition for the semigroups generated by the operators arising in this calculus, as well as prove the moment inequality for these operators.     

On pricing arithmetic average reset options with multiple reset dates in a lattice framework

We develop a straightforward algorithm to price arithmetic average reset options with multiple reset dates in a Cox et al. (CRR) (1979) [10] framework. The use of a lattice approach is due to its adaptability and flexibility in managing arithmetic average reset options, as already evidenced by Kim et al. (2003) [9]. Their model is based on the Hull and White (1993) [5] bucketing algorithm and uses an exogenous exponential function to manage the averaging feature, but their choice of fictitious values does not guarantee the algorithm’s convergence (cfr., Forsyth et al. (2002) [11]). We propose to overcome this drawback by selecting a limited number of trajectories among the ones reaching each node of the lattice, where we compute effective averages. In this way, the computational cost of the pricing problem is reduced, and the convergence of the discrete time model to the corresponding continuous time one is guaranteed.     

Nonconvex differential calculus for infinite-dimensional multifunctions

The paper is concerned with generalized differentiation of set-valued mappings between Banach spaces. Our basic object is the so-called coderivative of multifunctions that was introduced earlier by the first author and has had a number of useful applications to nonlinear analysis, optimization, and control. This coderivative is a nonconvex-valued mapping which is related to sequential limits of Fréchet-like graphical normals but is not dual to any tangentially generated derivative of multifunctions. Using a variational approach, we develop a full calculus for the coderivative in the framework of Asplund spaces. The latter class is sufficiently broad and convenient for many important applications. Some useful calculus results are also obtained in general Banach spaces.This research was partially supported by the National Science Foundation under grants DMS-9206989 and DMS-9404128, by the USA-Israel grant 94-00237, and by the NATO contract CRG-950360.     

Modeling with fractional difference equations

In this paper, we develop some basics of discrete fractional calculus such as Leibniz rule and summation by parts formula. We define simplest discrete fractional calculus of variations problem and derive Euler-Lagrange equation. We introduce and solve Gompertz fractional difference equation for tumor growth models.     

Calculus of directional subdifferentials and coderivatives in Banach spaces

In this work we study the directional versions of Mordukhovich normal cones to nonsmooth sets, coderivatives of set-valued mappings, and subdifferentials of extended-real-valued functions in the framework of general Banach spaces. We establish some characterizations and basic properties of these constructions, and then develop calculus including sum rules and chain rules involving smooth functions. As an application, we also explore the upper estimates of the directional Mordukhovich subdifferentials and singular subdifferentials of marginal functions.     

The ERES method for computing the approximate GCD of several polynomials

The computation of the greatest common divisor (GCD) of a set of polynomials has interested the mathematicians for a long time and has attracted a lot of attention in recent years. A challenging problem that arises from several applications, such as control or image and signal processing, is to develop a numerical GCD method that inherently has the potential to work efficiently with sets of several polynomials with inexactly known coefficients. The presented work focuses on: (i) the use of the basic principles of the ERES methodology for calculating the GCD of a set of several polynomials and defining approximate solutions by developing the hybrid implementation of this methodology. (ii) the use of the developed framework for defining the approximate notions for the GCD as a distance problem in a projective space to develop an optimization algorithm for evaluating the strength of different ad-hoc approximations derived from different algorithms. The presented new implementation of ERES is based on the effective combination of symbolic–numeric arithmetic (hybrid arithmetic) and shows interesting computational properties for the approximate GCD problem. Additionally, an efficient implementation of the strength of an approximate GCD is given by exploiting some of the special aspects of the respective distance problem. Finally, the overall performance of the ERES algorithm for computing approximate solutions is discussed.     

Nonsmooth sequential analysis in Asplund spaces

We develop a generalized differentiation theory for nonsmooth functions and sets with nonsmooth boundaries defined in Asplund spaces. This broad subclass of Banach spaces provides a convenient framework for many important applications to optimization, sensitivity, variational inequalities, etc. Our basic normal and subdifferential constructions are related to sequential weak-star limits of Fréchet normals and subdifferentials. Using a variational approach, we establish a rich calculus for these nonconvex limiting objects which turn out to be minimal among other set-valued differential constructions with natural properties. The results obtained provide new developments in infinite dimensional nonsmooth analysis and have useful applications to optimization and the geometry of Banach spaces.

     

Are beginning calculus and engineering students adequately prepared for higher education? An assessment of students’ basic mathematical knowledge

Are students transitioning from the secondary level to university studies in mathematics and engineering adequately prepared for education at the tertiary level? In this study, we discuss the prior mathematical knowledge and skills demonstrated by Norwegian engineering (N?=?1537) and calculus (N?=?626) university students by using data from a mathematics assessment administered by the Norwegian Mathematical Council. The assessment examines students’ conceptual understanding, computation skills and problem solving skills on the basis of the mathematics curriculum of lower secondary education. We found that calculus students significantly outperformed engineering students, but both student groups struggled to solve the test, with the calculus and engineering groups scoring an average of 60% and 46%, respectively. Beginning students who fail to master basic skills, such as solving arithmetic and algebra problems, will most likely face difficulties in their further courses. Although few female students enrol in calculus and engineering programmes compared with male ones and are thus underrepresented, male and female students at the same ability level achieved comparable test scores. Furthermore, students reported high levels of intrinsic and extrinsic motivation, and a positive relationship was observed between intrinsic motivation and achievement.