Related papers: Computational algebra and algebraic curves
Algebraic statistics uses tools from algebra (especially from multilinear algebra, commutative algebra and computational algebra), geometry and combinatorics to provide insight into knotty problems in mathematical statistics. In this survey…
Machine learning has found its way into almost every area of science and engineering, and we are only at the beginning of its exploration across fields. Being a popular, versatile and powerful framework, machine learning has proven most…
The relationship between algebraic geometry and the inferential framework of the Bayesian Networks with hidden variables has now been fruitfully explored and exploited by a number of authors. More recently the algebraic formulation of…
The boundary of the convex hull of a compact algebraic curve in real 3-space defines a real algebraic surface. For general curves, that boundary surface is reducible, consisting of tritangent planes and a scroll of stationary bisecants. We…
There are many numerical methods for solving partial different equations (PDEs) on manifolds such as classical implicit, finite difference, finite element, and isogeometric analysis methods which aim at improving the interoperability…
One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed case that one would be wrong. In…
The enduring legacy of Euclidean geometry underpins classical machine learning, which, for decades, has been primarily developed for data lying in Euclidean space. Yet, modern machine learning increasingly encounters richly structured data…
We find a geometrical method of analysing the singularities of a plane nodal curve. The main results will be used in a forthcoming paper on geometric Plucker formulas for such curves. Plane nodal curves, that is plane curves having at most…
This article is an interdisciplinary review and an on-going progress report over the last few years made by myself and collaborators in certain fundamental subjects on two major theoretic branches in mathematics and theoretical physics:…
A general scheme for determining and studying integrable deformations of algebraic curves is presented. The method is illustrated with the analysis of the hyperelliptic case. An associated multi-Hamiltonian hierarchy of systems of…
The unique challenges associated with imaging a black hole motivated the development of new computational imaging algorithms. As the Event Horizon Telescope continues to expand, these algorithms will need to evolve to keep pace with the…
Here we briefly describe some topics along the lines of projective spaces and related geometric constructions connected to linear algebra, which provide fundamental examples in classical geometry and analysis.
Computational Epigraphy refers to the process of extracting text from stone inscription, transliteration, interpretation, and attribution with the aid of computational methods. Traditional epigraphy methods are time consuming, and tend to…
Many fundamental questions in theoretical computer science are naturally expressed as special cases of the following problem: Let $G$ be a complex reductive group, let $V$ be a $G$-module, and let $v,w$ be elements of $V$. Determine if $w$…
This paper proposes an algebraic view of trees which opens the doors to an alternative computational scheme with respect to classic algorithms. In particular, it is shown that this view is very well-suited for machine learning and…
Computational imaging has been playing a vital role in the development of natural sciences. Advances in sensory, information, and computer technologies have further extended the scope of influence of imaging, making digital images an…
Using von Neumann algebras, we extend the theory of quantum computation on a graph to a theory of computation on an arbitrary topological space.
We discuss a selection of recent developments in arithmetic combinatorics having to do with ``approximate algebraic structure'' together with some of their applications.
We argue that computation is an abstract algebraic concept, and a computer is a result of a morphism (a structure preserving map) from a finite universal semigroup.
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…