https://www.mdu.se/

The aim of this paper is to present fixed point result of mappings satisfying a generalized rational contractive condition in the setup of multiplicative metric spaces. As an application, we obtain a common fixed point of a pair of weakly compatible mappings. Some common fixed point results of pair of rational contractive types mappings involved in cocyclic representation of a nonempty subset of a multiplicative metric space are also obtained. Some examples are presented to support the results proved herein. Our results generalize and extend various results in the existing literature.

The aim of this paper is to present coincidence and common fixed point results of set-valued mappings satisfying certain generalized graphic F-contractive conditions on a family of sets endowed with a graph. It is worth mentioning that these results are obtained without appealing to any form of continuity of mappings involved herein. Some examples are presented to support the results proved in this paper. Our results unify, generalize and extend various comparable results in the existing literature. © 2016, Springer International Publishing.

The aim of this paper is to present common fixed point results of set-valued graphic F-contraction mappings on a family of sets endowed with a graph. Some examples are presented to support the results proved herein. Our results unify, generalize and extend various results in the existing literature.

We study Hilbert functions, Lefschetz properties, and Jordan type of Artinian Gorenstein algebras associated to Perazzo hypersurfaces in projective space. The main focus lies on Perazzo threefolds, for which we prove that the Hilbert functions are always unimodal. Further we prove that the Hilbert function determines whether the algebra is weak Lefschetz, and we characterize those Hilbert functions for which the weak Lefschetz property holds. By example, we verify that the Hilbert functions of Perazzo fourfolds are not always unimodal. In the particular case of Perazzo threefolds with the smallest possible Hilbert function, we give a description of the possible Jordan types for multiplication by any linear form.

This paper aims at an accurate and efficient computation of effective quantities, e.g., the homogenized coefficients for approximating the solutions to partial differential equations with oscillatory coefficients. Typical multiscale methods are based on a micro-macro coupling, where the macromodel describes the coarse scale behaviour, and the micro model is solved only locally to upscale the effective quantities, which are missing in the macro model. The fact that the micro problems are solved over small domains within the entire macroscopic domain, implies imposing artificial boundary conditions on the boundary of the microscopic domains. A naive treatment of these artificial boundary conditions leads to a first order error in ε/δ, where ε < δ represents the characteristic length ofthe small scale oscillations and δ^d is the size of micro domain. This error dominates all other errors originating from the discretization of the macro and the micro problems, and its reduction is a main issue in today’s engineering multiscale computations. The objective of the present work is to analyse a parabolic approach, first announced in [A. Abdulle,D. Arjmand, E. Paganoni, C. R. Acad. Sci. Paris, Ser. I, 2019], for computing the homogenized coefficients with arbitrarily high convergence rates in ε/δ. The analysis covers the setting of periodic microstructure,and numerical simulations are provided to verify the theoretical findings for more general settings, e.g. non-periodic micro structures.

This paper presents two new approaches for finding the homogenized coefficients of multiscale elliptic PDEs. Standard approaches for computing the homogenized coefficients suffer from the so-called resonance error, originating from a mismatch between the true and the computational boundary conditions. Our new methods, based on solutions of parabolic and elliptic cell problems, result in an exponential decay of the resonance error.

This paper consolidates and compares the applicability and practicality of Black-Litterman model versus traditional Markowitz Mean-Variance model. Although well-known model such as Mean-Variance is academically sound and popular, it is rarely used among asset managers due to its deficiencies. To put the discussion into context we shed light on the improvement made by Fisher Black and Robert Litterman by putting the performance and practicality of both Black- Litterman and Markowitz Mean-Variance models into test. We will illustrate detailed mathematical derivations of how the models are constructed and bring clarity and profound understanding of the intuition behind the models. We generate two different portfolios, composing data from 10-Swedish equities over the course of 10-year period and respectively select 30-days Swedish Treasury Bill as a risk-free rate. The resulting portfolios orientate our discussion towards the better comparison of the performance and applicability of these two models and we will theoretically and geometrically illustrate the differences. Finally, based on extracted results of the performance of both models we demonstrate the superiority and practicality of Black-Litterman model, which in our particular case outperform traditional Mean- Variance model.

