Related papers: A computer algorithm for the BGG resolution
We give algorithms for the computation of the algebraic de Rham cohomology of open and closed algebraic sets inside projective space or other smooth complex toric varieties. The methods, which are based on Gr\"obner basis computations in…
We compute the sheaf cohomology with constant $\mathbb{Z}_2$ coefficients of a concrete class of locally profinite sets of independent interest. We introduce $k$-sheer partitions to aid in constructions. It is also shown that questions of…
We compute the sheaf homology of the intersection lattice of a hyperplane arrangement with coefficients in the graded exterior sheaf of the natural sheaf. This builds on the results of our previous paper, where this homology was computed…
We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…
We give algorithms of computing bases of logarithmic cohomology groups for square-free polynomials in two variables. (Fixed typos of v1)
We consider various iterative algorithms for solving the linear equation $ax=b$ using a quantum computer operating on the principle of quantum annealing. Assuming that the computer's output is described by the Boltzmann distribution, it is…
The purpose of this article is to show how one might compute the \'etale cohomology groups $H^p_{\acute{e}t}(X,G_m)$ in degrees $p=0$, $1$ and $2$ of a toric variety $X$ with coefficients in the sheaf of units. The method is to reduce the…
We describe a novel method for computing sheaf cohomology over weighted projective spaces and stacks using exterior algebra and differential module techniques, generalizing an algorithm due to Eisenbud-Fl\o ystad-Schreyer over projective…
An algorithm for the numerical inversion of large matrices, the biconjugate gradient algorithm (BGA), is investigated in view of its use for Monte Carlo simulations of fermionic field theories. It is compared with the usual conjugate…
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…
We design, implement, and evaluate GPU-based algorithms for the maximum cardinality matching problem in bipartite graphs. Such algorithms have a variety of applications in computer science, scientific computing, bioinformatics, and other…
We give an algorithm to compute the integer cohomology groups of any real partial flag manifold, by computing the incidence coefficients of the Schubert cells. For even flag manifolds we determine the integer cohomology groups, by proving…
Let $G$ be a simply connected solvable Lie group with a lattice $\Gamma$ and $N$ the nilradical of $G$. For a complex valued representation $\rho: G\to GL(V_{\rho})$ such that the restriction $\rho_{|_{N}}$ is unipotent, as an advanced…
This article is devoted to the analysis of the gauge-fixed BRST cohomology complex for a matrix model endowed with a $U(2)$-gauge symmetry. After a brief introduction on the BV construction and the gauge-fixing procedure in the setting of…
This article introduces an algorithm to compute the persistent homology of a filtered complex with various coefficient fields in a single matrix reduction. The algorithm is output-sensitive in the total number of distinct persistent…
The problem of solving a system of polynomial equations is one of the most fundamental problems in applied mathematics. Among them, the problem of solving a system of binomial equations form a important subclass for which specialized…
Information spread is an intriguing topic to study in network science, which investigates how information, influence, or contagion propagate through networks. Graph burning is a simplified deterministic model for how information spreads…
We compute numerically the homology of several graph complexes in low loop orders, extending previous results.
In this paper we derive an explicit version of the Bernstein-Gel'fand-Gel'fand (BGG) correspondence between bounded complexes of coherent sheaves on projective space and minimal doubly infinite free resolutions over its ``Koszul dual''…
In this article we present a method to implement orthogonal polynomials and many other special functions in Computer Algebra systems enabling the user to work with those functions appropriately, and in particular to verify different types…