Number Theory Research Articles

Education in I&M: Coherent Sampling or “A Little Bit of Elementary Number Theory Goes a Long Way”

Education in I&M: Coherent Sampling or “A Little Bit of Elementary Number Theory Goes a Long Way”

Profound integration of elementary number theory in composite encryption systems: A mathematical security exploration

Number Theory, the investigation of natural numbers, is a time-honored discipline within Mathematics that has captivated mathematicians over numerous centuries due to its inherent purity. In today's world, a thorough understanding of Number Theory is essential for the advancement of cutting-edge technology, as it is extensively applied in domains such as software engineering and cryptography. The objective of this study is to elucidate the understanding of Number Theory that underlies several composite encryption systems and analyze the advantages and disadvantages of each encryption system through a comprehensive examination of existing literature. The discipline of Number Theory has extensive practical implications in cryptography and holds the promise of being increasingly employed in various domains in the future. By elucidating the role of Number Theory in various encryption systems, the fundamental nature of encryption can be enhanced, hence fostering the emergence of novel methodologies or approaches in information security.

Factoring determinants and applications to number theory

Products of shifted characteristic polynomials, and ratios of such products, averaged over the classical compact groups are of great interest to number theorists as they model similar averages of [Formula: see text]-functions in families with the same symmetry type as the compact group. We use Toeplitz and Toeplitz plus Hankel operators and the identities of Borodin–Okounkov–Case–Geronimo, and Basor–Ehrhardt to prove that, in certain cases, these unitary averages factor as polynomials into averages over the symplectic group and the orthogonal group. Building on these identities we present new proofs of the exact formulas for these averages where the “swap” terms that are characteristic of the number theoretic averages occur from the Fredholm expansions of the determinants of the appropriate Hankel operator. This is the fourth different proof of the formula for the averages of ratios of products of shifted characteristic polynomials; the other proofs are based on supersymmetry; symmetric function theory, and orthogonal polynomial methods from random matrix theory.

Perfect Codes over Non-Prime Power Alphabets: An Approach Based on Diophantine Equations

Perfect error-correcting codes allow for an optimal transmission of information while guaranteeing error correction. For this reason, proving their existence has been a classical problem in both pure mathematics and information theory. Indeed, the classification of the parameters of e-error correcting perfect codes over q-ary alphabets was a very active topic of research in the late 20th century. Consequently, all parameters of perfect e-error-correcting codes were found if e≥3, and it was conjectured that no perfect 2-error-correcting codes exist over any q-ary alphabet, where q>3. In the 1970s, this was proved for q a prime power, for q=2r3s and for only seven other values of q. Almost 50 years later, it is surprising to note that there have been no new results in this regard and the classification of 2-error-correcting codes over non-prime power alphabets remains an open problem. In this paper, we use techniques from the resolution of the generalised Ramanujan–Nagell equation and from modern computational number theory to show that perfect 2-error-correcting codes do not exist for 172 new values of q which are not prime powers, substantially increasing the values of q which are now classified. In addition, we prove that, for any fixed value of q, there can be at most finitely many perfect 2-error-correcting codes over an alphabet of size q.

Comment: Paper on the progress of pure mathematics "proof of 3x + 1 conjecture"

The unresolved problem in number theory: the 3x+1 problem, deeply loved by math enthusiasts. I saw a paper titled "Proof of 3x+1 Conjecture" in the Journal of Pure Mathematical Progress (ISSN Print: 2160-0368), and its proof was incorrect.

Cryptographic Application of Elliptic Curve Generated through Centered Hexadecagonal Numbers

