Related papers: Discharging cartwheels
The general aim of this paper is to supply a method to decide whether a discrete system decoheres or not, and under what conditions decoherence occurs, with no need of appealing to computer simulations to obtain the time evolution of the…
We designed three color-coding schemes to identify related information across representations and to differentiate distinct information within a representation in slide-based instruction for calculus-based introductory mechanics. We found…
We present results on partitioning the vertices of $2$-edge-colored graphs into monochromatic paths and cycles. We prove asymptotically the two-color case of a conjecture of S\'ark\"ozy: the vertex set of every $2$-edge-colored graph can be…
We announce here that Fermat's Last theorem was solved, but there is an easy proof of it on the basis of elemetary undergraduate mathematics. We shall disclose such an easy proof.
In this paper, we show that Higher-Order Coloured Unification - a form of unification developed for automated theorem proving - provides a general theory for modeling the interface between the interpretation process and other sources of…
We suggest a diagrammatic model of computation based on an axiom of distributivity. A diagram of a decorated coloured tangle, similar to those that appear in low dimensional topology, plays the role of a circuit diagram. Equivalent diagrams…
P. Kirchberger proved that, for a finite subset $X$ of $\mathbb{R}^{d}$ such that each point in $X$ is painted with one of two colors, if every $d+2$ or fewer points in $X$ can be separated along the colors, then all the points in $X$ can…
This paper describes the formal verification of two Turing machines using the program verifier Dafny. Both machines are deciders, so we prove total correctness. They are typical first examples of Turing machines used in any course of…
We consider the class A of graphs that contain no odd hole, no antihole, and no ``prism'' (a graph consisting of two disjoint triangles with three disjoint paths between them). We show that the coloring algorithm found by the second and…
The results of this note were stated in the first author PhD manuscript in 2006 but never published. The writing of a proof given there was slightly careless and the proof itself scattered across the document, the goal of this note is to…
Since its existence, the computer tool has often supported mathematicians, whether it is to implement an approximation method (numerical calculation of a root, of an integral, ...) or to simulate a phenomenon (geometric in nature,…
We present a proof system for a multimodal logic, based on our previous work on a multimodal Martin-Loef type theory. The specification of modes, modalities, and implications between them is given as a mode theory, i.e. a small 2-category.…
An evidential reasoning mechanism based on the Dempster-Shafer theory of evidence is introduced. Its performance in real-world image analysis is compared with other mechanisms based on the Bayesian formalism and a simple weight combination…
We provide a new simple and transparent proof of the version of Kummer's test given in [Tong, J. (1994). Amer. Math. Monthly. 101(5): 450--452]. Our proof is based on an application of a Hardy--Littlewood Tauberian theorem.
Mechanized reasoning uses computers to verify proofs and to help discover new theorems. Computer scientists have applied mechanized reasoning to economic problems but -- to date -- this work has not yet been properly presented in economics…
Automatic verification deals with the validation by means of computers of correctness certificates. The related tools, usually called proof assistants or interactive provers, provide an interactive environment for the creation of formal…
We prove that every digraph has a vertex 4-colouring such that for each vertex $v$, at most half the out-neighbours of $v$ receive the same colour as $v$. We then obtain several results related to the conjecture obtained by replacing 4 by…
This paper demonstrates that a computer aided perturbation theory can easily be realized by use of a cumulant approach. In contrast to a recent alternative formulation on the basis of Wegner's flow equation method the present approach can…
In this note we fill a gap in the proof of the main theorem (Theorem 1.2) of our paper 'Surfaces in 4-manifolds', Math. Res. Letters 4 (1997), 907-914.
We provide a human-verifiable proof that, in a certain sense, the chromatic number of the plane is exactly 7.