This thesis brings together three thematic topics, PageRank of evolving tree graphs, stopping criteria for ranks and perturbed Markov chains with damping component. The commonality in these topics is their focus on ranking problems in information networks. In the fields of science and engineering, information networks are interesting from both practical and theoretical perspectives. The fascinating property of networks is their applicability in analysing broad spectrum of problems and well established mathematical objects. One of the most common algorithms in networks' analysis is PageRank. It was developed for web pages’ ranking and now serves as a tool for identifying important vertices as well as studying characteristics of real-world systems in several areas of applications. Despite numerous successes of the algorithm in real life, the analysis of information networks is still challenging. Specifically, when the system experiences changes in vertices /edges or it is not strongly connected or when a damping stochastic matrix and a damping factor are added to an information matrix. For these reasons, extending existing or developing methods to understand such complex networks is necessary.

Chapter 2 of this thesis focuses on information networks with no bidirectional interaction. They are commonly encountered in ecological systems, number theory and security systems. We consider certain specific changes in a network and describe how the corresponding information matrix can be updated as well as PageRank scores. Specifically, we consider the graph partitioned into levels of vertices and describe how PageRank is updated as the network evolves.

In Chapter 3, we review different stopping criteria used in solving a linear system of equations and investigate each stopping criterion against some classical iterative methods. Also, we explore whether clustering algorithms may be used as stopping criteria.

Chapter 4 focuses on perturbed Markov chains commonly used for the description of information networks. In such models, the transition matrix of an information Markov chain is usually regularised and approximated by a stochastic (Google type) matrix. Stationary distribution of the stochastic matrix is equivalent to PageRank, which is very important for ranking of vertices in information networks. Determining stationary probabilities and related characteristics of singularly perturbed Markov chains is complicated; leave alone the choice of regularisation parameter. We use the procedure of artificial regeneration for the perturbed Markov chain with the matrix of transition probabilities and coupling methods. We obtain ergodic theorems, in the form of asymptotic relations. We also derive explicit upper bounds for the rate of convergence in ergodic relations. Finally, we illustrate these results with numerical examples.

PageRank update refers to the process of computing new PageRank values after change(s) (addition or removal of links/vertices) has occurred in real life networks. The purpose of the updating is to avoid recalculating the values from scratch. To efficiently carry out the update, we consider PageRank as the expected number of visits to target vertex if multiple random walks are performed, starting at each vertex once and weighing each of these walks by a weight value. Hence, it might be looked at as updating non-normalised PageRank. In the proposed approach, a scaled adjacency matrix is sequentially updated after every change and the levels of the vertices being updated as well. This enables sets of internal and sink vertices dependent on their roots or parents, thus vector-vector product can be performed sequentially since there are no infinite steps from one vertex to the other.

A PageRank update refers to the process of computing new PageRank valuesafter a change(s) (addition or removal of links/vertices) has occurred in real-lifenetworks. The purpose of updating is to avoid re-calculating the values from scratch.To efficiently carry out the update, we consider PageRank to be the expected numberof visits to a target vertex if multiple random walks are performed, starting at eachvertex once and weighing each of these walks by a weight value. Hence, it mightbe looked at as updating a non-normalized PageRank. We focus on networks of treegraphs and propose an approach to sequentially update a scaled adjacency matrix afterevery change, as well as the levels of the vertices. In this way, we can update thePageRank of affected vertices by their corresponding levels.

In this article, we study how PageRank can be updated in an evolving tree graph. We are interested in finding how ranks of the graph can be updated simultaneously and effectively using previous ranks without resorting to iterative methods such as the Jacobi or Power method. We demonstrate and discuss how PageRank can be updated when a leaf is added to a tree, at least one leaf is added to a vertex with at least one outgoing edge, an edge added to vertices at the same level and forward edge is added in a tree graph. The results of this paper provide new insights and applications of standard partitioning of vertices of the graph into levels using breadth-first search algorithm. Then, one determines PageRanks as the expected numbers of random walk starting from any vertex in the graph. We noted that time complexity of the proposed method is linear, which is quite good. Also, it is important to point out that the types of vertex play essential role in updating of PageRank.

Summary Updating PageRank refers to a process of computing new PageRank values after changes have occurred in a graph. The main goal of the updating is to avoid recalculating the values from scratch. This chapter focuses on updating PageRank of an evolving tree graph when a vertex and an edge are added sequentially. It describes how to maintain level structures when a cycle is created and investigates the practical and theoretical efficiency to update PageRanks for an evolving graph with many cycles. The chapter discusses the convergence of the power method applied to stochastic complement of Google matrix when a feedback vertex set is used. It also demonstrates that the partition by feedback vertex set improves asymptotic convergence of power method in updating PageRank in a network with cyclic components.

