相关论文: Fast algorithm for border bases of Artinian Gorens…
We establish a novel connection between the central binomial coefficients $\binom{2n}{n}$ and Gould's sequence through the construction of a specialized multivariate polynomial quotient ring. Our ring structure is characterized by ideals…
We present two conjectures regarding the running time of computing symmetric factorizations for a Hankel matrix $\mathbf{H}$ and its inverse $\mathbf{H}^{-1}$ as $\mathbf{B}\mathbf{B}^*$ under fixed-point arithmetic. If solved, these would…
We describe an algorithm for obtaining generators of the unit group of the integral group ring ZG of a finite abelian group G. We used our implementation in Magma of this algorithm to compute the unit groups of ZG for G of order up to 110.…
We study a class of arrangements of lines with multiplicities on the plane which admit the Chalykh-Veselov Baker-Akhiezer function. These arrangements are obtained by adding multiplicity one lines in an invariant way to any dihedral…
The standard application of the Lehmann-Goerisch method for lower bounds on eigenvalues of symmetric elliptic second-order partial differential operators relies on determination of fluxes $\sigma_i$ that approximate co-gradients of exact…
Large scale tensors, including large scale Hankel tensors, have many applications in science and engineering. In this paper, we propose an inexact curvilinear search optimization method to compute Z- and H-eigenvalues of $m$th order $n$…
The Somos 4 sequences are a family of sequences satisfying a fourth order bilinear recurrence relation. In recent work, one of us has proved that the general term in such sequences can be expressed in terms of the Weierstrass sigma function…
Using the resolution quiver for a connected Nakayama algebra, a fast algorithm is given to decide whether its global dimension is finite or not and whether it is Gorenstein or not. The latter strengthens a result of Ringel.
Gaussian kernels can be an efficient and accurate tool for multivariate interpolation. In practice, high accuracies are often achieved in the flat limit where the interpolation matrix becomes increasingly ill-conditioned. Stable evaluation…
Gr\"{o}bner bases are nowadays central tools for solving various problems in commutative algebra and algebraic geometry. A typical use of Gr\"{o}bner bases is the multivariate polynomial system solving, which enables us to construct…
We study commutative algebras with Gorenstein duality, i.e. algebras $A$ equipped with a non-degenerate bilinear pairing such that $\langle ac,b\rangle=\langle a,bc\rangle$ for any $a,b,c\in A$. If an algebra $A$ is Artinian, such pairing…
In this work, we consider the reformulation of hierarchical ($\mathcal{H}$) matrix algorithms for many-core processors with a model implementation on graphics processing units (GPUs). $\mathcal{H}$ matrices approximate specific dense…
Solving and visualizing the potential roots of complex functions is essential in both theoretical and applied domains, yet often computationally intensive. We present a hardware-accelerated algorithm for complex function roots density graph…
We use both Abel's lemma on summation by parts and Zeilberger's algorithm to find recurrence relations for definite summations. The role of Abel's lemma can be extended to the case of linear difference operators with polynomial…
We introduce a tensor network designed to faithfully simulate the AdS/CFT correspondence, akin to the multi-scale entanglement renormalization ansatz (MERA), following hyper-invariant tensor network. The proposed construction integrates…
In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond…
Approximate solutions to elliptic partial differential equations with known kernel can be obtained via the boundary element method (BEM) by discretizing the corresponding boundary integral operators and solving the resulting linear system…
We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…
We consider frames F in a given Hilbert space, and we show that every F may be obtained in a constructive way from a reproducing kernel and an orthonormal basis in an ambient Hilbert space. The construction is operator-theoretic, building…
This is the third paper in a series of three papers. The first two papers in the series are called "Artinian Gorenstein algebras with linear resolutions", (arXiv:1306.2523) and "The explicit minimal resolution constructed from a Macaulay…