相关论文: Some Heuristics and Results for Small Cycles of th…
Brizolis asked the question: does every prime p have a pair (g,h) such that h is a fixed point for the discrete logarithm with base g? The first author previously extended this question to ask about not only fixed points but also…
The abstract of the original paper was as follows: We explore some questions related to one of Brizolis: does every prime p have a pair (g,h) such that h is a fixed point for the discrete logarithm with base g? We extend this question to…
Brizolis asked the question: does every prime p have a pair (g,h) such that h is a fixed point for the discrete logarithm with base g? The author and Pieter Moree, building on work of Zhang, Cobeli, and Zaharescu, gave heuristics for…
Brizolis asked for which primes p greater than 3 does there exist a pair (g, h) such that h is a fixed point of the discrete exponential map with base g, or equivalently h is a fixed point of the discrete logarithm with base g. Zhang (1995)…
Let $p>2$ be prime and $g$ a primitive root modulo $p$. We present an argument for the fact that discrete logarithms of the numbers in any arithmetic progression are uniformly distributed in $[1,p]$ and raise some questions on the subject.
For $q$ a prime power, the discrete logarithm problem (DLP) in $\mathbb{F}_{q}$ consists in finding, for any $g \in \mathbb{F}_{q}^{\times}$ and $h \in \langle g \rangle$, an integer $x$ such that $g^x = h$. We present an algorithm for…
In 2003, H\'{e}thelyi and K\"{u}lshammer proposed that if $G$ is a finite group and $p$ is a prime dividing the group order, then $k(G)\geq 2\sqrt{p-1}$, and they proved this conjecture for solvable $G$ and showed that it is sharp for those…
There is extensive numerical support for the prime-pair conjecture (PPC) of Hardy and Littlewood (1923) on the asymptotic behavior of pi_{2r}(x), the number of prime pairs (p,p+2r) with p not exceeding x. However, it is still not known…
Difficulty of calculation of discrete logarithm for any arbitrary Field is the basis for security of several popular cryptographic solutions. Pohlig-Hellman method is a popular choice to calculate discrete logarithm in finite field $F_p^*$.…
We propose the formula for the number of pairs of consecutive primes $p_n, p_{n+1}<x$ separated by gap $d=p_{n+1}-p_n$ expressed directly by the number of all primes $<x$, i.e. by $\pi(x)$. As the application of this formula we formulate 7…
Let $D$ be a $k$-regular bipartite tournament on $n$ vertices. We show that, for every $p$ with $2 \le p \le n/2-2$, $D$ has a cycle $C$ of length $2p$ such that $D \setminus C$ is hamiltonian unless $D$ is isomorphic to the special digraph…
We formulate, using heuristic reasoning, precise conjectures for the range of the number of primes in intervals of length $y$ around $x$, where $y\ll (\log x)^2$. In particular we conjecture that the maximum grows surprisingly slowly as $y$…
Fix irrational numbers $\alpha,\hat\alpha>1$ of finite type and real numbers $\beta,\hat\beta\ge 0$, and let $B$ and $\hat B$ be the Beatty sequences $$ B:=(\lfloor\alpha m+\beta\rfloor)_{m\ge 1}\quad\text{and}\quad\hat…
There are two outstanding questions about division algebras of prime degree $p$. The first is whether they are cyclic, or equivalently crossed products. The second is whether the center, $Z(F,p)$, of the generic division algebra $UD(F,p)$…
For a prime number $p>2$, we explain the construction of the difference divisors on the unitary Rapoport-Zink spaces of hyperspecial level and the GSpin Rapoport-Zink spaces of hyperspecial level associated to a minuscule cocharacter $\mu$…
We study the Hamilton cycle problem with input a random graph G=G(n,p) in two settings. In the first one, G is given to us in the form of randomly ordered adjacency lists while in the second one we are given the adjacency matrix of G. In…
Let D(n,p) be the random directed graph on n vertices where each of the n(n-1) possible arcs is present independently with probability p. A celebrated result of Frieze shows that if $p\ge(\log n+\omega(1))/n$ then D(n,p) typically has a…
D. Bailey and R. E. Crandall recently formulated a "Hypothesis A", which provides a general principle to explain the (conjectured) normality of constants like pi or log 2 and other related numbers, to base 2 or other integer bases. This…
Dickson conjectured that a set of polynomials will take on infinitely many simultaneous prime values. Later others, such as Hardy and Littlewood, gave estimates for the number of these primes. In this article we look at this conjecture,…
In \cite{joux}, Joux devised an algorithm to compute discrete logarithms between elements in a certain subset of the multiplicative group of an extension of the finite field $\mathbb{F}_{p^n}$ in time polynomial in $p$ and $n$. Shortly…