Bioinformatics, internet search engines (web pages) and social networks are some of the examples with large and high sparsity matrices. For some of these systems, only the actual ranks of the solution vector is interesting rather than the vector itself. In this case, it is desirable that the stopping criterion reflects the error in ranks rather than the residual vector that might have a lower convergence. This chapter evaluates stopping criteria on Jacobi, successive over relaxation (SOR) and power series iterative schemes. Numerical experiments were performed and results show that Kendall's correlation coefficient gives good stopping criterion of ranks for linear system of equations. The chapter focuses on the termination criterion as means of obtaining good ranks. It outlines some studies carried out on stopping criteria in solving the linear system.

The paper is devoted to studies of perturbed Markov chains commonly used for description of information networks. In such models, the matrix of transition probabilities for the corresponding Markov chain is usually regularised by adding  a special damping matrix multiplied by a small damping (perturbation) parameter ε. In this paper, we present results of the detailed perturbation analysis of Markov chains with damping component and numerical experiments supporting and illustrating the results of this perturbation analysis.

This chapter is devoted to studies of perturbed Markov chains, commonly used for the description of information networks. In such models, the matrix of transition probabilities for the corresponding Markov chain is usually regularized by adding aspecial damping matrix, multiplied by a small damping (perturbation) parameter ε. In this chapter, we present the results of detailed perturbation analysis of Markov chains with damping component and numerical experiments supporting and illustrating the results of this perturbation analysis.

We show that, having a Hom-Lie algebra and an element of its dual vector space that satisfies certain conditions, one can construct a ternary totally skew-symmetric bracket and prove that this ternary bracket satisfies the Hom-Filippov-Jacobi identity, i.e. this ternary bracket determines the structure of 3-Hom-Lie algebra on the vector space of a Hom-Lie algebra. Then we apply this construction to two Hom-Lie algebras constructed on an associative, commutative algebra using σ-derivation and involution, and we obtain two 3-Hom-Lie algebras.

Option pricing models such as the Black-76, Bachelier and Stochastic Alpha Beta Rho (SABR) models define delta, gamma and vega using the forward rate as the underlying instrument. In terms of options on swaps, this underlying instrument is the forward swap rate, which is the market fixed rate on the swap. This work employs the Black-76 and Bachelier models to determine delta, gamma and vega of a European swaption, but rather uses the swap value as the underlying instrument. We use data in our implementation and the work is done in the python programming language. 

Our results yielded relatively higher absolute delta values than those implied by the conventional Black-76 and Bachelier models. This means that our method yields relatively higher sensitivity of the swaption value to small changes in underlying asset value. It also means higher trading volumes of the swap contract to hedge against small changes in the value of the underlying swap using our method. It was also observed from our gamma values that both our method and the conventional Black-76 and Bachelier models can provide better sensitivities, relative to each other, to big changes in the underlying swap value. This, however, depends on the choice of strike rate. Further, our work produced comparatively lower absolute vega values, hence, lower sensitivity to changing implied volatility. To be able to use volatility values in both the normal and log-normal sense, we converted from normal to log-normal volatilities. This was achieved numerically using the Newton Raphson method implemented in python. 

Changes in swap value and volatility were mimicked using basis point additions and subtractions of certain parameter values, specifically, floating rates, forward rate and volatility values. Each basis point adjustment in the necessary parameter yielded a different delta, gamma or vega value. Since the swap value or volatility can change multiple times within a specific time period, it was observed that there can exist a series of delta, gamma and vega values within a specific period of time.

After the last financial crisis, regulators started to strengthen the measures to reduce the risk on the financial market by requiring margin to be posted. In addition to the Variation Margin that reflects the daily change in market value of the contracts, Initial Margin has to be posted to compensate the fluctuation of the collateral value. The Margin Valuation Adjustment (MVA) represents the funding price of the initial margin that has to be calculated. The numerical calculation of the MVA is a real challenge as it requires to run a Monte Carlo simulation inside another Monte Carlo simulation. However, alternative formula could be used to approximate the result of the MVA. This thesis highlights the essential notion about the MVA and the available tools to calculate its value.

