Related papers: A computer algorithm for the BGG resolution
We interpret the GL_n equivariant cohomology of a partial flag variety of flags of length N in \C^n as the Bethe algebra of a suitable gl_N[t] module associated with the tensor power (\C^N)^{\otimes n}.
We extend the methods developed in our earlier work to algorithmically compute the intersection cohomology Betti numbers of reductive varieties. These form a class of highly symmetric varieties that includes equivariant compactifications of…
We develop a generalized hybrid iterative approach for computing solutions to large-scale Bayesian inverse problems. We consider a hybrid algorithm based on the generalized Golub-Kahan bidiagonalization for computing Tikhonov regularized…
Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems, and solving large…
We present a variation of a quantum algorithm for the machine learning task of classification with graph-structured data. The algorithm implements a feature extraction strategy that is based on Gaussian boson sampling (GBS) a near term…
We compute the coherent cohomology of the structure sheaf of complex periplectic Grassmannians. In particular, we show that it can be decomposed as a tensor product of the singular cohomology ring of a Grassmannian for either the symplectic…
We compute the Hodge filtration on cohomology groups of complements of complex coordinate subspace arrangements. By means of this result we construct integral representations of holomorphic functions such that kernels of these…
We present algorithms used in the computational part of the article "Special homogeneous linear systems on Hirzebruch surfaces".
Conjugate gradient is an efficient algorithm for solving large sparse linear systems. It has been utilized to accelerate the computation in Bayesian analysis for many large-scale problems. This article discusses the applications of…
We provide new tools for the calculation of the torsion in the cohomology of congruence subgroups in the Bianchi groups : An algorithm for finding particularly useful fundamental domains, and an analysis of the equivariant spectral sequence…
In this paper, we give an algorithm to compute the hat version of the Heegaard Floer homology of a closed oriented three-manifold. This method also allows us to compute the filtrations coming from a null-homologous link in a three-manifold.
The graph isomorphism problem is theoretically interesting and also has many practical applications. The best known classical algorithms for graph isomorphism all run in time super-polynomial in the size of the graph in the worst case. An…
We prove that the Bredon homology or cohomology of the partition complex with fairly general coefficients is either trivial or computable in terms of constructions with the Steinberg module. The argument involves developing a theory of…
The formulation of the local BRST cohomology on infinite jet bundles and its relation and reduction to gauge covariant algebras are reviewed. As an illustration, we compute the local BRST cohomology for geodesic motion in (pseudo-)…
The spi-calculus is a formal model for the design and analysis of cryptographic protocols: many security properties, such as authentication and strong confidentiality, can be reduced to the verification of behavioural equivalences between…
Quantum computers can execute algorithms that sometimes dramatically outperform classical computation. Undoubtedly the best-known example of this is Shor's discovery of an efficient quantum algorithm for factoring integers, whereas the same…
We present an efficient method for the computation of homogenized coefficients of divergence-form operators with random coefficients. The approach is based on a multiscale representation of the homogenized coefficients. We then implement…
An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant…
Computer-generated holography (CGH) has broad applications such as direct-view display, virtual and augmented reality, as well as optical microscopy. CGH usually utilizes a spatial light modulator that displays a computer-generated phase…
In this paper we study the Bernstein-Gel'fand-Gel'fand (BGG) correspondence linking sheaves on a projective space to graded modules over an exterior algebra. We give an explicit construction of a Beilinson monad for a sheaf on projective…