Mathematica Journal

The Arithmetic of Points on a Conic and Projectivities
https://doi.org/10.3888/tmj.212 H. S. M. Coxeter wrote several geometry film scripts that were produced between 1965 and 1971 [1]. In 1992, Coxeter gave George Beck mimeographs of two scripts that had not been made. Beck wrote Mathematica code for the stills and animations. This material was added to the third edition of Coxeter’s The Real Projective Plane [...] 
Peak Response of SingleDegreeofFreedom Systems to SweptFrequency Excitation
https://doi.org/10.3888/tmj.211 A comprehensive discussion is presented of the closedform solutions for the responses of singledegreeoffreedom systems subject to sweptfrequency harmonic excitation. The closedform solutions for linear and octave sweptfrequency excitation are presented and these are compared to results obtained by direct numerical integration of the equations of motion. Included is an indepth discussion of the numerical [...] 
PseudoDynamic Approach to the Numerical Solution of Nonlinear Stationary Partial Differential Equations
dx.doi.org/doi:10.3888/tmj.208 This article presents a numerical pseudodynamic approach to solve a nonlinear stationary partial differential equation (PDE) with bifurcations by passing from to a pseudotimedependent PDE . The equation is constructed so that the desired nontrivial solution of represents a fixed point of . The numeric solution of is then obtained [...] 
A Wolfram Language Approach to Real Numerical Algebraic Plane Curves
dx.doi.org/doi:10.3888/tmj.207 This article is a summary of my book A Numerical Approach to Real Algebraic Curves with the Wolfram Language [1]. 1. Introduction The nineteenth century saw great progress in geometric (real) and analytic (complex) algebraic plane curves. In the absence of an ability to do the large number of computations for a concrete theory, the twentieth century [...] 
Improving the Kruskal—Katona Bounds for Complete Subgraphs of a Graph
dx.doi.org/doi:10.3888/tmj.206 An important problem in graph theory is to find the number of complete subgraphs of a given size in a graph. If the graph is very large, it is usually only possible to obtain upper bounds for these numbers based on the numbers of complete subgraphs of smaller sizes. The Kruskal–Katona bounds are often used [...] 
Computational Aspects of Quaternionic Polynomials
dx.doi.org/doi:10.3888/tmj.205 This article explores the numerical mathematics and visualization capabilities of Mathematica in the framework of quaternion algebra. In this context, we discuss computational aspects of the recently introduced Newton and Weierstrass methods for finding the roots of a quaternionic polynomial. Introduction Since Niven proved in his pioneering work [1] that every nonconstant polynomial of the form (1) has at [...] 
Computational Aspects of Quaternionic Polynomials
dx.doi.org/doi:10.3888/tmj.204 This article discusses a recently developed Mathematica tool––a collection of functions for manipulating, evaluating and factoring quaternionic polynomials. relies on the package , which is available for download at w3.math.uminho.pt/QuaternionAnalysis. Introduction Some years ago, the first two authors of this article extended the standard Mathematica package implementing Hamilton’s quaternion algebra—the package —endowing it with the ability, [...] 
The Modular Group
dx.doi.org/doi:10.3888/tmj.203 The action of Möbius transformations with real coefficients preserves the hyperbolic metric in the upper halfplane model of the hyperbolic plane. The modular group is an interesting group of hyperbolic isometries generated by two Möbius transformations, namely, an ordertwo element and an element of infinite order . Viewing the action of the group elements [...] 
Symbolic Solutions of Simultaneous FirstOrder PDEs in One Unknown
dx.doi.org/doi:10.3888/tmj.202 We propose and implement an algorithm for solving an overdetermined system of partial differential equations in one unknown. Our approach relies on the Bour–Mayer method to determine compatibility conditions via Jacobi–Mayer brackets. We solve compatible systems recursively by imitating what one would do with pen and paper: Solve one equation, substitute its solution into the [...] 
A Beginner’s Guide to Solving Sudoku Puzzles by Computer
dx.doi.org/doi:10.3888/tmj.201 We simultaneously introduce effective techniques for solving Sudoku puzzles and explain how to implement them in Mathematica. The hardest puzzles require some guessing, and we include a simple backtracking technique that solves even the hardest puzzles. The programming skills required are kept at a minimum. Introduction to Sudoku Sudoku, for those unfamiliar with this puzzle, consists of [...]