Related papers: Conley: Computing connection matrices in Maple

We introduce the notions of multiplier C*-category and continuous bundle of C*-categories, as the categorical analogues of the corresponding C*-algebraic notions. Every symmetric tensor C*-category with conjugates is a continuous bundle of…

A noncommutative algebra corresponding to the classical catenoid is introduced together with a differential calculus of derivations. We prove that there exists a unique metric and torsion-free connection that is compatible with the complex…

We show that the matrix embeddings in Bratteli diagrams are iterated direct sums of Hopf-Galois extensions (quantum principle bundles) for certain abelian groups. The corresponding strong universal connections are computed. We show that $…

The cohomology ring of a finite group, with coefficients in a finite field, can be computed by a machine, as Carlson has showed. Here "compute" means to find a presentation in terms of generators and relations, and involves only the…

Let G be a simple complex algebraic group. By using a notion of a G-category we define invariants of tangles with flat G-connections in their complements. We also show that quantized universal enveloping algebras at roots of unity provide…

We present the results of computation of cohomology for some Lie (super)algebras of Hamiltonian vector fields and related algebras. At present, the full cohomology rings for these algebras are not known even for the low dimensional vector…

This is a short introduction to categories with some emphasis on coalgebras. We start from introducing basic notions (categories, functors, natural transformations), move to Kleisli tripels and monads, with a short discussion of monads in…

Information technologies for studying physical-mathematical disciplines on base of mathematical modeling in the computer algebra system Maple are described.

We consider the notion of a connection on a module over a commutative ring, and recall the obstruction calculus for such connections. The obstruction calculus is defined using Hochschild cohomology. However, in order to compute with Grobner…

Barnette's Conjecture claims that all cubic, 3-connected, planar, bipartite graphs are Hamiltonian. We give a translation of this conjecture into the matching-theoretic setting. This allows us to relax the requirement of planarity to give…

This article represents a major step in the unification of the theory of algebraic, topological and singular transition matrices by introducing a definition which is a generalization that encompasses all of the previous three. When this…

We present a new method, involving monads and comonads from category theory, to help establish a certain type of equivalence of subcategories. As a case study we consider the category of topological gradings of $C^*$-algebras over a fixed…

In 1983 Kalai proved an incredible generalisation of Cayley's formula for the number of trees on a labelled vertex set to a formula for a class of $r$-dimensional simplicial complexes. These simplicial complexes generalise trees by means of…

We give a list of statements on the geometry of elliptic threefolds phrased only in the language of topology and homological algebra. Using only notions from topology and homological algebra, we recover existing results and prove new…

In arXiv:2407.11958, a moduli stack parametrizing $I$--indexed diagrams of Higgs bundles over a base stack $X$ was constructed for any finite simplicial set $I$, inspiring speculations about extending the non-Abelian Hodge correspondence to…

We describe our package PALP of C programs for calculations with lattice polytopes and applications to toric geometry, which is freely available on the internet. It contains routines for vertex and facet enumeration, computation of…

E. Sk\"oldberg's Morse Theory from an Algebraic Viewpoint and M. J\"ollenbeck's Algebraic Discrete Morse Theory and Applications to Commutative Algebra, which is the algebraic generalization of R. Forman's discrete Morse Theory for Cell…

We introduce the Brackets package for the computer algebra system Macaulay2, which provides convenient syntax for computations involving the classical invariants of the special linear group. We describe our implementation of bracket rings…

Connection calculi allow for very compact implementations of goal-directed proof search. We give an overview of our work related to connection tableaux calculi: First, we show optimised functional implementations of clausal and nonclausal…

For smooth families of projective algebraic curves, we extend the notion of intersection pairing of metrized line bundles to a pairing on line bundles with flat relative connections. In this setting, we prove the existence of a canonical…