On the logarithm of the differential operator

Two different proofs are given of the fact that In s= — s {In t + C}, where С is Euler’s constant.

On Optimal Quadratic Lagrange Interpolation: Extremal Node Systems with Minimal Lebesgue Constant via Symbolic Computation

ACM Computing Classification System (1998): G.1.1, G.1.2.

α-Mellin Transform and One of Its Applications

MSC 2010: 35R11, 44A10, 44A20, 26A33, 33C45

Class Number Two for Real Quadratic Fields of Richaud-Degert Type

2000 Mathematics Subject Classification: Primary: 11D09, 11A55, 11C08, 11R11, 11R29; Secondary: 11R65, 11S40; 11R09.

Zolotarev's proof of Gauss reciprocity and Jacobi symbols

2000 Mathematics Subject Classification: Primary 11A15.

The Shapley value for airport and irrigation games

In this paper cost sharing problems are considered. We focus on problems given by rooted trees, we call these problems cost-tree problems, and on the induced transferable utility cooperative games, called irrigation games. A formal notion of irrigation games is introduced, and the characterization of the class of these games is provided. The well-known class of airport games Littlechild and Thompson (1977) is a subclass of irrigation games. The Shapley value Shapley (1953) is probably the most popular solution concept for transferable utility cooperative games. Dubey (1982) and Moulin and Shenker (1992) show respectively, that Shapley's Shapley (1953) and Young (1985)'s axiomatizations of the Shapley value are valid on the class of airport games. In this paper we show that Dubey (1982)'s and Moulin and Shenker (1992)'s results can be proved by applying Shapley (1953)'s and Young (1985)'s proofs, that is those results are direct consequences of Shapley (1953)'s and Young (1985)'s results. Furthermore, we extend Dubey (1982)'s and Moulin and Shenker (1992)'s results to the class of irrigation games, that is we provide two characterizations of the Shapley value for cost sharing problems given by rooted trees. We also note that for irrigation games the Shapley value is always stable, that is it is always in the core Gillies (1959).

Bevezetés a sztochasztikus analízisbe közgazdászoknak (Introducing stochastic analysis)

A dolgozat célja, hogy rövid bevezetést adjon a folytonos idejű sztochasztikus analízisbe. A hazai pénzügyi oktatási gyakorlat nagyrészt a diszkrét idejű és gyakran diszkrét állapotterű modellekre épül. Ennek oka a folytonos időparaméterű sztochasztikus folyamatok elméletétől való érthető idegenkedés. A folytonos időparaméterű sztochasztikus analízis a modern matematika egyik csúcsteljesítménye, amely teljeskörű matematikai megértése egyrészt feltételezi, hogy az olvasó tisztában van a modern analízis szinte minden részletével; másrészt a matematikai részletek pontos megértése nem sok segítséget jelent a pénzügyi gondolatok elsajátításakor. / === / In the article we present a short, intuitive introduction to stochastic analysis. Our presentation is aimed for economist and we try to discuss only the most elementary properties of the stochastic analysis. Instead of precise proofs we present some simplified intuitive arguments. The central concept of the discussion is the quadratic variation and the Itō's lemma.

Lie-szimmetriák egy közgazdasági alkalmazása (An economic application of the Lie symmetries)

Ebben a tanulmányban ismertetjük a Nöther-tétel lényegi vonatkozásait, és kitérünk a Lie-szimmetriák értelmezésére abból a célból, hogy közgazdasági folyamatokra is alkalmazzuk a Lagrange-formalizmuson nyugvó elméletet. A Lie-szimmetriák dinamikai rendszerekre történő feltárása és viselkedésük jellemzése a legújabb kutatások eredményei e területen. Például Sen és Tabor (1990), Edward Lorenz (1963), a komplex kaotikus dinamika vizsgálatában jelent®s szerepet betöltő 3D modelljét, Baumann és Freyberger (1992) a két-dimenziós Lotka-Volterra dinamikai rendszert, és végül Almeida és Moreira (1992) a három-hullám interakciós problémáját vizsgálták a megfelelő Lie-szimmetriák segítségével. Mi most empirikus elemzésre egy közgazdasági dinamikai rendszert választottunk, nevezetesen Goodwin (1967) ciklusmodelljét. Ennek vizsgálatát tűztük ki célul a leírandó rendszer Lie-szimmetriáinak meghatározásán keresztül. / === / The dynamic behavior of a physical system can be frequently described very concisely by the least action principle. In the centre of its mathematical presentation is a specic function of coordinates and velocities, i.e., the Lagrangian. If the integral of the Lagrangian is stationary, then the system is moving along an extremal path through the phase space, and vice versa. It can be seen, that each Lie symmetry of a Lagrangian in general corresponds to a conserved quantity, and the conservation principle is explained by a variational symmetry related to a dynamic or geometrical symmetry. Briey, that is the meaning of Noether's theorem. This paper scrutinizes the substantial characteristics of Noether's theorem, interprets the Lie symmetries by PDE system and calculates the generators (symmetry vectors) on R. H. Goodwin's cyclical economic growth model. At first it will be shown that the Goodwin model also has a Lagrangian structure, therefore Noether's theorem can also be applied here. Then it is proved that the cyclical moving in his model derives from its Lie symmetries, i.e., its dynamic symmetry. All these proofs are based on the investigations of the less complicated Lotka Volterra model and those are extended to Goodwin model, since both models are one-to-one maps of each other. The main achievement of this paper is the following: Noether's theorem is also playing a crucial role in the mechanics of Goodwin model. It also means, that its cyclical moving is optimal. Generalizing this result, we can assert, that all dynamic systems' solutions described by first order nonlinear ODE system are optimal by the least action principle, if they have a Lagrangian.

