相关论文: Fast algorithm for border bases of Artinian Gorens…

Let $G$ be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of $G$ and a bound on the Pr\"{u}fer rank of $G$. This yields in turn an algorithm to decide whether a finitely…

This paper is contributed to a fast algorithm for Hankel tensor-vector products. For this purpose, we first discuss a special class of Hankel tensors that can be diagonalized by the Fourier matrix, which is called \emph{anti-circulant}…

We propose a slightly revised Miller-Hagberg (MH) algorithm that efficiently generates a random network from a given expected degree sequence. The revision was to replace the approximated edge probability between a pair of nodes with a…

We list the so-called Askey-scheme of hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation and generating functions of all classes of orthogonal…

We consider fast kernel summations in high dimensions: given a large set of points in $d$ dimensions (with $d \gg 3$) and a pair-potential function (the {\em kernel} function), we compute a weighted sum of all pairwise kernel interactions…

We investigate the arithmetic nature of P-recursive sequences through the lens of their D-finite generating functions. Building on classical tools from differential algebra, we revisit the integrality criterion for Motzkin-type sequences…

Macaulay's Inverse System gives an effective method to construct Artinian Gorenstein k-algebras. To date a general structure for Gorenstein k-algebras of any dimension (and codimension) is not understood. In this paper we extend Macaulay's…

We present a generic algorithm for computing discrete logarithms in a finite abelian p-group H, improving the Pohlig-Hellman algorithm and its generalization to noncyclic groups by Teske. We then give a direct method to compute a basis for…

The efficiency of Gr\"obner basis computation, the standard engine for solving systems of polynomial equations, depends on the choice of monomial ordering. Despite a near-continuum of possible monomial orders, most implementations rely on…

In this article, we study and settle several structural questions concerning the exact solvability of the Olshanetsky-Perelomov quantum Hamiltonians corresponding to an arbitrary root system. We show that these operators can be written as…

What can be (machine) learned about the complexity of Buchberger's algorithm? Given a system of polynomials, Buchberger's algorithm computes a Gr\"obner basis of the ideal these polynomials generate using an iterative procedure based on…

In this paper we study those polynomials orthogonal with respect to a particular weight over the union of disjoint intervals first introduced by N.I. Akhiezer, via a reformulation as a matrix factorization or Riemann-Hilbert problem. This…

We present new algorithms for computing many faces in arrangements of lines and segments. Given a set $S$ of $n$ lines (resp., segments) and a set $P$ of $m$ points in the plane, the problem is to compute the faces of the arrangements of…

We construct 2-representations of quantum affine algebras from 2-representations of quantum Heisenberg algebras. The main tool in this construction are categorical vertex operators, which are certain complexes in a Heisenberg…

We present an algorithm to parallelize the inverse fast multipole method (IFMM), which is an approximate direct solver for dense linear systems. The parallel scheme is based on a greedy coloring algorithm, where two nodes in the hierarchy…

Recursive blocked algorithms have proven to be highly efficient at the numerical solution of the Sylvester matrix equation and its generalizations. In this work, we show that these algorithms extend in a seamless fashion to…

We construct a set $H$ of orthogonal polynomial sequences that contains all the families in the Askey scheme and the $q$-Askey scheme. The polynomial sequences in $H$ are solutions of a generalized first-order difference equation which is…

Since the beginning of the development of interior-point methods, there exists a puzzling gap between the results in theory and the observations in numerical experience, i.e., algorithms with good polynomial bound are not computationally…

The effect of a BULK marginal operator on BOUNDARY critical phenomena in two space-time dimensions is considered. The particular case of an open S=1/2 antiferromagnetic Heisenberg chain, corresponding to a Wess-Zumino-Witten non-linear…

Let $(R, \mathcal{M})$ be a local ring over a field $k$ with $k = R/\mathcal M$ and $J$ an ideal in $R$ such that $A =R/J$ is an Artinian Gorenstein (AG) $k$-algebra. In 1989, A. Iarrobino introduced the symmetric decomposition of the…