Related papers: Computing the First Betti Numberand Describing the…
A self-learning algebraic multigrid method for dominant and minimal singular triplets and eigenpairs is described. The method consists of two multilevel phases. In the first, multiplicative phase (setup phase), tentative singular triplets…
We present numerical upscaling techniques for a class of linear second-order self-adjoint elliptic partial differential operators (or their high-resolution finite element discretization). As prototypes for the application of our theory we…
To obtain the Dirichlet series for complex powers of the Riemann zeta function, we define and study the basic properties of a sequence of polynomials that, used as coefficients of the respective terms of the Dirichlet series of the Riemann…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
We introduce the notion of a partial Betti splitting of a homogeneous ideal, generalizing the notion of a Betti splitting first given by Francisco, H\`a, and Van Tuyl. Given a homogeneous ideal $I$ and two ideals $J$ and $K$ such that $I =…
An efficient algorithm for computing eigenvectors of a matrix of integers by exact computation is proposed. The components of calculated eigenvectors are expressed as polynomials in the eigenvalue to which the eigenvector is associated, as…
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:…
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…
First-order logic is a natural way of expressing properties of computation. It is traditionally used in various program logics for expressing the correctness properties and certificates. Although such representations are expressive for some…
As far as we know, usual computer algebra packages can not compute denumerants for almost medium (about a hundred digits) or almost medium--large (about a thousand digits) input data in a reasonably time cost on an ordinary computer.…
We associate a sequence of positive integers, termed the type sequence, with a cochordal graph. Using this type sequence, we compute all graded Betti numbers of its edge ideal. We then classify all positive integer $n$ such that the zero…
For each algebraic number $\alpha$ and each positive real number $t$, the $t$-metric Mahler measure $m_t(\alpha)$ creates an extremal problem whose solution varies depending on the value of $t$. The second author studied the points $t$ at…
We explore the combination of deterministic and Monte Carlo methods to facilitate efficient automatic numerical computation of multidimensional integrals with singular integrands. Two adaptive algorithms are presented that employ recursion…
We study Kahler manifolds-with-boundary, not necessarily compact, with weakly pseudoconvex boundary, each component of which is compact. If such a manifold $K$ has $l\ge2$ boundary components (possibly $l=\infty$), then it has first betti…
Computing a basis for the exponent lattice of algebraic numbers is a basic problem in the field of computational number theory with applications to many other areas. The main cost of a well-known algorithm…
Simplification of fractional powers of positive rational numbers and of sums, products and powers of such numbers is taught in beginning algebra. Such numbers can often be expressed in many ways, as this article discusses in some detail.…
In the paper, the author elementarily unifies and generalizes eight identities involving the functions $\frac{\pm1}{e^{\pm t}-1}$ and their derivatives. By one of these identities, the author establishes two explicit formulae for computing…
We present algorithms for computing weakly singular and near-singular integrals arising when solving the 3D Helmholtz equation with curved boundary elements. These are based on the computation of the preimage of the singularity in the…
We provide a simple method to compute the Betti numbers if the Stanley-Reisner ideal of a simplicial tree and its Alexander dual.
We provide a new way to represent numerical semigroups by showing that the position of every Ap\'ery set of a numerical semigroup $S$ in the enumeration of the elements of $S$ is unique, and that $S$ can be re-constructed from this…