Related papers: Multiperfect Numbers in Certain Quadratic Rings

We prove that the Pythagoras number of the ring of integers of the compositum of all real quadratic fields is infinite. The same holds for certain infinite totally real cyclotomic fields. In contrast, we construct infinite degree totally…

We survey results on factorizations of non zero-divisors into atoms (irreducible elements) in noncommutative rings. The point of view in this survey is motivated by the commutative theory of non-unique factorizations. Topics covered include…

A $\lambda$-quiddity of size $n$ is an $n$-tuple of elements from a fixed set, which is a solution to a matrix equation that arises in the study of Coxeter's friezes. The study of these solutions involves in particular the use of a notion…

We describe all Mathieu-Zhao spaces of $k[x_1,\cdots,x_n]$ ($k$ is an algebraically closed field of characteristic zero) which contains an ideal of finite codimension. Furthermore we give an algorithm to decide if a subspace of the form…

Let $R$ be a commutative ring with identity and $S$ a multiplicative subset of $R$. In this paper, we first introduce and study the notions of $s$-pure exact sequences and $s$-absolutely pure modules which extend the classical notions of…

The aim of these notes is to study some of the structural aspects of the ring of arithmetical functions. We prove that this ring is neither Noetherian nor Artinian. Furthermore, we construct various types of prime ideals. We also give an…

We call an ideal in a polynomial ring robust if it can be minimally generated by a universal Gr\"obner basis. In this paper we show that robust toric ideals generated by quadrics are essentially determinantal. We then discuss two possible…

A perfect number is a number whose divisors add up to twice the number itself. The existence of odd perfect numbers is a millennia-old unsolved problem. This note proposes a proof of the nonexistence of odd perfect numbers. More generally,…

We show that $n$ is almost perfect if and only if $I(n) - 1 < D(n) \leq I(n)$, where $I(n)$ is the abundancy index of $n$ and $D(n)$ is the deficiency of $n$. This criterion is then extended to the case of integers $m$ satisfying $D(m)>1$.

We present a randomized polynomial-time algorithm to generate a random integer according to the distribution of norms of ideals at most N in any given number field, along with the factorization of the integer. Using this algorithm, we can…

A curious number is a palindromic number whose base ten representation has the form $a \ldots a b \ldots b a \ldots a$. In this paper, we determine all curious numbers that are perfect squares. Our proof involves reducing the search for…

Fix a quadratic order over the ring of integers. An embedding of the quadratic order into a quaternionic order naturally gives an integral binary hermitian form over the quadratic order. We show that, in certain cases, this correspondence…

Let R be the ring of S-integers of an algebraic function field (in one variable) over a perfect field, where S is finite and not empty. It is shown that for every positive integer N there exist elements of R that can not be written as a sum…

We study representation of square-free polynomials in the polynomial ring F[t] over a finite field F by polynomials in F[t][x]. This is a function field version of the well-studied problem of representing squarefree integers by integer…

We give an elementary approach to studying whether rings of $S$-integers in complex quadratic fields are Euclidean with respect to the $S$-norm.

We prove a new extension result for $QB-$rings that allows us to examine extensions of rings where the ideal is purely infinite and simple. We then use this result to explore various constructions that provide new examples of $QB-$rings.…

The multi-valued quantum $j$-invariant in positive characteristic is studied at quadratic elements. For every quadratic $f$, an explicit expression for each of the values of $j^{\rm qt}(f)$ is given as a limit of rational functions of $f$.…

There are two kinds of polynomial functions on matrix algebras over commutative rings: those induced by polynomials with coefficients in the algebra itself and those induced by polynomials with scalar coefficients. In the case of algebras…

Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…

We consider ideals in a polynomial ring generated by collections of power sum polynomials, and obtain conditions under which these define complete intersection rings, normal domains, and unique factorization domains. We also settle a key…