The Gleason problem has been proven to be a complicated issue to tackle. In this thesiswe will conclude that a domain, Ω ⊂ R^𝑛, has Gleason 𝑅-property at any point 𝑝 ∈ Ω, where 𝑅(Ω) ⊂ 𝐶^∞(Ω) is the ring of functions that are real analytic in 𝑝. First, we investigate function spaces and give them fitting norms. Afterwards, we build a bump function that is then used to construct a smooth partition of unity on R^𝑛. Finally, we show that some of the functionspaces, introduced earlier, have the Gleason property. Ultimately, we use our smooth partition of unity in order to prove that the statement above holds for domains in R². Subsequently, with the same reasoning one can prove that the statement also holds for domains Ω ⊂ R^𝑛.

This thesis primarily looks at estimation error problems and other related issues arising in connection with portfolio optimization. With some available assets, a portfolio program or optimizer seeks to distribute a fixed amount of capital among these available assets to optimize some cost function. In this regard, Markowitz portfolio selection basis defines the variance of the portfolio return to being that of the portfolio risk and tries to find an allocation that reduces or minimizes the risk subject to a target mean or expected return. Should the mean return vector and the covariance matrix of returns for the underlying assets be known, the Markowitz problem is said to have a closed-form solution.

In practice, however, an estimation is made from historical data for unknown expected returns and the covariance matrix of the returns, and this brings into the domain several problems such as estimation problems and renders the Markowitz theory impracticable in real-life portfolio applications. Estimators necessary to remedy these problems would be made bare to show how possible it is to tackle such issues.

In the concept demonstration sections, the analysis starts with the price data of 40 stocks and the S\&P index. The efficient frontier is introduced and used to show how the estimators take effect.

Finally, implementation is made possible using the R Programming Language to demonstrate the necessary concepts with the conclusion presented at the end.

Syftet med detta arbete är att ta reda på hur lärarna upplever att lässvaga elever påverkas av sina lässvårigheter inom matematiken samt hur lärarna hanterar de problem som uppstår för att hjälpa eleven. Jag har valt den kvalitativa arbetsmetoden med semistrukturerade intervjufrågor. Resultatet visar att svag läsförmåga påverkar eleven inom matematiken men också inom andra ämnen. Inom matematiken påverkas eleven särskilt vid lästal samt vid problemlösning om eleven lämnas ensam med en text som den inte klarar av att läsa eller tyda. För att stödja eleven kan läraren eller någon annan läsa texten eller så arbetar eleverna i grupp där samarbetet mot resultatet är viktigast, inte att kunna läsa texten. Slutsatsen visar att eleven aldrig bör lämnas ensam med en text som den inte förstår, då eleven utestängs från den matematiska processen och det matematiska tänkandet.

This paper presents a quadrature method for evaluating layer potentials in two dimensions close to periodic boundaries, discretized using the trapezoidal rule. It is an extension of the method of singularity swap quadrature, which recently was introduced for boundaries discretized using composite Gauss–Legendre quadrature. The original method builds on swapping the target singularity for its preimage in the complexified space of the curve parametrization, where the source panel is flat. This allows the integral to be efficiently evaluated using an interpolatory quadrature with a monomial basis. In this extension, we use the target preimage to swap the singularity to a point close to the unit circle. This allows us to evaluate the integral using an interpolatory quadrature with complex exponential basis functions. This is well-conditioned, and can be efficiently evaluated using the fast Fourier transform. The resulting method has exponential convergence, and can be used to accurately evaluate layer potentials close to the source geometry. We report experimental results on a simple test geometry, and provide a baseline Julia implementation that can be used for further experimentation.

The integral equation approach to partial differential equations (PDEs) provides significant advantages in the numerical solution of the incompressible Navier-Stokes equations. In particular, the divergence-free condition and boundary conditions are handled naturally, and the ill-conditioning caused by high order terms in the PDE is preconditioned analytically. Despite these advantages, the adoption of integral equation methods has been slow due to a number of difficulties in their implementation. This work describes a complete integral equation-based flow solver that builds on recently developed methods for singular quadrature and the solution of PDEs on complex domains, in combination with several more well-established numerical methods. We apply this solver to flow problems on a number of geometries, both simple and challenging, studying its convergence properties and computational performance. This serves as a demonstration that it is now relatively straightforward to develop a robust, efficient, and flexible Navier-Stokes solver, using integral equation methods.

