Related papers: Computer-assisted proofs of "Kariya's theorem" wit…
We survey some algebraic geometric aspects of mirror symmetry and duality in string theory. Some applications of computer algebra to algebraic geometry and string theory are shortly reviewed.
I will discuss results of three different types in geometry and topology. (1) General vanishing and rigidity theorems of elliptic genera proved by using modular forms, Kac-Moody algebras and vertex operator algebras. (2) The computations of…
Using von Neumann algebras, we extend the theory of quantum computation on a graph to a theory of computation on an arbitrary topological space.
Mathematical models implemented on a computer have become the driving force behind the acceleration of the cycle of scientific processes. This is because computer models are typically much faster and economical to run than physical…
The Bayesian evidence is a key tool in model selection, allowing a comparison of models with different numbers of parameters. Its use in analysis of cosmological models has been limited by difficulties in calculating it, with current…
The computational abilities of theories within the generalised probabilistic theory framework has been the subject of much recent study. Such investigations aim to gain an understanding of the possible connections between physical…
In this note we give two proofs of Brooks' Theorem. The first is obtained by modifying an earlier proof and the second by combining two earlier proofs. We believe these proofs are easier to teach in Computer Science courses.
The classical version of B\'ezout's Theorem gives an integer-valued count of the intersection points of hypersurfaces in projective space over an algebraically closed field. Using work of Kass and Wickelgren, we prove a version of…
We develop the method of averaging in Clifford (geometric) algebras suggested by the author in previous papers. We consider operators constructed using two different sets of anticommuting elements of real or complexified Clifford algebras.…
What is the best representation for doing euclidean geometry on computers? These notes from a SIGGRAPH 2019 short course entitled "Geometric algebra for computer graphics" introduce projective geometric algebra (PGA) as a modern framework…
Fast quantum algorithms can solve important computational problems more efficiently than classical algorithms. However, little is known about whether quantum computing can speed up solving geometric problems. This article explores quantum…
In this paper we study the notion of Gerghaty type contractive mapping via simulation function along with $\mathcal{C}$-class functions and prove the existence of several fixed point results in ordinary and partially ordered metric spaces.…
The aim of this article is to show, how computer algebra can be used when applying Liu's procedure. Although Mathematica (a commercial product by Wolfram Research Inc.) is used, it is possible to use other computer algebra systems as well.
In this paper, the geometric approach to the virial theorem developed in \cite{CFR12} is written in terms of quasi-velocities (see \cite{CNCS07}). A generalization of the virial theorem for mechanical systems on Lie algebroids is also…
Vertex algebras (and their modules) can be described as vector spaces together with a linear operator-valued series in one parameter $z$. With the interpretation of $z$ as a coordinate at a point on a curve, one can construct algebraic…
The Hilbert metric is a distance function defined for points lying within a convex body. It generalizes the Cayley-Klein model of hyperbolic geometry to any convex set, and it has numerous applications in the analysis and processing of…
Computability theory is a discipline in the intersection of computer science and mathematical logic where the fundamental question is: given two mathematical objects X and Y, does X compute Y in principle? In case X and Y are real numbers,…
Machine learning and data mining techniques are effective tools to classify large amounts of data. But they tend to preserve any inherent bias in the data, for example, with regards to gender or race. Removing such bias from data or the…
We consider constrained Horn clause solving from the more general point of view of solving formula equations. Constrained Horn clauses correspond to the subclass of Horn formula equations. We state and prove a fixed-point theorem for Horn…
Plane-based Geometric Algebra (PGA) has revealed points in a $d$-dimensional pseudo-Euclidean space $\mathbb{R}_{p,q,1}$ to be represented by $d$-blades rather than vectors. This discovery allows points to be factored into $d$ orthogonal…