Related papers: Arithmetic matrices for number fields I
We assume that every element of a matrix has a small, individual error, and model it by an external number, which is the sum of a nonstandard real number and a neutrix, the latter being a convex (external) set having the group property. The…
Number fields and their rings of integers, which generalize the rational numbers and the integers, are foundational objects in number theory. There are several computer algebra systems and databases concerned with the computational aspects…
Multiplication of polynomials is among key operations in computer algebra which plays important roles in developing techniques for other commonly used polynomial operations such as division, evaluation/interpolation, and factorization. In…
Let $n$ and $m$ be positive integers such that $n<m$. In this paper we compute the density of rectangular unimodular $n$ by $m$ matrices over the ring of algebraic integers of a number field.
We implement methods from the geometry of numbers to give explicit estimates for the number of integral ideals in a number field. We pay particular attention to minimising the effect of the degree $n$ of the number field on the error term…
The article considers arrowhead and diagonal-plus-rank-one matrices in F^(nxn) where F in R,C or H. H is a non-commutative field of quaternions. We give unified formulas for fast matrix-vector multiplications, determinants, and inverses for…
Any associative bilinear multiplication on the set of n-by-n matrices over some field of characteristic not two, that makes the same vectors orthogonal and has the same trace as ordinary matrix multiplication, must be ordinary matrix…
We consider the groups of regular circulant matrices over finite fields and integer residue class rings. In both cases we present a formula for the order of these groups. We also make a first step towards finding the algebraic structure of…
A representation of finite fields that has proved useful when implementing finite field arithmetic in hardware is based on an isomorphism between subrings and fields. In this paper, we present an unified formulation for multiplication in…
An integral basis of the simplest number fields of degree 3,4 and 6 over $\mathbb{Q}$ are well-known, and widely investigated. We generalize the simplest number fields to any degree, and show that an integral basis of these fields is…
In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has…
In this paper, we give an elementary proof of the additivity of the functional inverses of the resolvents of large $N$ random matrices, using recently developed matrix model techniques. This proof also gives a very natural generalization of…
We prove an asymptotic formula for the number of fixed rank matrices with integer coefficients over a number field K/Q and bounded norm. As an application, we derive an approximate Rogers integral formula for discrete sets of module…
We introduce a new approach to the classification of operator identities, based on basic concepts from the theory of algebraic operads together with computational commutative algebra applied to determinantal ideals of matrices over…
Integer programming is concerned with solving linear systems of equations over the non-negative integers. The basic question is to find a solution which minimizes a given linear objective function for a fixed right hand side. Here we also…
In this paper, we use elementary method to give a classification of the multiplicative maps on matrix algebra $M_{n}(\mF)$ over a field $\mF$ of characteristic $0$. All the multiplicative maps are classified into three classes: the trivial…
We arrange the orders in an algebraic number field in a tree. This tree can be used to enumerate all orders of bounded index in the maximal order as well as the orders over some given order.
Neural network models often face challenges when processing very small or very large numbers due to issues such as overflow, underflow, and unstable output variations. To mitigate these problems, we propose using embedding vectors for…
We provide a generalization of an algebraic linear combination for the trace of certain elliptic modular forms, and through specializing the expression at a suitable pair consisting of an elliptic curve over algebraic number fields and its…
We apply matrix methods to arithmetic functions by associating matrices to the functions in a manner drawn from the theory of symmetric functions. Then we study the characteristic polynomials of the associated matrices.