We present a spectrally accurate method for the rapid evaluation of free-space Stokes potentials, i.e., sums involving a large number of free space Green’s functions. We consider sums involving stokeslets, stresslets and rotlets that appear in boundary integral methods and potential methods for solving Stokes equations. The method combines the framework of the Spectral Ewald method for periodic problems (Lindbo and Tornberg in J Comput Phys 229(23):8994–9010, 2010. doi: 10.1016/j.jcp.2010.08.026 ), with a very recent approach to solving the free-space harmonic and biharmonic equations using fast Fourier transforms (FFTs) on a uniform grid (Vico et al. in J Comput Phys 323:191–203, 2016. doi: 10.1016/j.jcp.2016.07.028 ). Convolution with a truncated Gaussian function is used to place point sources on a grid. With precomputation of a scalar grid quantity that does not depend on these sources, the amount of oversampling of the grids with Gaussians can be kept at a factor of two, the minimum for aperiodic convolutions by FFTs. The resulting algorithm has a computational complexity of $$O(N \log N)$$ O ( N log N ) for problems with N sources and targets. Comparison is made with a fast multipole method to show that the performance of the new method is competitive.

Boundary integral methods are advantageous when simulating viscous flow around rigid particles, due to the reduction in number of unknowns and straightforward handling of the geometry. In this work we present a fast and accurate framework for simulating spheroids in periodic Stokes flow, which is based on the completed double layer boundary integral formulation. The framework implements a new method known as quadrature by expansion (QBX), which uses surrogate local expansions of the layer potential to evaluate it to very high accuracy both on and off the particle surfaces. This quadrature method is accelerated through a newly developed precomputation scheme. The long range interactions are computed using the spectral Ewald (SE) fast summation method, which after integration with QBX allows the resulting system to be solved in M log M time, where M is the number of particles. This framework is suitable for simulations of large particle systems, and can be used for studying e.g. porous media models.

When solving partial differential equations using boundary integral equation methods, accurate evaluation of singular and nearly singular integrals in layer potentials is crucial. A recent scheme for this is quadrature by expansion (QBX), which solves the problem by locally approximating the potential using a local expansion centered at some distance from the source boundary. In this paper we introduce an extension of the QBX scheme in two dimensions (2D) denoted AQBX—adaptive quadrature by expansion—which combines QBX with an algorithm for automated selection of parameters, based on a target error tolerance. A key component in this algorithm is the ability to accurately estimate the numerical errors in the coefficients of the expansion. Combining previous results for flat panels with a procedure for taking the panel shape into account, we derive such error estimates for arbitrarily shaped boundaries in 2D that are discretized using panel-based Gauss–Legendre quadrature. Applying our scheme to numerical solutions of Dirichlet problems for the Laplace and Helmholtz equations, and also for solving these equations, we find that the scheme is able to satisfy a given target tolerance to within an order of magnitude, making it useful for practical applications. This represents a significant simplification over the original QBX algorithm, in which choosing a good set of parameters can be hard.

In boundary integral methods it is often necessary to evaluate layer potentials on or close to the boundary, where the underlying integral is difficult to evaluate numerically. Quadrature by expansion (QBX) is a new method for dealing with such integrals, and it is based on forming a local expansion of the layer potential close to the boundary. In doing so, one introduces a new quadrature error due to nearly singular integration in the evaluation of expansion coefficients. Using a method based on contour integration and calculus of residues, the quadrature error of nearly singular integrals can be accurately estimated. This makes it possible to derive accurate estimates for the quadrature errors related to QBX, when applied to layer potentials in two and three dimensions. As examples we derive estimates for the Laplace and Helmholtz single layer potentials. These results can be used for parameter selection in practical applications.

We present a numerical method for suspensions of spheroids of arbitrary aspect ratio, which sediment under gravity. The method is based on a periodized boundary integral formulation using the Stokes double layer potential. The resulting discrete system is solved iteratively using generalized minimal residual accelerated by the spectral Ewald method, which reduces the computational complexity to O(N log N), where N is the number of points used to discretize the particle surfaces. We develop predictive error estimates, which can be used to optimize the choice of parameters in the Ewald summation. Numerical tests show that the method is well conditioned and provides good accuracy when validated against reference solutions. 