Background/Objectives: Elliptic Curve Cryptography (ECC) is a public-key encryption method that is similar to RSA. ECC uses the mathematical concept of elliptic curves to achieve the same level of security with significantly smaller keys, whereas RSA's security depends on large prime numbers. Elliptic curves and their applications in cryptography will be discussed in this paper. The elliptic curve is formed by the extension of a Diophantine pair of Centered Hexadecagonal numbers to a Diophantine triple with property D(8). Method: The Diffie–Hellman key exchange, named for Whitfield Diffie and Martin Hellman, was developed by Ralph Merkle and is a mathematical technique for safely transferring cryptographic keys over a public channel. Based on the Diffie–Hellman key exchange, the ElGamal encryption system is an asymmetric key encryption algorithm for public-key cryptography. The generation of keys, encryption and decryption are the three main operations of the ElGamal cryptosystem. Findings: Given the relative modesty of our objectives, the fundamental algebraic and geometric characteristics of elliptic curves shall be delineated. Then the behaviour of elliptic curves modulo p: ultimately, there is a fairly strong analogy between the structure of the points on an elliptic curve modulo p and the integers modulo n will be studied. In the end, elliptic curve ElGamal encryption analogues of Diffie–Hellman key exchange will be created. Novelty: Elliptic curves are encountered in a multitude of mathematical contexts and have a varied and fascinating history. Elliptic curves are very significant in number theory and are a focus of much recent work. The earlier research works in Elliptic Curve Cryptography has concentrated on computer algorithms and pairing – based algorithms. In this paper, the concept of polygonal numbers and its extension from Diophantine pair to triples is encountered, thus forming an elliptic curve and perform the encryption-decryption process. MSC Classification Number: 11D09, 11D99,11T71,11G05. Keywords: Elliptic curves, Cryptography, Encryption, Decryption, Centered polygonal numbers

A NEW PROGRAM FOR THE ENTIRE FUNCTIONS IN NUMBER THEORY

In this paper, we propose a new program for introducing the sign of the functional equation to present the entire functions of order one in number theory. We suggest some open problems for the zeros of these entire functions related to the completed Dedekind zeta function, completed quadratic Dirichlet L-functions, completed Ramanujan zeta function and completed automorphic L-function. These lead to the contribution to giving the deep understanding for diffusion equations associated with the entire functions of order one in number theory.

On Some Multipliers Related to Discrete Fractional Integrals

This paper explores the properties of multipliers associated with discrete analogues of fractional integrals, revealing intriguing connections with Dirichlet characters, Euler’s identity, and Dedekind zeta functions of quadratic imaginary fields. Employing Fourier transform techniques, the Hardy–Littlewood circle method, and a discrete analogue of the Stein–Weiss inequality on product space through implication methods, we establish ℓp→ℓq bounds for these operators. Our results contribute to a deeper understanding of the intricate relationship between number theory and harmonic analysis in discrete domains, offering insights into the convergence behavior of these operators.

Retrospective on the risk matrix, part II: Mathematics

AbstractWe present a review of mathematical and engineering science foundation of the risk matrix (RM). The objective was to locate and evaluate information surrounding its use. RM is governed by number theory, set theory, metrology, and functional analysis, which explains the strengths and weakness of its use. Although incorrectly reported, ordinal multiplication rigidly sets the cell numeric allocation. No scientific support was found for changing the ordinal ranks, although one reduction is introduced. Existing evidence suggests that the RM is unreliable. An example is given. Suggestions for beneficial use of the RM are provided.

The equivalence of Axiom (∗)+ and Axiom (∗)++

Asperó and Schindler have completely solved the Axiom [Formula: see text] vs. [Formula: see text] problem. They have proved that if [Formula: see text] holds then Axiom [Formula: see text] holds, with no additional assumptions. The key question now concerns the relationship between [Formula: see text] and Axiom [Formula: see text]. This is because the foundational issues raised by the problem of Axiom [Formula: see text] vs. [Formula: see text] arguably persist in the problem of Axiom [Formula: see text] vs. [Formula: see text]. The first of our two main theorems is that Axiom [Formula: see text] is equivalent to Axiom [Formula: see text], and as a corollary we show that Axiom [Formula: see text] fails in all the known models of [Formula: see text]. This suggests that [Formula: see text] actually refutes Axiom [Formula: see text]. Our second main theorem is that the [Formula: see text] Conjecture holds assuming [Formula: see text]. This is the strongest partial result known on this conjecture which is one of the central open problems of [Formula: see text]-theory and [Formula: see text]-logic. These results identify a fundamental asymmetry between the Continuum Hypothesis and any axiom which is both [Formula: see text]-expressible and which implies [Formula: see text], on the basis of generic absoluteness for the simplest of the nontrivial sentences of Third-Order Number Theory. These are the [Formula: see text]-sentences with no parameters. Such sentences are those which simply assert the existence of a set [Formula: see text] for which some property involving only quantification over [Formula: see text] holds.

