Related papers: An algorithm to compute a presentation of pushforw…
In this paper we explore and expand the connection between two modern descriptions of scattering amplitudes, the CHY formalism and the framework of positive geometries, facilitated by the scattering equations. For theories in the CHY family…
We present a new Monte Carlo muon propagation algorithm MUM (MUons+Medium) which possesses some advantages over analogous algorithms presently in use. The most important features of algorithm are described. Results on the test for accuracy…
The well-founded semantics is one of the most widely studied and used semantics of logic programs with negation. In the case of finite propositional programs, it can be computed in polynomial time, more specifically, in O(|At(P)|size(P))…
I present a simple dynamic programming algorithm for the evaluation of operators in a wide range of superconformal algebras. Special care is taken to describe the computation of the Gram matrix. A Mathematica package, Weaver.m, is provided…
The current Bayesian FFT algorithm relies on direct differentiation to obtain the posterior covariance matrix (PCM), which is time-consuming, memory-intensive, and hard to code, especially for the multi-setup operational modal analysis…
We present and discuss an algorithm and its implementation that is capable of directly determining Fourier expansions of any vector-valued modular form of weight at least $2$ associated with representations whose kernel is a congruence…
This paper presents a quantum algorithm for solving the fractional Poisson equation \((-\Delta)^s u = f\) with \(s \in (0,1)\) on bounded domains. The proposed approach combines rational approximation techniques with quantum linear system…
Let f be a map-germ of corank 1 from complex n-space to complex (n+1)-space, and, for k less than or equal to the multiplicity of f, let $D^k(f)$ be its k'th multiple-point scheme -- the closure of the set of ordered k-tuples of pairwise…
The Moran process on graphs is a popular model to study the dynamics of evolution in a spatially structured population. Exact analytical solutions for the fixation probability and time of a new mutant have been found for only a few classes…
We give an overview of the existing algorithms to compute nonunique factorization invariants in finitely generated monoids.
This paper develops a functional-analytic framework for approximating the push-forward induced by an analytic map from finitely many samples. Instead of working directly with the map, we study the push-forward on the space of locally…
Let $M(n)$ denote the number of distinct entries in the $n \times n$ multiplication table. The function $M(n)$ has been studied by Erd\H{o}s, Tenenbaum, Ford, and others, but the asymptotic behaviour of $M(n)$ as $n \to \infty$ is not known…
We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…
The goal of this paper is to explicitly detect all the arithmetic genera of arithmetically Cohen-Macaulay projective curves with a given degree $d$. It is well-known that the arithmetic genus $g$ of a curve $C$ can be easily deduced from…
This paper proposes an algorithm called Forward Composition Propagation (FCP) to explain the predictions of feed-forward neural networks operating on structured classification problems. In the proposed FCP algorithm, each neuron is…
Given a germ of holomorphic map $f$ from $\mathbb C^n$ to $\mathbb C^{n+1}$, we define a module $M(f)$ whose dimension over $\mathbb C$ is an upper bound for the $\mathscr A$-codimension of $f$, with equality if $f$ is weighted homogeneous.…
In this article we present a parallel modular algorithm to compute all solutions with multiplicities of a given zero-dimensional polynomial system of equations over the rationals. In fact, we compute a triangular decomposition using…
Finance is one of the promising field for industrial application of quantum computing. In particular, quantum algorithms for calculation of risk measures such as the value at risk and the conditional value at risk of a credit portfolio have…
We present an efficient and parsimonious algorithm to solve mixed initial/final-value problems. The algorithm optimally limits the memory storage and the computational time requirements: with respect to a simple forward integration, the…
We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)\times (N-1)$ matrix (depth is $O(N^2\log N)$) which is a simple modification of the algorithm for calculating the determinant…