The purpose of this paper is to study the following topics and the relation between them: (i) Optimal singular control of mean-field stochastic differential equations with memory; (ii) reflected advanced mean-field backward stochastic differential equations; and (iii) optimal stopping of mean-field stochastic differential equations. More specifically, we do the following: (1) We prove the existence and uniqueness of the solutions of some reflected advanced memory backward stochastic differential equations; (2) we give sufficient and necessary conditions for an optimal singular control of a memory mean-field stochastic differential equation (MMSDE) with partial information; and (3) we deduce a relation between the optimal singular control of an MMSDE and the optimal stopping of such processes.

Syftet med arbetet är att undersöka hur matematiklärarstudenter ska introducera problemlösning för sina elever och vad som påverkar studenternas tolkningar av problem. Jag har även undersökt vilka kompetenser studenterna anser att en matematiklärare behöver ha för att genomföra en framgångsrik undervisning i matematik genom problemlösning. I undersökningen diskuterar tre grupper med matematiklärarstudenter hur de ska introducera ett problem för eleverna och vilka komprtenser de anser att en matematiklärare behöver ha för att undervisa i matematik genom problemlösning. Resultaten visar att studenterna har olika strategier för att introducera problemlösning för eleverna och att studenternas tolkningar av problemet påverkar introduktionen. Studenterna gör olika tolkningar av problemet beroende av i vilken kontext de tolkar problemet. De har ingen enhetlig bild av vilka kompetenser som krävs av en matematiklärare, för att genomföra en undervisning som svarar mot skolverkets mål.

Due to recent research disproving old claims in financial mathematics such as constant volatility in option prices, new approaches have been incurred to analyze the implied volatility, namely stochastic volatility models. The use of stochastic volatility in option pricing is a relatively new and unexplored field of research with a lot of unknowns, where new answers are of great interest to anyone practicing valuation of derivative instruments such as options. With both single and two-factor stochastic volatility models containing various correlation structures with respect to the asset price and differing mean-reversions of variance the question arises as to how these values change their more observable counterpart: the implied volatility. Using the semi-analytical formula derived by Chiarella and Ziveyi, we compute European call option prices. Then, through the Black–Scholes formula, we solve for the implied volatility by applying the bisection method. The implied volatilities obtained are then approximated using various models of regression where the models’ coefficients are determined through the Moore–Penrose pseudo-inverse to produce implied volatility surfaces for each selected pair of correlations and mean-reversion rates. Through these methods we discover that for different mean-reversions and correlations the overall implied volatility varies significantly and the relationship between the strike price, time to maturity, implied volatility are transformed.

I denna studie undersöktes det hur matematiklärare i mellanstadiet uppfattar fenomenet matematikängslan samt vilka faktorer de anser påverkar elevers inställning kring matematik. Vidare syftade studien till att inhämta kunskaper om hur dessa lärare arbetar för att förebygga att matematikängslan uppstår bland elever. Precis som när elever kan känna sig ängsliga över andra saker, upplever elever med matematikängslan att de är spända och att de inte är kapabla till att genomföra olika matematiska moment (Dowker, 2016). Studien är baserad på den socialkognitiva teorin som är grundad av Albert Bandura (2012). Han menar att elevernas affektiva upplevelser och lärande uppstår när människor observerar och imiterar andra, samtidigt som de är uppmärksamma, använder sitt minne och har motivation (Bandura, 2012). För att svara på våra forskningsfrågor har vi haft semistrukturerade intervjuer med möjlighet för följdfrågor. Informanterna beskrev begreppet matematikängslan som en känsla där eleverna känner sig oroliga och frånvarande från lektionerna. Resultatet visar att de faktorer som påverkar elevers matematikängslan är individanpassning, inställning, erfarenhet, kön och ålder. Vidare beskrev informanterna att matematikängslan kan förebyggas genom att läraren bland annat skapar ett tryggt och lärorikt lärandeklimat samt har en positiv inställning till matematikämnet.

Let R be a ring and X subset of R be a non-empty set. The regular graph of X, Gamma(X), is defined to be the graph with regular elements of X (non-zero divisors of X) as the set of vertices and two vertices are adjacent if their sum is a zero divisor. There is an interesting question posed in BCC22. For a field F, is the chromatic number of Gamma(GL(n)(F)) finite? In this paper, we show that if G is a soluble sub-group of GL(n)(F), then x (Gamma(G)) < infinity. Also, we show that for every field F, chi (Gamma(M-n(F))) = chi (Gamma(M-n(F(x)))), where x is an indeterminate. Finally, for every algebraically closed field F, we determine the maximum value of the clique number of Gamma(< A >), where < A > denotes the subgroup generated by A is an element of GL(n)(F). (C) 2011 Elsevier Inc. All rights reserved.

