A5048461013- Advanced Graph Theory Research
- graph theory and CDMA systems
- Analytic Number Theory Research
- Mathematical functions and polynomials
- Finite Group Theory Research
- Mathematical Approximation and Integration
- Limits and Structures in Graph Theory
- Interconnection Networks and Systems
- Advanced Mathematical Identities
University of Lethbridge
2018-2021
In this article, we provide explicit bounds for the prime counting functions <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="theta left-parenthesis x right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>θ<!-- θ --></mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>x</mml:mi> stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\theta (x)</mml:annotation> </mml:semantics> </mml:math>...
We provide a computer-assisted proof that if G is any finite group of order kp, where k < 48 and p prime, then every connected Cayley graph on hamiltonian (unless kp = 2). As part the proof, it verified less than either or laceable (or has valence three).
In this article, we provide explicit bounds for the prime counting function $\theta(x)$ in all ranges of $x$. The error term $\theta (x)- x$ are shape $\epsilon and $\frac{c_k x}{(\log x)^k}$, $k=1,\ldots,5$. Tables values $\epsilon$ $c_k$ provided.
We provide a computer-assisted proof that if G is any finite group of order kp, where k < 48 and p prime, then every connected Cayley graph on hamiltonian (unless kp = 2). As part the proof, it verified less than either or laceable (or has valence three).