Related papers: Computing global Ext for complexes
We present an algorithm for approximating linear categories of partitions (of sets). We report on concrete computer experiments based on this algorithm which we used to obtain first examples of so-called non-easy linear categories of…
Several important cases of vector bundles with extra structure (such as Higgs bundles and triples) may be regarded as examples of twisted representations of a finite quiver in the category of sheaves of modules on a variety/manifold/ringed…
We describe the Macaulay2 package TateOnProducts and its capabilities, which include computing cohomology tables and Beilinson monads of sheaves on products of projective spaces and the derived category pushForward of a sheaf under a…
Shapley-related techniques have gained attention as both global and local interpretation tools because of their desirable properties. However, their computation using conditional expectations is computationally expensive. Approximation…
We present an algorithm to compute the torsion component $\mathrm{Pic}^\tau X$ of the Picard scheme of a smooth projective variety $X$ over a field $k$. Specifically, we describe $\mathrm{Pic}^\tau X$ as a closed subscheme of a projective…
We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…
The main purpose of this paper is to develop new algorithms for computing invariant rings in a general setting. This includes invariants of nonreductive groups but also of groups acting on algebras over certain rings. In particular, we…
Complex braid groups are the natural generalizations of braid groups associated to arbitrary (finite) complex reflection groups. We investigate several methods for computing the homology of these groups. In particular, we get the Poincar\'e…
The topic of this thesis is the development of a versatile and geometrically motivated differential calculus on non-commutative or quantum spaces, providing powerful but easy-to-use mathematical tools for applications in physics and related…
We introduce an ensemble learning scheme for community detection in complex networks. The scheme uses a Machine Learning algorithmic paradigm we call Extremal Ensemble Learning. It uses iterative extremal updating of an ensemble of network…
This paper considers the problem of distributed estimation in an incremental network when the measurements taken by the node follow a widely linear model. The proposed algorithm which we refer to it as incremental augmented affine…
We find new constructions of infinite families of skew Hadamard difference sets in elementary abelian groups under the assumption of the existence of cyclotomic strongly regular graphs. Our construction is based on choosing cyclotomic…
The Witt group of a smooth curve over a real closed field is explicitely calculated. The method uses a comparison theorem between the graded Witt group and the etale cohomology groups. In the second part of the paper, the torsion Picard…
We provide a general method for computing rational Chow rings of moduli of smooth complete intersections. We specialize this result in different ways: to compute the integral Picard group of the associated stack ; to obtain an explicit…
Stable computational algorithms for the approximate solution of the Cauchy problem for nonstationary problems are based on implicit time approximations. Computational costs for boundary value problems for systems of coupled multidimensional…
In 1990, D.Snow proposed an effective algorithm for computing the orbits of finite Weyl groups. Snow's algorithm is designed for computation of weights, $W$-orbits and elements of the Weyl group. An extension of Snow's algorithm is…
We present generating functions for extensions of multiplicative invariants of wreath symmetric products of orbifolds presented as the quotient by the locally free action of a compact, connected Lie group in terms of orbifold sector…
We propose an explicit and practical algorithm for computing Galois conjugates and irreducible polynomials for special values of modular functions evaluated at CM points associated with imaginary quadratic orders. Our approach builds upon…
We introduce equivariant Chow-Witt groups in order to define Chow-Witt groups of quotient stacks. We compute the Chow-Witt ring of the moduli stack of stable (resp. smooth) elliptic curves, providing a geometric interpretation of the new…
Deep Ensembles are a simple, reliable, and effective method of improving both the predictive performance and uncertainty estimates of deep learning approaches. However, they are widely criticised as being computationally expensive, due to…