We consider a market model of financial engineering with three factors represented by three correlated Brownian motions. The volatility of the risky asset in this model is the sum of two stochastic volatilities. The dynamic of each volatility is governed by a mean-reverting process. The first stochastic volatility of mean-reversion process reverts to the second volatility at a fast rate, while the second volatility moves slowly to a constant level over time with the state of the economy.

The double mean-reverting model by Gatheral (2008) is motivated by empirical dynamics of the variance of the stock price. This model can be consistently calibrated to both the SPX options and the VIX options. However due to the lack of an explicit formula for both the European option price and the implied volatility, the calibration is usually done using time consuming methods like Monte Carlo simulation or the finite difference method.

To solve the above issue, we use the method of asymptotic expansion developed by Pagliarani and Pascucci (2017). In paper A, we study the behaviour of the implied volatility with respect to the logarithmic strike price and maturity near expiry and at-the-money. We calculate explicitly the asymptotic expansions of implied volatility within a parabolic region up the second order. In paper B we improve the results obtain in paper A by calculating the asymptotic expansion of implied volatility under the Gatheral model up to order three. In paper C, we perform numerical studies on the asymptotic expansion up to the second order. The Monte-Carlo simulation is used as the benchmark value to check the accuracy of the expansions. We also proposed a partial calibration procedure using the expansions. The calibration procedure is implemented on real market data of daily implied volatility surfaces for an underlying market index and an underlying equity stock for periods both before and during the COVID-19 crisis. Finally, in paper D we check the performance of the third order expansion and compare it with the previous results.

We study the double-mean-reverting model by Gatheral. Our previous results concerning the asymptotic expansion of the implied volatility of a European call option, are improved up to order 3, that is, the error of the approximation is ultimately smaller that the 1.5th power of time to maturity plus the cube of the absolute value of the difference between the logarithmic security price and the logarithmic strike price.

The double-mean-reverting model by Gatheral [1] is motivated by empirical dynamics of the variance of the stock price. No closed-form solution for European option exists in the above model. We study the behaviour of the implied volatility with respect to the logarithmic strike price and maturity near expiry and at-the- money. Using the method by Pagliarani and Pascucci [6], we calculate explicitly the first few terms of the asymptotic expansion of the implied volatility within a parabolic region.

The double-mean-reverting model by Gatheral is motivated by empirical dynamics of the variance of the stock price. No closed-form solution for European option exists in the above model. We study the behaviour of the implied volatility with respect to the logarithmic strike price and maturity near expiry and at-the-money. Using the method by Pagliarani and Pascucci, we calculate explicitly the first few terms of the asymptotic expansion of the implied volatility within a parabolic region.

The Gatheral double stochastic volatility model is a three-factor model with mean-reverting stochastic volatility that reverts to a stochastic long-run mean. Our previous paper investigated the performance of the first and second-order implied volatilities expansions under this model. Moreover, a simple partial calibration method has been proposed. This paper reviews and extends previous results to the third-order implied volatility expansions under the same model. Using Monte-Carlo simulation as the benchmark method, extensive numerical studies are conducted to investigate the accuracy and properties of the third-order expansion. 

This thesis focuses on the parameter stability of additive normal tempered stable processes when calibrating a volatility surface. The studied processes arise as a generalization of Lévy normal tempered stable processes, and their main characteristic are their time-dependent parameters. The theoretical background of the subject is presented, where its construction is discussed taking as a starting point the definition of Lévy processes. The implementation of an option valuation model using Fourier techniques and the calibration process of the model are described. The thesis analyzes the parameter stability of the model when it calibrates the volatility surface of a market index (EURO STOXX 50) during three time spans. The time spans consist of the periods from Dec 2016 to Dec 2017 (after the Brexit and the US presidential elections), from Nov 2019 to Nov 2020 (during the pandemic caused by COVID-19) and a more recent time period, April 2023. The findings contribute to the understanding of the model itself and the behavior of the parameters under particular economic conditions.

