arXiv research

Paper proposes a visual tool for analyzing financial markets.

Rewriting theory applied to diagrammatic algebras for categorification.

System uses neural networks to prove program equivalence via rewrite rules.

Develops higher representation theory for odd Khovanov homology and rewriting theory.

Zipper logic is a graph rewrite system, consisting in only local rewrites on a class of zipper graphs. Connections with the chemlambda artificial chemistry and with knot diagrammatics based computation are explored in the article.

Graph neural networks can perform approximate reasoning in latent space for mathematical statements.

Extensive rewrite. Tables and proofs have been reformatted and/or rewritten for clarity.

Serenity optimizes neural network execution for edge devices by scheduling with optimal memory footprint.

This is a semi--expository update and rewrite of my 1974 AMS AMS Memoir describing Plancherel formulae and partial Dolbeault cohomology realizations for standard tempered representations for general real reductive Lie groups. Even after so many years, much of that Memoir is up to date, but of course there have been a n…

This is the author's Master's thesis written under the supervision of Dr. Gregor Weingart at the National Autonomous University of Mexico. The purpose of this study is to rewrite differential supergeometry in terms of classical differential geometry. This rewriting from "first principles" has two main motivations: 1 av…

Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive procedure for constructing van Kampen diagrams with respect to a canonical fini…

Paper introduces a new algorithm to detect LLM-generated text.

New basis and Schur-Weyl duality for loop Hecke algebra defined.

Search-based methods for hard combinatorial optimization are often guided by heuristics. Tuning heuristics in various conditions and situations is often time-consuming. In this paper, we propose NeuRewriter that learns a policy to pick heuristics and rewrite the local components of the current solution to iteratively i…

NIFTy.re accelerates imaging models and expands Gaussian processes and variational inference.

Rewriting history improves RL algorithms for solving multiple tasks.

We give definition of a holonomy flag in subRiemannian geometry --- a generalization of a Riemannian holonomy algebra --- and calculate it for the 3D subRiemannian Lie groups. We rewrite and give new interpretation for the Codazzi equations for the $(2,3)$-distributions on the $SU(2)$ and the Heisenberg group.

In this paper, a type of integrable evolution equation--the generalized Landau-Lifshitz equation into $S^n$ is considered. We deal with this equation from a geometric point of view by rewriting it in a geometric form. Through the geometric energy method, we show the global well-posedness of the corresponding Cauchy pro…

We create a 3-skeleton for a symmetric group's classifying space.

Reformulated Markov's conjecture in combinatorial terms.

We determine the Lyapunov spectrum of ball quotients arising from cyclic coverings. The computations are performed by rewriting the sum of Lyapunov exponents as ratios of intersection numbers and by the analysis of the period map near boundary divisors. As a corollary, we complete the classification of commensurability…

Unified approach for multicalibration in weakly supervised learning.

While accelerators such as GPUs have limited memory, deep neural networks are becoming larger and will not fit with the memory limitation of accelerators for training. We propose an approach to tackle this problem by rewriting the computational graph of a neural network, in which swap-out and swap-in operations are ins…

We consider normal almost contact structures on a Riemannian manifold and, through their associated sections of an ad-hoc twistor bundle, study their harmonicity, as sections or as maps. We rewrite these harmonicity equations in terms of the Riemann curvature tensor and find conditions relating the harmonicity of the a…

PaRoT simplifies robust training for deep neural networks.

We revisit the cohomological index theorem for elliptic elements in the universal enveloping algebra of a Lie groupoid previously proved by the authors. We prove a Thom isomorphism for Lie algebroids which enables us to rewrite the "topological side" of the index theorem. This results in index formulae for Lie groupoid…

In this note we study conformal Ricci flow introduced by Arthur Fischer. We use DeTurck's trick to rewrite conformal Ricci flow as a strong parabolic-elliptic partial differential equations. Then we prove short time existences for conformal Ricci flow on compact manifolds as well as on asymptotically flat manifolds. We…