A pénzügyi eszközök árazásának alaptétele, lokálisan korlátos szemimartingál árfolyamok esetén (The fundamental theorem of asset pricing for locally bounded semimartingales)

A pénzügyi eszközök árazásának alaptétele - kissé pongyolán megfogalmazva - azt állítja, hogy egy értékpapírpiacon akkor nincs arbitrázs, ha létezik egy az eredetivel ekvivalens valószínűségi mérték, amelyre vonatkozóan az értékpapírok árait leíró folyamat egy bizonyos értelemben "martingál". Az első ilyen jellegű állítást M. Harrison és S. R. Pliska bizonyították arra esetre, amikor a valószínűségi mező végesen generált. Azóta a tételnek számos általánosítása született. Ezek közül az egyik legismertebb a Dalang{Morton{ Willinger-tétel, ami már teljesen általános valószínűségi mezőből indul ki, de felteszi, hogy az időparaméter diszkrét, és az időhorizont véges. Időközben a tételnek számos folytonos időparaméterű folyamatokra vonatkozó változata is született. Az alaptételt általános esetben, vagyis amikor valószínűségi mező teljesen általános, és az értékpapírok piaci árait leíró folyamat lokálisan korlátos szemimartingál, Delbaen és W. Schachermayer bizonyították be. A Delbaen{Schachermayer-féle alaptétel a maga nemében egy igen általános áll ítás. A tétel bizonyítása igen hosszadalmas, és a funkcionálanalízis valamint a sztochasztikus folyamatok általános elméletének mély eredményeit használja. Utóbbi tudományterület nagy részét P. A. Meyer és a francia strassbourgi iskola matematikusai dolgozták ki a 60-as évek végétől kezdve. A terület megértését tehát alaposan megnehezíti, hogy a felhasznált matematikai apparátus viszonylag friss, egy része pedig csak francia nyelven érhető el. Meggyőződésünk szerint az eredeti, 1994-es Delbaen és Schachermayer-féle bizonyítás csak kevesek által hozzáférhető. A tételnek tudomásunk szerint azóta sem született tankönyvi feldolgozása, annak ellenére, hogy maga az állítás közgazdász körökben is széles körben ismerté vált, és az eredeti cikket számos szerző idézi. Az itt bemutatott bizonyítás Delbaen és Schachermayer 1992 és 2006 közötti írásain alapul. ______ The Delbaen and Schachermayer's theorem is one of the deepest results of mathematical finance. In this article we tried to rethink and slightly simplify the original proof of the theorem to make understandable for nonspecialists who are familiar with general theory of stochastic processes. We give a detailed proof of the theorem and we give new proofs for some of the used statements.

An innovative approach to teaching structural induction for computer science

Proofs by induction are central to many computer science areas such as data structures, theory of computation, programming languages, program efficiency-time complexity, and program correctness. Proofs by induction can also improve students’ understanding and performance of computer science concepts such as programming languages, algorithm design, and recursion, as well as serve as a medium for teaching them. Even though students are exposed to proofs by induction in many courses of their curricula, they still have difficulties understanding and performing them. This impacts the whole course of their studies, since proofs by induction are omnipresent in computer science. Specifically, students do not gain conceptual understanding of induction early in the curriculum and as a result, they have difficulties applying it to more advanced areas later on in their studies. The goal of my dissertation is twofold: (1) identifying sources of computer science students’ difficulties with proofs by induction, and (2) developing a new approach to teaching proofs by induction by way of an interactive and multimodal electronic book (e-book). For the first goal, I undertook a study to identify possible sources of computer science students’ difficulties with proofs by induction. Its results suggest that there is a close correlation between students’ understanding of inductive definitions and their understanding and performance of proofs by induction. For designing and developing my e-book, I took into consideration the results of my study, as well as the drawbacks of the current methodologies of teaching proofs by induction for computer science. I designed my e-book to be used as a standalone and complete educational environment. I also conducted a study on the effectiveness of my e-book in the classroom. The results of my study suggest that, unlike the current methodologies of teaching proofs by induction for computer science, my e-book helped students overcome many of their difficulties and gain conceptual understanding of proofs induction.

An Innovative Approach to Teaching Structural Induction for Computer Science

Proofs by induction are central to many computer science areas such as data structures, theory of computation, programming languages, program efficiency-time complexity, and program correctness. Proofs by induction can also improve students’ understanding of and performance with computer science concepts such as programming languages, algorithm design, and recursion, as well as serve as a medium for teaching them. Even though students are exposed to proofs by induction in many courses of their curricula, they still have difficulties understanding and performing them. This impacts the whole course of their studies, since proofs by induction are omnipresent in computer science. Specifically, students do not gain conceptual understanding of induction early in the curriculum and as a result, they have difficulties applying it to more advanced areas later on in their studies. The goal of my dissertation is twofold: 1. identifying sources of computer science students’ difficulties with proofs by induction, and 2. developing a new approach to teaching proofs by induction by way of an interactive and multimodal electronic book (e-book). For the first goal, I undertook a study to identify possible sources of computer science students’ difficulties with proofs by induction. Its results suggest that there is a close correlation between students’ understanding of inductive definitions and their understanding and performance of proofs by induction. For designing and developing my e-book, I took into consideration the results of my study, as well as the drawbacks of the current methodologies of teaching proofs by induction for computer science. I designed my e-book to be used as a standalone and complete educational environment. I also conducted a study on the effectiveness of my e-book in the classroom. The results of my study suggest that, unlike the current methodologies of teaching proofs by induction for computer science, my e-book helped students overcome many of their difficulties and gain conceptual understanding of proofs induction.

Association between mean residual life (MRL) and failure rate functions for continuous and discrete lifetime distributions

The purpose of this study was to correct some mistakes in the literature and derive a necessary and sufficient condition for the MRL to follow the roller-coaster pattern of the corresponding failure rate function. It was also desired to find the conditions under which the discrete failure rate function has an upside-down bathtub shape if corresponding MRL function has a bathtub shape. The study showed that if discrete MRL has a bathtub shape, then under some conditions the corresponding failure rate function has an upside-down bathtub shape. Also the study corrected some mistakes in proofs of Tang, Lu and Chew (1999) and established a necessary and sufficient condition for the MRL to follow the roller-coaster pattern of the corresponding failure rate function. Similarly, some mistakes in Gupta and Gupta (2000) are corrected, with the ensuing results being expanded and proved thoroughly to establish the relationship between the crossing points of the failure rate and associated MRL functions. The new results derived in this study will be useful to model various lifetime data that occur in environmental studies, medical research, electronics engineering, and in many other areas of science and technology.

Contribuições para o processo de verificação de satisfatibilidade módulo teoria em Event-B

Event-B is a formal method for modeling and verification of discrete transition systems. Event-B development yields proof obligations that must be verified (i.e. proved valid) in order to keep the produced models consistent. Satisfiability Modulo Theory solvers are automated theorem provers used to verify the satisfiability of logic formulas considering a background theory (or combination of theories). SMT solvers not only handle large firstorder formulas, but can also generate models and proofs, as well as identify unsatisfiable subsets of hypotheses (unsat-cores). Tool support for Event-B is provided by the Rodin platform: an extensible Eclipse based IDE that combines modeling and proving features. A SMT plug-in for Rodin has been developed intending to integrate alternative, efficient verification techniques to the platform. We implemented a series of complements to the SMT solver plug-in for Rodin, namely improvements to the user interface for when proof obligations are reported as invalid by the plug-in. Additionally, we modified some of the plug-in features, such as support for proof generation and unsat-core extraction, to comply with the SMT-LIB standard for SMT solvers. We undertook tests using applicable proof obligations to demonstrate the new features. The contributions described can potentially affect productivity in a positive manner.

GeoGebraTUTOR : développement d’un système tutoriel autonome pour l’accompagnement d’élèves en situation de résolution de problèmes de démonstration en géométrie plane et genèse d’un espace de travail géométrique idoine

Travaux d'études doctorales réalisées conjointement avec les travaux de recherches doctorales de Nicolas Leduc, étudiant au doctorat en génie informatique à l'École Polytechnique de Montréal.

Free Resolutions from Involutive Bases

We show that the theory of involutive bases can be combined with discrete algebraic Morse Theory. For a graded k[x0 ...,xn]-module M, this yields a free resolution G, which in general is not minimal. We see that G is isomorphic to the resolution induced by an involutive basis. It is possible to identify involutive bases inside the resolution G. The shape of G is given by a concrete description. Regarding the differential dG, several rules are established for its computation, which are based on the fact that in the computation of dG certain patterns appear at several positions. In particular, it is possible to compute the constants independent of the remainder of the differential. This allows us, starting from G, to determine the Betti numbers of M without computing a minimal free resolution: Thus we obtain a new algorithm to compute Betti numbers. This algorithm has been implemented in CoCoALib by Mario Albert. This way, in comparison to some other computer algebra system, Betti numbers can be computed faster in most of the examples we have considered. For Veronese subrings S(d), we have found a Pommaret basis, which yields new proofs for some known properties of these rings. Via the theoretical statements found for G, we can identify some generators of modules in G where no constants appear. As a direct consequence, some non-vanishing Betti numbers of S(d) can be given. Finally, we give a proof of the Hyperplane Restriction Theorem with the help of Pommaret bases. This part is largely independent of the other parts of this work.