Related papers: A computer algorithm for the BGG resolution
We describe efficient algorithms to search for cases in which binomial coefficients are equal or almost equal, give a conjecturally complete list of all cases where two binomial coefficients differ by 1, and give some identities for…
Let $\mathbb{F}_q$ be a finite field. Given two irreducible polynomials $f,g$ over $\mathbb{F}_q$, with $\mathrm{deg} f$ dividing $\mathrm{deg} g$, the finite field embedding problem asks to compute an explicit description of a field…
We give an algorithm to compute inhomogeneous differential equations for definite integrals with parameters. The algorithm is based on the integration algorithm for $D$-modules by Oaku. Main tool in the algorithm is the Gr\"obner basis…
We present an algorithm to compute the Hecke operators on the equivariant cohomology of an arithmetic subgroup $\Gamma$ of the general linear group $\mathrm{GL}_n$. This includes $\mathrm{GL}_n$ over a number field or a finite-dimensional…
We apply the sheaf cohomology BGG method developed by the authors and Lachowska-Qi to the computation of Hochschild cohomology groups of various blocks of the small quantum group. All our computations of the center of the corresponding…
We describe a "cellular" approach to the computation of the cohomology of a poset with coefficients in a presheaf. A cellular cochain complex is constructed, described explicitly and shown to compute the cohomology under certain…
In this paper we study the computational feasibility of an algorithm to prove orbifold equivalence between potentials describing Landau-Ginzburg models. Through a comparison with leading results of Groebner basis computations in cryptology,…
In this paper, we provide two different resolutions of structural sheaves of projectivized tangent bundles of smooth complete intersections. These resolutions allow in particular to obtain convenient (and completely explicit) descriptions…
We recently proposed a new ensemble clustering algorithm for graphs (ECG) based on the concept of consensus clustering. We validated our approach by replicating a study comparing graph clustering algorithms over benchmark graphs, showing…
In this paper we analyze O'Hara's partition bijection. We present three type of results. First, we show that O'Hara's bijection can be viewed geometrically as a certain scissor congruence type result. Second, we obtain a number of new…
In this paper, we introduce the notion of BiHom-Lie conformal superalgebras. We develop its representation theory and define the cohomology group with coefficients in a module. Finally, we introduce conformal derivations of BiHom-Lie…
We present a new algorithm for computing the first discrete homology group of a graph. By testing the algorithm on different data sets of random graphs, we find that it significantly outperforms other known algorithms.
An abelian arrangement is a finite set of codimension one abelian subvarieties (possibly translated) in a complex abelian variety. In this paper, we study the cohomology of the complement of an abelian arrangement. For unimodular abelian…
We develop numerical algorithms for the efficient evaluation of quantities associated with generalized matrix functions [J. B. Hawkins and A. Ben-Israel, Linear and Multilinear Algebra 1(2), 1973, pp. 163-171]. Our algorithms are based on…
We proposed an algorithm that covers some cases of Hamilton Circuit Problem.
We study the $S_n$-equivariant log-concavity of the cohomology of flag varieties, also known as the coinvariant ring of $S_n$. Using the theory of representation stability, we give computer-assisted proofs of the equivariant log-concavity…
In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.
Bihom-associative algebras have been recently introduced in the study of group hom-categories. In this paper, we introduce a Hochschild type cohomology for bihom-associative algebras with suitable coefficients. The underlying cochain…
The analysis of digital images using homological procedures is an outstanding topic in the area of Computational Algebraic Topology. In this paper, we describe a certified reduction strategy to deal with digital images, but preserving their…
We give a formula for the cohomological invariants of a root stack, which we apply to compute the cohomological invariants and the Brauer group of the stack of admissible double coverings.