SearcharxivSearch

arXiv · 1608.03721

On the Geometry of the Multiplicatively Closed Sets generated by at most Two Elements with arbitrarily Large Gaps, a constructive method

Abstract

We prove in Theorem $2.2$ that the multiplicatively closed subset generated by at most two elements in the set of natural numbers $\mathbb{N}$ has arbitrarily large gaps by explicitly constructing large integer intervals with known prime factorization for the end points, which do not contain any element from the multiplicatively closed set apart from the end points, which belong to the multiplicatively closed set. An Example $4.6$ is also illustrated. We also give a criterion in Theorems $7.8,7.12$ by using a geometric correspondence between maximal singly generated multiplicatively closed sets and points of the space $\mathbb{PF}^{\infty}_{\mathbb{Q}\geq 0}$ (refer to Theorem $7.5$) as to when a finitely generated multiplicatively closed set gives rise to a doubly multiplicatively closed line (refer to Definition $7.4$). We answer a similar Question $5.1$ partially about gaps in a multiply-generated multiplicative closed set, when it is contained in a doubly multiplicative closed set using Theorem $7.8$ and Theorem $7.17$. In the appendix Section $8$ we discuss another constructive proof (refer to Theorem $8.6$) for arbitrarily large gap intervals, where the prime factorization is not known for the right end-point unlike the constructive proof of the main result of the article in the case of multiplicatively closed set $\{p_1^ip_2^j\mid i,j\in \mathbb{N}\cup\{0\}\}$ with $\{p_1<p_2,Log_{p_1}(p_2)\}$ irrational for which the prime factorization is known for both the end-points of the gap interval via the stabilization sequence of the irrational $\frac {1}{Log_{p_1}(p_2)}$.

Explore related subjects

Keep this discovery

BibTeXRIS

C. P. Anil Kumar. 2017-11-01. On the Geometry of the Multiplicatively Closed Sets generated by at most Two Elements with arbitrarily Large Gaps, a constructive method. https://doi.org/10.1007/s12044-019-0486-8

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Ordinary 3-Isogeny Graphs and Improvement of Supersingularity Testing for Twisted Hessian Curves over Prime Fields

For any primes $p \neq \ell$, $\ell$-isogeny graphs of ordinary elliptic curves defined over $\mathbb{F}_{p^2}$ have a typical structure called $\ell$-volcanoes, and the structure is the core of Sutherland's supersingularity testing algorithm for elliptic curves. In this paper, by exploiting the properties of $3$-isogenies between twisted Hessian curves, we show that when $p \equiv 2 \pmod{3}$ and $\ell = 3$, every ordinary twisted Hessian curve defined over $\mathbb{F}_p$ lies on the surface of the $3$-volcano. As an application, we give an improved version of Sutherland's supersingularity testing algorithm specialized to twisted Hessian curves defined over $\mathbb{F}_p$ with $p \equiv 2 \pmod{3}$. We also give a generalization of the known fact that any supersingular $j$-invariant is a cube in $\mathbb{F}_{p^2}$; we show that for any twisted Hessian curve $H(a,d)$ defined over $\mathbb{F}_{p^2}$, its $j$-invariant is not a cube in $\mathbb{F}_{p^2}$ if and only if $H(a,d)$ is ordinary and lies on the floor of a $3$-volcano.

math.NT

Effective estimates for exponential sums with multiplicative coefficients

Let $f$ be multiplicative, with $|f(p)|\le A$ at primes and $\sum_{n\le x}|f(n)|^2\le A^2x$ for every $x\ge1$. If $|\alpha-a/q|\le q^{-2}$, $(a,q)=1$, and $3\le R\le q\le N/R$, we prove \[ \sum_{n\le N}f(n)\operatorname{e}(n\alpha) \ll_A \frac{N}{\log N} +\frac{N}{\sqrt R}\sqrt{\log\log(3R)} \] with effective implied constants. Montgomery and Vaughan proved this with second term $NR^{-1/2}(\log R)^{3/2}$, and, for $1$-bounded functions, Bachman replaced it by $NR^{-1/2}\sqrt{\log R\log\log R}$. We remove the factor $\sqrt{\log R}$ from Bachman's second term while retaining the original coefficient hypotheses of Montgomery and Vaughan. A more precise estimate records the distance from a rational number. The proof combines the Brun-Titchmarsh inequality on short intervals with maximal Fourier estimates derived from the Carleson-Hunt theorem; the local bounds permit arbitrary prime-dependent prefixes. We also prove sharpness of the square-root displacement dependence.

math.NT

Rational Approximations for Reciprocals of Multiple Zeta Values and Trivariate Cauchy Numbers

In this paper, we will study a trivariate extension of the Cauchy numbers of both the first kind (also called Gregory coefficients) and the second kind (also called N\"orlund numbers) via the Laurent expansion of the reciprocal of any positive integer power (which is called the order) of multiple polylogarithms. In the case of logarithm, we will show by the WZ method that for each order $\ell>1$ some Gregory coefficient of order $\ell$ must vanish, in contrast to the fact that all classical Gregory coefficients are nonzero. We also prove in this higher order logarithm case that the sequence is eventually alternating for each fixed order, a property enjoyed by the classical Gregory coefficients. In the most general setting, we conjecture that these new sequences are all eventually positive, which is supported by strong numerical evidence. Finally, we confirm this conjecture in the special case of polylogarithms and double polylogarithms. As a by product, for each zeta value and double zeta value, we find an infinite family of identities expressing its reciprocal as a sum of a rational number and an improper integral.

math.NT