Related papers: Computing Schur complexes
Complete Feynman diagram automatic computation systems are now coming of age after many years of development. They are made available to the high energy physics community through user-friendly interfaces. Theorists and experimentalists can…
By analogy with the classical (Chasles-Schubert-Semple-Tyrell) spaces of complete quadrics and complete collineations, we introduce the variety of complete complexes. Its points can be seen as equivalence classes of spectral sequences of a…
The category $\mathbf{XSq}$ of crossed squares is equivalent to the category $\mathbf{Cat2}$ of cat$^2$-groups. Functions for computing with these structures have been developed in the package $\mathsf{XMod}$ written using the…
Sheaf cohomology or, more generally, higher direct images of coherent sheaves along proper morphisms are central to modern algebraic geometry. However, the computation of these objects is a non-trivial and expensive task which easily…
Two method for computation of the spectra of certain infinite graphs are suggested. The first one can be viewed as a reversed Gram--Schmidt orthogonalization procedure. It relies heavily on the spectral theory of Jacobi matrices. The second…
We present some mathematical results concerning the strip projection method and a computer program for generating quasiperiodic packings of decagonal two shell-clusters.
A procedure to extend a superintegrable system into a new superintegrable one is systematically tested for the known systems on $\mathbb E^2$ and $\mathbb S^2$ and for a family of systems defined on constant curvature manifolds. The…
We present the singular Euler--Maclaurin expansion, a new method for the efficient computation of large singular sums that appear in long-range interacting systems in condensed matter and quantum physics. In contrast to the traditional…
We compute the equivariant cohomology of complex projective spaces associated to finite-dimensional representations of $C_2$, using ordinary cohomology graded on representations of the fundamental groupoid, with coefficients in the Burnside…
Bijections between invariants associated to indecomposable projective modules over some suitable Brauer configuration algebras and invariants associated to solutions of the Kronecker problem and the four subspace problem are used to…
In this note, we construct invariant and coinvariant Morse chain complexes with integer coefficients for any compact effective orbifold. We show that the homologies of these two chain complexes are invariants of the orbifold. We conjecture…
A stochastic dynamics framework for the study of complex systems is presented.
We describe a fast solver for linear systems with reconstructable Cauchy-like structure, which requires O(rn^2) floating point operations and O(rn) memory locations, where n is the size of the matrix and r its displacement rank. The solver…
A C# package is presented that allows a user for an input quantum circuit to generate a set of multivariate polynomials over the finite field Z_2 whose total number of solutions in Z_2 determines the output of the quantum computation…
An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems. As an example, it is…
We present the Julia package Manifolds$.$jl, providing a fast and easy-to-use library of Riemannian manifolds and Lie groups. This package enables working with data defined on a Riemannian manifold, such as the circle, the sphere, symmetric…
We define and study the notion of a minimal Cohen-Macaulay simplicial complex. We prove that any Cohen-Macaulay complex is shelled over a minimal one in our sense, and we give sufficient conditions for a complex to be minimal…
TopologicalNumbers.jl is an open-source Julia package designed to calculate topological invariants, mathematical quantities that characterize the properties of materials in condensed matter physics. These invariants, such as the Chern…
Zeilberger's enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply to many more permutation classes and describe the Maple package WILFPLUS,…
We compute numerically the homology of several graph complexes in low loop orders, extending previous results.