A solution to the Straus-Erdős conjecture
This paper outlines a solution to the Straus Erdős Conjecture. Namely for each prime $p$ there exists positive integers $x \leq y \leq z$ so that $$ \frac{4}{p} = \frac{1}{x}+\frac{1}{y}+\frac{1}{z} $$
arXiv subjects
Publications and source records attributed to Kyle Bradford.
This paper outlines a solution to the Straus Erdős Conjecture. Namely for each prime $p$ there exists positive integers $x \leq y \leq z$ so that $$ \frac{4}{p} = \frac{1}{x}+\frac{1}{y}+\frac{1}{z} $$
In this paper we create a definition for prime gaps in the Gaussian integers using a boxcar metric. From this we used numerical methods to derive an asymptotic upper bound for the gaps in this scenario, namely O(log^2|p_{n}|).
This paper makes the following conjecture: For every prime $p$ there exists a positive integer $x$ with $\left\lceil \frac{p}{4} \right\rceil \leq x \leq \left\lceil \frac{p}{2} \right\rceil$ and a positive divisor $d|x^2$ so that either: (1) $ d \bmod \left( 4x - p \right) \equiv -px$; or (2) $d \leq x$ and $ d \bmod \left( 4x - p \right) \equiv -x$. Furthermore this paper proves that the solutions to these modular equations are in one-to-one correspondence with the solutions of the diophantine equation used in the Erdős Straus conjecture.
This paper is a preliminary expository paper that outlines the relationship between solutions to the Erdős-Straus conjecture for a given prime $p$ and their corresponding Pythagorean triples. This paper also uses Bézout Coefficients to find a relationship between the solutions to the conjecture and roots of a second degree polynomial.
This paper makes a fundamental assertion about the Erdős-Straus conjecture. Suppose that for a prime $p$ there exists $x,y,z \in \mathbb{N}$ with $x \leq y \leq z$ so that $$ \frac{4}{p} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}. $$ The main contribution of this paper is that, under this assumption, the Erdős-Straus conjecture can be reduced by one variable. For example, it is necessarily true that $$ z = \frac{xyp}{\gcd(y,p) \gcd \left( xy, x+y \right)}.$$ Considering other reductions of the Erdős-Straus conjecture, this paper suggests a method for proof.
This paper continues the discussion on the stability of time-inhomogeneous Markov chains. In particular, this paper defines a time-inhomogeneous, discrete-time Markov chain governed by a continuous evolution in the appropriate martrix space. This matrix space, $\mathcal{P}_{n}^{ia}$, is the space of all stochastic matrices that are irreducible and aperiodic. For this new type of evolution there is a definition of a specific type of stability called the stable adiabatic time. This measure is bounded by a function of the optimal mixing time over the evolution. Namely, for a time-inhomogeneous, discrete-time Markov chain governed by a continuous evolution through a function $\mathbf{P}: [0,1] \rightarrow \mathcal{P}_{n}^{ia}$ and $0 < ε< \frac{1}{2 \sqrt{n}}$ $$t_{sad}(\mathbf{P}, ε) \leq \frac{3n^{3 \slash 2} L t_{mix}^{2}(\mathbf{P}_{\infty}, ε)}{(1-2\sqrt{n} ε) ε}$$ \noindent where $L$ is a Lipschitz constant related to the function $\mathbf{P}$.
In this paper we will explore the solutions to the diophantine equation in the Erdős-Straus conjecture. For a prime $p$ we are discussing the relationship between the values $x,y,z \in \mathbb{N}$ so that $$ \frac{4}{p} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}.$$ We will separate the types of solutions into two cases. In particular we will argue that the most common relationship found is $$ x = \lfloor \frac{py}{4y-p} \rfloor + 1.$$ Finally, we will make a few conjectures to motivate further research in this area.
In this paper we make a Gaussian integer version of the Erdős-Straus conjecture and we solve the Erdős-Straus diophantine equation over the rings of integers of norm-Euclidean quadratic fields.
In this paper we continue our work on adiabatic time of time-inhomogeneous Markov chains first introduced in Kovchegov (2010) and Bradford and Kovchegov (2011). Our study is an analog to the well-known Quantum Adiabatic (QA) theorem which characterizes the quantum adiabatic time for the evolution of a quantum system as a result of applying of a series of Hamilton operators, each is a linear combination of two given initial and final Hamilton operators, i.e. $\mathbf{H}(s) = (1-s)\mathbf{H_0} + s\mathbf{H_1}$. Informally, the quantum adiabatic time of a quantum system specifies the speed at which the Hamiltonian operators changes so that the ground state of the system at any time $s$ will always remain $ε$-close to that induced by the Hamilton operator $\mathbf{H}(s)$ at time $s$. Analogously, we derive a sufficient condition for the stable adiabatic time of a time-inhomogeneous Markov evolution specified by applying a series of transition probability matrices, each is a linear combination of two given irreducible and aperiodic transition probability matrices, i.e., $\mathbf{P_{t}} = (1-t)\mathbf{P_{0}} + t\mathbf{P_{1}}$. In particular we show that the stable adiabatic time $t_{sad}(\mathbf{P_{0}}, \mathbf{P_{1}}, ε) = O (t_{mix}^{4}(ε\slash 2) \slash ε^{3}), $ where $t_{mix}$ denotes the maximum mixing time over all $\mathbf{P_{t}}$ for $0 \leq t \leq 1$.
We state and prove a generalized adiabatic theorem for Markov chains and provide examples and applications related to Glauber dynamics of Ising model over Z^d/nZ^d. The theorems derived in this paper describe a type of adiabatic dynamics for l^1(R_+^n) norm preserving, time inhomogeneous Markov transformations, while quantum adiabatic theorems deal with l^2(C^n) norm preserving ones, i.e. gradually changing unitary dynamics in C^n.