Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPerfect Numbers in the Ring of Eisenstein Integers
92
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
One of the many number theoretic topics investigated by the ancient Greeks was perfect numbers, which are positive integers equal to the sum of their proper positive integral divisors. Mathematicians from Euclid to Euler investigated these mysterious numbers. We present results on perfect numbers in the ring of Eisenstein integers.
rate research
Read More
We compute the etale cohomology ring $H^*(text{Spec } mathcal{O}_K,mathbb{Z}/nmathbb{Z})$ where $mathcal{O}_K$ is the ring of integers of a number field $K.$ As an application, we give a non-vanishing formula for an invariant defined by Minhyong Kim.
M. B. Levin used Sobol-Faure low discrepancy sequences with Pascal matrices modulo $2$ to construct, for each integer $b$, a real number $x$ such that the first $N$ terms of the sequence $(b^n x mod 1)_{ngeq 1}$ have discrepancy $O((log N)^2/N)$. This is the lowest discrepancy known for this kind of sequences. In this note we characterize Levins construction in terms of nested perfect necklaces, which are a variant of the classical de Bruijn necklaces. Moreover, we show that every real number $x$ whose base $b$ expansion is the concatenation of nested perfect necklaces of exponentially increasing order satisfies that the first $N$ terms of $(b^n x mod 1)_{ngeq 1}$ have discrepancy $O((log N)^2/N)$. For base $2$ and the order being a power of $2$, we give the exact number of nested perfect necklaces and an explicit method based on matrices to construct each of them.
We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.
We present a variation of the modular algorithm for computing the Hermite normal form of an $mathcal O_K$-module presented by Cohen, where $mathcal O_K$ is the ring of integers of a number field $K$. An approach presented in (Cohen 1996) based on reductions modulo ideals was conjectured to run in polynomial time by Cohen, but so far, no such proof was available in the literature. In this paper, we present a modification of the approach of Cohen to prevent the coefficient swell and we rigorously assess its complexity with respect to the size of the input and the invariants of the field $K$.
For each odd prime $p$, we conjecture the distribution of the $p$-torsion subgroup of $K_{2n}(mathcal{O}_F)$ as $F$ ranges over real quadratic fields, or over imaginary quadratic fields. We then prove that the average size of the $3$-torsion subgroup of $K_{2n}(mathcal{O}_F)$ is as predicted by this conjecture.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