In this work, we investigate the problem of finding surfaces in the Lorentz-Minkowski 3-space with prescribed skew ($S$) and mean ($H$) curvatures, which are defined through the discriminant of the characteristic polynomial of the shape operator and its trace, respectively. After showing that $H$ and $S$ can be interpr…

On most sponsored search platforms, advertisers bid on some keywords for their advertisements (ads). Given a search request, ad retrieval module rewrites the query into bidding keywords, and uses these keywords as keys to select Top N ads through inverted indexes. In this way, an ad will not be retrieved even if querie…

Existence proved for complex 3-folds equation on a specific phase range.

Mikhail Khovanov in math.QA/9908171 defined, for a diagram of an oriented classical link, a collection of groups numerated by pairs of integers. These groups were constructed as homology groups of certain chain complexes. The Euler characteristics of these complexes are coefficients of the Jones polynomial of the link.…

We propose two methods to obtain exact solutions for the Almgren-Chriss model about optimal execution of portfolio transactions. In the first method we rewrite the Almgren-Chriss equation and find two exact solutions. In the second method, employing a general reparametrized time, we show that the Almgren-Chriss equatio…

Viewing Dehn's algorithm as a rewriting system, we generalise to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to include nilpotent groups, many relatively hyperbolic groups including geometrically…

Extends Euler class formula to general connections with metric.

We reformulate ten-dimensional type II supergravity as a generalised geometrical analogue of Einstein gravity, defined by an $O(9,1)\times O(1,9)\subset O(10,10)\times\mathbb{R}^+$ structure on the generalised tangent space. Using the notion of generalised connection and torsion, we introduce the analogue of the Levi-C…

We consider the Dirac equation in flat Minkowski 3-space and rewrite it as the Maxwell equation in Minkowski 4-space with torsion. The torsion tensor is defined as the dual of the electromagnetic vector potential. Our model clearly distinguishes the electron and the positron without resorting to "negative frequencies":…

Researchers extend Gamma index theorem to non-compact spacetimes.

Study harmonicity of normal almost contact structures on Riemannian manifolds.

In this paper, we introduce a system called GamePad that can be used to explore the application of machine learning methods to theorem proving in the Coq proof assistant. Interactive theorem provers such as Coq enable users to construct machine-checkable proofs in a step-by-step manner. Hence, they provide an opportuni…

We model pseudo-Finsler geometries, with pseudo-Euclidean signatures of metrics, for two classes of four dimensional nonholonomic manifolds: a) tangent bundles with two dimensional base manifolds and b) pseudo-Riemannian/ Einstein manifolds. Such spacetimes are enabled with nonholonomic distributions and associated non…

The paper solves optimal control problems for stochastic delay equations.

Many machine learning algorithms minimize a regularized risk, and stochastic optimization is widely used for this task. When working with massive data, it is desirable to perform stochastic optimization in parallel. Unfortunately, many existing stochastic optimization algorithms cannot be parallelized efficiently. In t…

Corrects errors and completes missing parts in a paper on tangent cones.

AI agents manage portfolios, improving on human oversight.

While the fundamental object in Riemannian geometry is a metric, closed string theories call for us to put a two-form gauge field and a scalar dilaton on an equal footing with the metric. Here we propose a novel differential geometry which treats the three objects in a unified manner, manifests not only diffeomorphism …

New insights into using momentum for non-convex optimization.

Moving boundary problems allow to model systems with phase transition at an inner boundary. Driven by problems in economics and finance, in particular modeling of limit order books, we consider a stochastic and non-linear extension of the classical Stefan-problem in one space dimension, where the paths of the moving in…

Recently there has been renewed interest in the mapping-class group of a compact surface of genus $g \ge 2$ and also in its finite order elements. A finite order element of the mapping-class group will be a conformal automorphisms on some Riemann surface of genus $g$. Here we give the details of the proof that there is…