yftet med detta arbete var att undersöka hur geobrädet fungerar i praktiken. För att få en inblick i hur det kan vara att arbeta med geobrädet, valde jag att gå ut på min partnerskola i 2 och utföra en kvalitativ undersökning. Denna undersökning bestod i att hålla ett antal lektioner där geobrädet var i fokus. Jag har också utfört en litteraturstudie för att få bättre inblick i det laborativa materialets betydelse för elevers matematikutveckling. Resultatet av min undersökning visade att eleverna blev mycket engagerade och aktiva och att de tyckte att arbetet med geobrädet var roligt och spännande. Jag som blivande lärare lärde mig också mycket om hur jag kan använda geobrädet i mitt kommande yrke och vad som är bra att tänka på när man arbetar med detta laborativa material. De slutsatser som jag kan dra efter att ha utfört detta examensarbete är att elever verkligen uppskattar att få laborera och prova saker på egen hand. Dessutom har jag som blivande pedagog blivit ännu mer övertygad om att det laborativa materialet har stor betydelse för elevernas matematiska utveckling.

For the space of (σ,τ)-derivations of the group algebra C[G] of a discrete countable group G, the decomposition theorem for the space of (σ,τ)-derivations, generalising the corresponding theorem on ordinary derivations on group algebras, is established in an algebraic context using groupoids and characters. Several corollaries and examples describing when all (σ,τ)-derivations are inner are obtained. Considered in details are cases of (σ,τ)-nilpotent groups and (σ,τ)-FC groups.

We prove that functions analytic in the unit disk and continuous up to the boundary are dense in the de Branges–Rovnyak spaces induced by the extreme points of the unit ball of . Together with previous theorems, it follows that this class of functions is dense in any de Branges–Rovnyak space.

We consider Hilbert spaces of analytic functions in the disk with a normalized reproducing kernel and such that the backward shift  is a contraction on the space. We present a model for this operator and use it to prove the surprising result that functions which extend continuously to the closure of the disk are dense in the space. This has several applications, for example we can answer a question regarding reverse Carleson embeddings for these spaces. We also identify a large class of spaces which are similar to the de Branges–Rovnyak spaces and prove some results which are new even in the classical case.

Syftet med denna studie var att utforska förskollärares perspektiv på arbetet med matematiken i förskolan. Studien har utforskat hur förskollärare arbetar med matematik för att tillvarata, synliggöra och främja barns lärande och utveckling i förskolans verksamhet. Detta är en kvalitativ studie där sex stycken förskollärare intervjuats för att ta reda på deras perspektiv kring arbetet med att synliggöra och tillvarata matematik för att främja barnens lärande och utveckling. Resultatet visade att matematiken har en naturlig del i förskollärares vardagsarbete och att matematiska begrepp var en central del i barns lärande och utveckling i matematik. Att skapa möjligheter att uppleva matematik på ett positivt sätt har förskollärarna uttryckt som betydelsefullt. Förskollärarna i studien har beskrivit att barnen redan i förskolan kan ges förutsättning till ett lustfyllt lärande i matematik som grund för vidare lärande. Slutsatser som kan ställas utifrån denna studie är att en medvetenhet kring arbetet med matematik i förskolan är viktigt för att främja barns lärande och utveckling i matematik.

Syftet med denna studie är att undersöka hur lärare i F-3 beskriver utmaningar med att arbeta med de fem förmågorna i undervisningen. För att uppnå syftet har vi genomfört kvalitativa intervjuer för att samla in material med hjälp av sju stycken informanter. Resultatet visar att lärarna kontinuerligt använder sig av en varierad undervisning för att utveckla de fem förmågorna hos eleverna. Det uppkommer även en del utmaningar och möjligheter i arbete med förmågorna.  Slutsatsen är att lärare tillämpar olika arbetsmetoder och material i undervisningen, men oavsett detta så finns det en del utmaningar och möjligheter.

I skolvärlden är matematikängslan vanligt förekommande bland elever. Detta fenomen undersöktes utifrån matematiklärares synvinkel, med fokus på årskurs 4–6. Syftet med denna uppsats är att få ökad kunskap om hur matematiklärare i svenska grundskolor resonerar kring hur de arbetar med matematikängslan. Denna uppsats grundar sig i den socialkognitiva teorin. För att få forskningsfrågorna besvarade genomfördes kvalitativa strukturerade intervjuer. De sex lärarna som intervjuades, lyfte fram olika faktorer som kan leda till matematikängslan. Dessa faktorer är hemmet, undervisningen, omgivningen och elevens egna förmågor. Vidare belyser dessa lärare vikten av en varierad undervisning, hur det kan vara både förebyggande och ha en positiv effekt på elevernas matematiksyn.