Fast Fourier transforms and fast Wigner and Weyl functions in large quantum systems

Two methods for fast Fourier transforms are used in a quantum context. The first method is for systems with dimension of the Hilbert space D=dn\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$D=d^n$$\\end{document} with d an odd integer, and is inspired by the Cooley-Tukey formalism. The ‘large Fourier transform’ is expressed as a sequence of n ‘small Fourier transforms’ (together with some other transforms) in quantum systems with d-dimensional Hilbert space. Limitations of the method are discussed. In some special cases, the n Fourier transforms can be performed in parallel. The second method is for systems with dimension of the Hilbert space D=d0...dn-1\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$D=d_0...d_{n-1}$$\\end{document} with d0,...,dn-1\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$d_0,...,d_{n-1}$$\\end{document} odd integers coprime to each other. It is inspired by the Good formalism, which in turn is based on the Chinese reminder theorem. In this case also the ‘large Fourier transform’ is expressed as a sequence of n ‘small Fourier transforms’ (that involve some constants related to the number theory that describes the formalism). The ‘small Fourier transforms’ can be performed in a classical computer or in a quantum computer (in which case we have the additional well known advantages of quantum Fourier transform circuits). In the case that the small Fourier transforms are performed with a classical computer, complexity arguments for both methods show the reduction in computational time from O(D2)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathcal{O}(D^2)$$\\end{document} to O(DlogD)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathcal{O}(D\\log D)$$\\end{document}. The second method is also used for the fast calculation of Wigner and Weyl functions, in quantum systems with large finite dimension of the Hilbert space.

NEW CONJECTURES FOR THE ENTIRE FUNCTIONS ASSOCIATED WITH FRACTIONAL CALCULUS

In this paper, we address the entire Fourier sine and cosine integrals related to the Mittag-Leffler function. We guess that the entire functions have the real zeros in the entire complex plane. They can be connected with the well-known conjectures in analytic number theory. They are considered as the special solutions for the time-fractional diffusion equation within the Caputo fractional derivative.

