Related papers: Arithmetic matrices for number fields I
We propose a numerical method based on the master field for large-$N$ reduced matrix models. While the master field is originally an infinite-dimensional matrix, in this method it is regularized to a finite dimension, with the requirement…
In this study, new master theorems and general formulas of integrals are presented and implemented to solve some complicated applications in different fields of science. The proposed theorems are considered to be generators of new problems,…
Let $K$ be a number field of degree $n$ with ring of integers $O_K$. By means of a criterion of Gilmer for polynomially dense subsets of the ring of integers of a number field, we show that, if $h\in K[X]$ maps every element of $O_K$ of…
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform several modular operations with machine integer or floating point…
We consider the interpolation problem with the inverse multiquadric radial basis function. The problem usually produces a large dense linear system that has to be solved by iterative methods. The efficiency of such methods is strictly…
In addition to rather complicated general methods it is interesting and valuable to develop fast efficient methods for calculating generators of power integral bases in special types of number fields. We consider sextic fields containing a…
In this article algebraic constructions are introduced in order to study the variety defined by a radical parametrization (a tuple of functions involving complex numbers, $n$ variables, the four field operations and radical extractions). We…
We develop basic notions and methods of algebraic geometry over the algebraic objects called hyperrings. Roughly speaking, hyperrings generalize rings in such a way that an addition is `multi-valued'. This paper largely consisits of two…
We characterize completey (give a necessary and suffcient condition using special neat embeddings)for a relation algebra to belong to the amalgamation, strong amalgamation, and superamalgamation base of the class of representable algebras.…
To every integer monic polynomial of degree m can be associated m integer sequences having interesting properties to the roots of the polynomial. These sequences can be used to find the real roots of any integer monic polynomial by using…
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.…
We study associative multiplications in semi-simple associative algebras over C compatible with the usual one. An interesting class of such multiplications is related to the affine Dynkin diagrams of A, D, E-type. In this paper we…
The method of brackets is a method for the evaluation of definite integrals based on a small number of rules. This is employed here for the evaluation of Mellin-Barnes integral. The fundamental idea is to transform these integral…
We study the real algebraic variety of real symmetric matrices with eigenvalue multiplicities determined by a partition. We present formulas for the dimension and Euclidean distance degree. We give a parametrization by rational functions.…
We initiate the complexity theoretic study of the problem of computing the bits of (real) algebraic numbers. This extends the work of Yap on computing the bits of transcendental numbers like \pi, in Logspace. Our main result is that…
Algebraic statistics uses tools from algebra (especially from multilinear algebra, commutative algebra and computational algebra), geometry and combinatorics to provide insight into knotty problems in mathematical statistics. In this survey…
In this paper we give necessary and sufficient trace conditions for an n by n matrix over any commutative and associative ring with unity to be a sum of k-th powers of matrices over that ring, where n,k are integers greater equal 2. We…
An oriented graph is said positively multiplicative when its adjacency matrix $A$ embeds in a matrix algebra admitting a basis $\mathsf{B}$ with nonnegative structure constants in which the matrix of the multiplication by $A$ coincides with…
We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…
Multiplying matrices is among the most fundamental and compute-intensive operations in machine learning. Consequently, there has been significant work on efficiently approximating matrix multiplies. We introduce a learning-based algorithm…