Related papers: Computer Algebra Algorithms for Special Functions …
We construct virtual fundamental classes on nested Hilbert schemes of points and curves in complex nonsingular projective surfaces. These classes recover the virtual classes of Seiberg-Witten theory as well as the (reduced) stable theory,…
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
There is developed a current algebra representation scheme for reconstructing algebraically factorized quantum Hamiltonian and symmetry operators in the Fock type space and its application to quantum Hamiltonian and symmetry operators in…
We revisit the MIC-harmonic oscillator in flat space with monopole interaction and derive the polynomial algebra satisfied by the integrals of motion and its energy spectrum using the ad hoc recurrence approach. We introduce a…
In this paper, we construct semisimple deformations for cyclotomic quiver Hecke-Clifford superalgebras of types $A^{(1)}_{s-1}$, $C^{(1)}_{s}$, $A^{(2)}_{2s}$, $D^{(2)}_{s}$. We derive a unified dimension formula for the bi-weight spaces…
We continue our study of the general theory of possibly nonselfadjoint algebras of operators on a Hilbert space, and modules over such algebras, developing a little more technology to connect `nonselfadjoint operator algebra' with the…
The celebrated Zeilberger algorithm which finds holonomic recurrence equations for definite sums of hypergeometric terms $F(n,k)$ is extended to certain nonhypergeometric terms. An expression $F(n,k)$ is called a hypergeometric term if both…
Closed formulas in terms of double sums of Clebsch-Gordan coefficients are computed for the evaluation of bra-ket spherical harmonic overlap integrals of a wide class of trigonometric functions. These analytical expressions can find useful…
We describe and prove correctness of two practical algorithms for finding indecomposable summands of finitely generated modules over a finitely generated k-algebra R. The first algorithm applies in the (multi)graded case, which enables the…
This is a discussion of miscellaneous summation, integration and transformation formulas obtained using Fourier analysis. The topics covered are: Series of the form $\sum_{n\in\mathbb{Z}} c_ne^{\pi i \gamma n^2}$; Fusion of integrals, and…
We investigate the question of studying spectral clustering in a Hilbert space where the set of points to cluster are drawn i.i.d. according to an unknown probability distribution whose support is a union of compact connected components. We…
We exploit transformations relating generalized $q$-series, infinite products, sums over integer partitions, and continued fractions, to find partition-theoretic formulas to compute the values of constants such as $\pi$, and to connect sums…
We introduce a new algorithm for complex image reconstruction with separate regularization of the image magnitude and phase. This optimization problem is interesting in many different image reconstruction contexts, although is nonconvex and…
We propose a taxonomy for quantum algorithms grounded in the fundamental symmetries, both continuous and discrete, underlying quantum state spaces, oracles, and circuit dynamics. By organizing algorithms according to their symmetry groups…
We present a series of algorithms for computing geometric and representation-theoretic invariants of Calogero-Moser spaces and rational Cherednik algebras associated to complex reflection groups. Especially, we are concerned with…
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification. Coalgebraic generality allows us to cover not only classical…
In this work numerical methods for solving Einstein's equations are developed and applied to the study of inhomogeneous cosmological models. A two-dimensional computer code is described which implements two advanced numerical methods:…
The inversion of linear systems is a fundamental step in many inverse problems. Computational challenges exist when trying to invert large linear systems, where limited computing resources mean that only part of the system can be kept in…
Summation by parts is used to find the sum of a finite series of generalized harmonic numbers involving a specific polynomial or rational function. The Euler-Maclaurin formula for sums of powers is used to find the sums of some finite…