Searcharxiv⌕ Search

arXiv subjects

Andrzej Bożek

Publications and source records attributed to Andrzej Bożek.

2 recordsLinked to original sources

Expanding total sieve and patterns in primes

Let $\big(\mathcal{S}_n^{α,κ,\mathfrak{r}}(z)\big)_{n=1}^\infty$ be a sequence of the largest possible integer intervals, such that $z\in\mathcal{S}_n^{α,κ,\mathfrak{r}}(z)\subset\overline{\mathcal{M}}_n^{α,κ,\mathfrak{r}}=\bigcup_{i=1}^n [\mathfrak{r}_i]_{\mathfrak{p}_i}$ or $\mathcal{S}_n^{α,κ,\mathfrak{r}}(z)=\emptyset$, where $\mathfrak{p}_i=p_{α+\left\lceil i/κ\right\rceil-1}$ and $z\in\mathbb{Z}$. We prove that $\big(\#\mathcal{S}_n^{α,κ,\mathfrak{r}}(z)\big)_{n=1}^\infty$ oscillates infinitely many times around $β_n\!=\!o\left(n^2\right)$ for any fixed $α\in\mathbb{Z}^+$, $κ\in\mathbb{Z}\cap[1,p_α)$, and $\mathfrak{r}_i\in\mathbb{Z}$. Let $T=(a_1,a_2,\ldots,a_k)$ be an admissible $k$-tuple and let $\mathcal{X}_n^{T,k,ρ,η}=\left\{x\in[ρ]_η\,:\,\{x\!+\!a_1,x\!+\!a_2,\ldots,x\!+\!a_k\}\cap\mathcal{M}_{n+α-1}\neq\emptyset\right\}$ for each $n\in\mathbb{Z}^+$, where $\mathcal{M}_g=\bigcup_{i=1}^g [0]_{p_i}$. We prove that for any $T$ and for some fixed $α$, $κ$, $ρ$, $η$, $z$, and $\mathfrak{r}$, there exists a linear bijection between $\overline{\mathcal{M}}_{κn}^{α,κ,\mathfrak{r}}$ and $\mathcal{X}_n^{T,k,ρ,η}$ for each $n\in\mathbb{Z}^+$. It implies that the length of any expanding integer interval on which all occurrences of $T$ are sieved out by $\mathcal{M}_{n+α-1}$ oscillates infinitely many times around $\widetildeβ_n=o\left(n^2\right)$. The concept of the sieve of Eratosthenes asserts $\mathcal{E}_n=[2,p^2_{n+α})\cap\left(\mathbb{Z}\setminus\mathcal{M}_{n+α-1}\right)\subset\mathbb{P}$. Therefore, having $p^2_{n+α}=ω\left(n^2\right)$, we obtain that $\mathcal{E}_n$ includes a subset matched to $T$ for infinitely many values of $n$ and, consequently, $T$ matches infinitely many positions in the sequence of primes.

math.GM↗

Exceptional autonomous components of Goldbach factorization graphs

We introduce a concept of a Goldbach factorization graph (GFG) $F_n$, which can be constructed for each even integer $n$ greater than 2. We prove that, if $n$ does not satisfy the binary Goldbach conjecture (BGC), then $F_n$ contains a special source strongly connected component (exceptional autonomous component, EAC). We analyse existence and properties of EACs using deductive and computational approaches. In particular, we prove that there exists exactly one EAC induced by two vertices. Using computer-aided search, we show that for $n \leq 10^8$ there are 6 EACs, each inside a different GFG, and they are located at the relative beginning of the checked range, namely, for $n\in\{128,1718,1862,1928,2200,6142\}$. Using classic graph algorithms, the constraint programming method, and metaheuristic approaches, we have prepared a repository of drawings and some selected properties of the found EACs and GFGs which contain them. The concept of EAC relates to the BGC, but more generally, it represents interesting self-conjugation of prime numbers under a relation which combines addition and multiplication.

math.NT↗