Editorial Correction to “A note on a generalization of Riordan’s combinatorial identity via a hypergeometric series approach” [Notes on Number Theory and Discrete Mathematics, 2023, Volume 29, Number 3, Pages 421–425

Editorial Correction to “A note on a generalization of Riordan’s combinatorial identity via a hypergeometric series approach” [Notes on Number Theory and Discrete Mathematics, 2023, Volume 29, Number 3, Pages 421–425

Extremal values of degree-based entropies of bipartite graphs

We characterize the bipartite graphs that minimize the (first degree-based) entropy among all bipartite graphs of given size. For bipartite graphs given size and (upper bound on the) order, we give a lower bound for this entropy. The extremal graphs turn out to be complete bipartite graphs, or nearly complete bipartite. Here we make use of an equivalent representation of bipartite graphs by means of Young diagrams, which make it easier to compare the entropy of related graphs. We conclude that the general characterization of the extremal graphs is a difficult problem, due to its connections with number theory. However, it is easier to identify them for particular values of the order n and size m because we have narrowed down the possible extremal graphs. We indicate that some of our ideas extend to other degree-based topological indices as well.

The β maps: Strong clustering and distribution results on the complex unit circle

In the current work, we study the eigenvalue distribution results of a class of non-normal matrix-sequences which may be viewed as a low rank perturbation, depending on a parameter β>1, of the basic Toeplitz matrix-sequence {Tn(eiθ)}n∈N, i2=−1. The latter of which has obviously all eigenvalues equal to zero for any matrix order n, while for the matrix-sequence under consideration we will show a strong clustering on the complex unit circle. A detailed discussion on the outliers is also provided. The problem appears mathematically innocent, but it is indeed quite challenging since all the classical machinery for deducing the eigenvalue clustering does not cover the considered case. In the derivations, we resort to a trick used for the spectral analysis of the Google matrix plus several tools from complex analysis. We only mention that the problem is not an academic curiosity and in fact stems from problems in dynamical systems and number theory. Additionally, we also provide numerical experiments in high precision, a distribution analysis in the Weyl sense concerning both eigenvalues and singular values is given, and more results are sketched for the limit case of β=1.

A Graph and Number Theory Based Description Method and Equivalence Judgment of Power Electronics Topology

A Graph and Number Theory Based Description Method and Equivalence Judgment of Power Electronics Topology

Certificateless anti-quantum blind signcryption for e-cash

Electronic cash (e-cash) has become major payment way in the era of internet of things. However, the leakage of user privacy and transaction data is becoming more and more serious in e-cash system. To solve these problems, we construct a new certificateless blind signcryption from NTRU lattice (NTRUL-CLBSC) suitable for e-cash. NTRUL-CLBSC has low communication overhead and high calculation efficiency because of small storage space and short key size in number theory research unit (NTRU) lattice. Based on RSIS and DNCC problems in NTRU lattice, NTRUL-CLBSC can guarantee the anti-quantum, anti-forgery, confidentiality and blindness, and there is no key escrow and certificate management in e-cash application.

On Solving a Quadratic Diophantine Equation Involving Odd Powers of 17

Diophantine Equations named after ancient Greek mathematician Diophantus, plays a vital role not only in number theory but also in several branches of science. In this paper, we will solve one of the quadratic Diophantine equations where the right hand side are odd positive integral powers of 17 and provide its complete solutions. The method adopted to solve the given equation is using the concept of polar form of a particular complex number. This concept can be generalized for solving similar equations.

On λ $\lambda $‐backbone coloring of cliques with tree backbones in linear time

AbstractA ‐backbone coloring of a graph with its subgraph (also called a backbone) is a function ensuring that is a proper coloring of and for each it holds that . In this paper we propose a way to color cliques with tree and forest backbones in linear time that the largest color does not exceed . This result improves on the previously existing approximation algorithms as it is ‐absolutely approximate, that is, with an additive error over the optimum. We also present an infinite family of trees with for which the coloring of cliques with backbones requires at least colors for close to . The construction draws on the theory of Fibonacci numbers, particularly on Zeckendorf representations.

MAN[sbnd]C: A masked autoencoder neural cryptography based encryption scheme for CT scan images

Sharing medical images securely is very important towards keeping patients’ data confidential. In this paper we propose MANC: a Masked Autoencoder Neural Cryptography based encryption scheme for sharing medical images. The proposed technique builds upon recently proposed masked autoencoders. In the original paper, the masked autoencoders are used as scalable self-supervised learners for computer vision which reconstruct portions of originally patched images. Here, the facility to obfuscate portions of input image and the ability to reconstruct original images is used an encryption-decryption scheme. In the final form, masked autoencoders are combined with neural cryptography consisting of a tree parity machine and Shamir Scheme for secret image sharing. The proposed technique MANC helps to recover the loss in image due to noise during secret sharing of image.•Uses recently proposed masked autoencoders, originally designed as scalable self-supervised learners for computer vision, in an encryption-decryption setup.•Combines autoencoders with neural cryptography - the advantage our proposed approach offers over existing technique is that (i) Neural cryptography is a new type of public key cryptography that is not based on number theory, requires less computing time and memory and is non-deterministic in nature, (ii) masked auto-encoders provide additional level of obfuscation through their deep learning architecture.•The proposed scheme was evaluated on dataset consisting of CT scans made public by The Cancer Imaging Archive (TCIA). The proposed method produces better RMSE values between the input the encrypted image and comparable correlation values between the input and the output image with respect to the existing techniques.