SearcharxivSearch

arXiv subjects

Kellen Myers

Publications and source records attributed to Kellen Myers.

4 recordsLinked to original sources

When is Enough Enough? A Proposed Termination Point for the Number of Replicates in Computational Simulations

Computational simulation provides a powerful toolkit for in silico experimentation. However, while the field has developed best practices for the design and implementation of such models, there remains ambiguity in discussions about how to understand and/or interpret their results due to their inherent ability to overwhelm traditional frequentist statistics by simply increasing the number of trials simulated. This fails the discipline in two ways: first, it leaves the community unsure of what constitutes a best practice for uniform understanding, and second, it potentially overburdens computational studies that burn clock cycles solely to ensure "enough runs to satisfy peers" without any theoretical underpinning for a definition of "enough". We propose a simple and straightforward standard for when to stop simulating additional trials, the {\Omega} test, designed to be analogous to the function of traditional frequentist P-tests. Community adoption of a reasonable and uniform standard will permit more efficient computational experimentation and clearly communication/interpretation of the findings discovered in this way.

q-bio.OT

A Note on a Question of Erdős & Graham

Erdős & Graham ask whether the equation $x^2+y^2=z^2$ is partition regular, i.e. whether it has a finite Rado number. This note provides a lower bound and also states results in the affirmative for two similar quadratic equations.

math.CO

Some Two Color, Four Variable Rado Numbers

There exists a minimum integer $N$ such that any 2-coloring of $\{1,2,...,N\}$ admits a monochromatic solution to $x+y+kz =\ell w$ for $k,\ell \in \mathbb{Z}^+$, where $N$ depends on $k$ and $\ell$. We determine $N$ when $\ell-k \in \{0,1,2,3,4,5\}$, for all $k,\ell$ for which ${1/2}((\ell-k)^2-2)(\ell-k+1)\leq k \leq \ell-4$, as well as for arbitrary $k$ when $\ell=2$.

math.CO

Two Color Off-diagonal Rado-type Numbers

We show that for any two linear homogenous equations $\mathcal{E}_0,\mathcal{E}_1$, each with at least three variables and coefficients not all the same sign, any 2-coloring of $\mathbb{Z}^+$ admits monochromatic solutions of color 0 to $\mathcal{E}_0$ or monochromatic solutions of color 1 to $\mathcal{E}_1$. We define the 2-color off-diagonal Rado number $RR(\mathcal{E}_0,\mathcal{E}_1)$ to be the smallest $N$ such that $[1,N]$ must admit such solutions. We determine a lower bound for $RR(\mathcal{E}_0,\mathcal{E}_1)$ in certain cases when each $\mathcal{E}_i$ is of the form $a_1x_1+...+a_nx_n=z$ as well as find the exact value of $RR(\mathcal{E}_0,\mathcal{E}_1)$ when each is of the form $x_1+a_2x_2+...+a_nx_n=z$. We then present a Maple package that determines upper bounds for off-diagonal Rado numbers of a few particular types, and use it to quickly prove two previous results for diagonal Rado numbers.

math.CO