Related papers: Ideal Class Group Algorithms in the Ring of Integr…
We study quadratic forms over totally real number fields by using an associated ring of quaternions. We examine some properties of residue class rings of these quaternions and use geometry of numbers to prove that certain ideals of the ring…
Given a number field $K$ that is a subfield of the real numbers, we generalize the notion of the classical Frobenius problem to the ring of integers $\mathfrak{O}_K$ of $K$ by describing certain Frobenius semigroups,…
The ring of periodic distributions on ${\mathbb{R}}^{\tt d}$ with usual addition and with convolution is considered. Via Fourier series expansions, this ring is isomorphic to the ring ${\mathcal{S}}'({\mathbb{Z}}^{\tt d})$ of all maps…
In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…
We study the number of generators of ideals in regular rings and ask the question whether $\mu(I)<\mu(I^2)$ if $I$ is not a principal ideal, where $\mu(J)$ denotes the number of generators of an ideal $J$. We provide lower bounds for the…
In this paper similarity classes of three by three matrices over a local principal ideal commutative ring are analyzed. When the residue field is finite, a generating function for the number of similarity classes for all finite quotients of…
Using an extension of the abundancy index to imaginary quadratic rings that are unique factorization domains, we investigate what we call $n$-powerfully $t$-perfect numbers in these rings. This definition serves to extend the concept of…
Here we initiate a program to study relationships between finite groups and arithmetic-geometric invariants in a systematic way. To do this we first introduce a notion of optimal module for a finite group in the setting of holomorphic mock…
We present in this paper a routine which construct the ideal generated by a list of elements in a matrix Lie algebra at any particular characteristic. We have used this algorithm to analyze the problem of the simplicity of some Lie…
We produce a family of complexes called trimming complexes and explore applications. We study how trimming complexes can be used to deduce the Betti table for the minimal free resolution of the ideal generated by subsets of a generating set…
For a group $G$, N-series $\cal G$ of $G$ and commutative ring $R$ let $I^n_{R,\cal G}(G)$, $n\ge 0$, denote the filtration of the group algebra $R(G)$ induced by $\cal G$, and $I_R(G)$ its augmentation ideal. For subgroups $H$ of $G$, left…
Computing well-rounded twists of ideals in number fields has been done when the field degree is $2$. In this paper, we develop a new algorithm to detect whether a basis of an ideal $\mathfrak{I}$ in a cyclic cubic field $F$ yields a…
Circulant matrices are an important tool widely used in coding theory and cryptography. A circulant matrix is a square matrix whose rows are the cyclic shifts of the first row. Such a matrix can be efficiently stored in memory because it is…
We introduce the Colombeau Quaternio Algebra and study its algebraic structure. We also study the dense ideal, dense in the algebraic sense, of the algebra of Colombeau generalized numbers and use this show the existence of a maximal ting…
Heisenberg groups over algebras with central involution and their automorphism groups are constructed. The complex quaternion group algebra over a prime field is used as an example. Its subspaces provide finite models for each of the real…
In a Dedekind domain $D$, every non-zero proper ideal $A$ factors as a product $A=P_1^{t_1}\cdots P_k^{t_k}$ of powers of distinct prime ideals $P_i$. For a Dedekind domain $D$, the $D$-modules $D/P_i^{t_i}$ are uniserial. We extend this…
The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…
In this paper, we investigate the row-factorization matrices of Arf numerical semigroups, and we provide the full list of such matrices of certain Arf numerical semigroups. We use the information of row-factorization matrices to detect the…
Some more general "inheritance conditions" have been found for a given set of symmetry generators $\{\mathbf{Z}_{\bar{l}}\}$ acting on some set of coupled ordinary differential equations, once the "first integration method" has been applied…
A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint rectangles, such that no four rectangles meet in a point. In this work we present a versatile algorithmic framework for exhaustively generating a…