A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
New Landsberg metrics found without being Berwaldian.
Recently examples of Riemannian homogeneous spaces with linear Jacobi relations were found. We calculate the Singer invariants of these spaces with the computer algebra program Maple and discuss the results by means of the Jet Isomorphism Theorem of pseudo-Riemannian geometry.
We present a MAPLE program for the explicit computation of the curvature of calibrated ordinary webs in codimension one in any dimension (recall that all planar webs are calibrated and ordinary). The vanishing of this curvature means the maximality of the rank. We give some first examples.
Algorithms are described and Maple implementations are provided for finding all quandles of order , as well as computing all homomorphisms between two finite quandles or from a finitely presented quandle (e.g., a knot quandle) to a finite quandle, computing the automorphism group of a finite quandle, etc. Several of…
State-sum invariants for knotted curves and surfaces using quandle cohomology were introduced by Laurel Langford and the authors in math.GT/9903135 In this paper we present methods to compute the invariants and sample computations. Computer calculations of cohomological dimensions for some quandles are presented. For c…
In the previous work, the notion of the Finsleroid--Finsler space have been formulated and the necessary and sufficient conditions for the space to be of the Landsberg type have been found. In the present paper, starting with particular spray coefficients, we demonstrate how the Landsberg condition can explicitly appea…
We describe a way of representing finite biquandles with n elements as 2n x 2n block matrices. Any finite biquandle defines an invariant of virtual knots through counting homomorphisms. The counting invariants of non-quandle biquandles can reveal information not present in the knot quandle, such as the non-triviality o…
Model interpretability is an increasingly important component of practical machine learning. Some of the most common forms of interpretability systems are example-based, local, and global explanations. One of the main challenges in interpretability is designing explanation systems that can capture aspects of each of th…
In this paper, we define, from a finite set E of functions, a family of holomorphic webs of codimension one in any dimension . We prove that it is sufficient to check a finite number of conditions for these webs to be all ordinary and to have all maximal rank. Moreover, these conditions may be prac…
The aim of this paper is mainly, after some theoretical explanations, to provide a program on Maple for computing, whatever be d, the curvature of the planar d-web implicitely defined by a differential equation F(x,y,y')=0, F being polynomial of degree d with respect to y'. Moreover, we prove in the appendix a "concent…
We describe an algorithm for determining whether a finite quandle is isomorphic to an Alexander quandle by finding all possible Alexander presentations of the quandle. We give an implementation of this algorithm in Maple.
New method uses quandle rings to distinguish knots and their mirrors.
The 2-bridge knots are a family of knots with bridge number 2. In this paper, we compute the Kauffman polynomials of 2-bridge knots using the Kauffman skein theory and linear algebra techniques. Our calculation can be easily carried out using Mathematica, Maple, Mathcad, etc.
Investigates locally symmetric polynomial metrics in Riemannian and Finslerian surfaces.
Study extremal trajectories of a rolling disk using geometric control theory.
The paper defines and characterizes 2-Ruled hypersurfaces in Minkowski 4-space using octonions.
A method of computing a basis for the second Yang-Baxter cohomology of a finite biquandle with coefficients in Q and Z_p from a matrix presentation of the finite biquandle is described. We also describe a method for computing the Yang-Baxter cocycle invariants of an oriented knot or link represented as a signed Gauss c…
We present a set of 26 finite quandles that distinguish (up to reversal and mirror image) by number of colorings, all of the 2977 prime oriented knots with up to 12 crossings. We also show that 1058 of these knots can be distinguished from their mirror images by the number of colorings by quandles from a certain set of…
In this article we give necessary and sufficient conditions for an irreducible Kähler C-space with to have nonnegative or positive quadratic bisectional curvature, assuming the space is not Hermitian symmetric. In the cases of the five exceptional Lie groups , the computer package MAPLE…
Using Maple, we compute some analytical solutions of a modified Black-Scholes equation, recently proposed, in the case of the European put option. We show that the modified Black-Scholes equation with the European put option is exactly solvable in terms of associated Laguerre polynomials. We make some numerical experim…
The curvature of web curves is studied in 3D manifolds.
A systematic algorithm for building integrating factors of the form mu(x,y') or mu(y,y') for non-linear second order ODEs is presented. When such an integrating factor exists, the algorithm determines it without solving any differential equations. Examples of ODEs not having point symmetries are shown to be solvable us…
Paper finds maximum curvature of Bézier-spline curves.
Complete classification of Deligne-Mostow lattice representations into PGL(3,C).
This note (originally from 2015) provides a proof of a 1985 conjecture of Montiel and Ros concerning the conformal volume of tori. This updated version adds a proof of the claim made in Remark 5 about the value of the conformal volume of tori in the cases not covered by the conjecture of Montiel and Ros. Originally, I …
Algorithms compute the topology of hyperelliptic curves in 2D and 3D.
Researchers found a new exact solution for pricing Aunt Michaela options using modified Black-Scholes equation.
We prove that the automorphism group of the dihedral quandle with n elements is isomorphic to the affine group of the integers mod n, and also obtain the inner automorphism group of this quandle. In [9], automorphism groups of quandles (up to isomorphisms) of order less than or equal to 5 were given. With the help of t…
We present and implement two algorithms for analytic asymptotic evaluation of the marginal likelihood of data given a Bayesian network with hidden nodes. As shown by previous work, this evaluation is particularly hard for latent Bayesian network models, namely networks that include hidden variables, where asymptotic ap…
Study minimal and CMC tori in spheres and their duals.
We perform detailed computations of Lie algebras of infinitesimal CR-automorphisms associated to three specific model real analytic CR-generic submanifolds in C^9 by employing differential algebra computer tools -- mostly within the Maple package DifferentialAlgebra -- in order to automate the handling of the arising h…
The paper analyzes Lie symmetries in a specific geometric context.
The local geometry of a Riemannian symmetric space is described completely by the Riemannian metric and the Riemannian curvature tensor of the space. In the present article I describe how to compute these tensors for any Riemannian symmetric space from the Satake diagram, in a way that is suited for the use with comput…
The book "Handbook of Finsler geometry" has been included with a CD containing an elegant Maple package, FINSLER, for calculations in Finsler geometry. Using this package, an example concerning a Finsler generalization of Einstein's vacuum field equations was treated. In this example, the calculation of the components …
New method detects projective equivalences and symmetries in rational 3D curves.
SED integrates synthesis, execution, and debugging for neural program synthesis.
Stochastic programs simplify complex models with noise and nondeterminism.
Deployable probabilistic programming for Go and other languages.
Extends program induction for probabilistic programming.
Improves probabilistic programming by analyzing program structure.
A neural program synthesis method with iterative fix operations.
Paper introduces techniques to learn higher-order programs, improving predictive accuracy and reducing learning times.
We consider the significant class of holomorphically nondegenerate CR manifolds of finite type that are represented by some weighted homogeneous polynomials and we derive some useful features which enable us to set up a fast effective algorithm to compute their Lie algebras of infinitesimal CR-automorphisms. This algor…
Graph-based approach repairs programs from diagnostic feedback.
Neural model guides PBE problem solving in programming.
COSET benchmarks neural program embeddings using diverse source-code datasets.
SPoC uses search to translate pseudocode into correct programs with error localization.
Machine learning improves Buchberger's algorithm for polynomial systems.