Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2019 ( 5 )

2018 ( 9 )

2017 ( 10 )

2016 ( 12 )

Custom range...

Search Results: 1 - 10 of 4871 matches for " Ron Graham "
All listed articles are free for downloading (OA Articles)
Page 1 /4871
Display every page Item
Enumerating (multiplex) juggling sequences
Steve Butler,Ron Graham
Mathematics , 2008,
Abstract: We consider the problem of enumerating periodic $\sigma$-juggling sequences of length $n$ for multiplex juggling, where $\sigma$ is the initial state (or {\em landing schedule}) of the balls. We first show that this problem is equivalent to choosing 1's in a specified matrix to guarantee certain column and row sums, and then using this matrix, derive a recursion. This work is a generalization of earlier work of Fan Chung and Ron Graham.
Subdivision by bisectors is dense in the space of all triangles
Steve Butler,Ron Graham
Mathematics , 2010,
Abstract: Starting with any nondegenerate triangle we can use a well defined interior point of the triangle to subdivide it into six smaller triangles. We can repeat this process with each new triangle, and continue doing so over and over. We show that starting with any arbitrary triangle, the resulting set of triangles formed by this process contains triangles arbitrarily close (up to similarity) any given triangle when the point that we use to subdivide is the incenter. We also show that the smallest angle in a "typical" triangle after repeated subdivision for many generations does not have the smallest angle going to zero.
Some Ramsey results for the n-cube
Ron Graham,Jozsef Solymosi
Mathematics , 2008,
Abstract: In this note we establish a Ramsey-type result for certain subsets of the $n$-dimensional cube. This can then be applied to obtain reasonable bounds on various related structures, such as (partial) Hales-Jewett lines for alphabets of sized 3 and 4, Hilbert cubes in sets of real numbers with small sumsets, "corner" in the integer lattice in the plane, and 3-term geometric progressions in integers.
Shuffling with ordered cards
Steve Butler,Ron Graham
Mathematics , 2010,
Abstract: We consider a problem of shuffling a deck of cards with ordered labels. Namely we split the deck of N=k^tq cards (where t>=1 is maximal) into k equally sized stacks and then take the top card off of each stack and sort them by the order of their labels and add them to the shuffled stack. We show how to find stacks of cards invariant and periodic under the shuffling. We also show when gcd(q,k)=1 the possible periods of this shuffling are all divisors of order_k(N-q).
A Discrete Fourier Kernel and Fraenkel's Tiling Conjecture
Ron Graham,Kevin O'Bryant
Mathematics , 2004, DOI: 10.4064/aa118-3-4
Abstract: The set B_{p,r}^q:=\{\floor{nq/p+r} \colon n\in Z \} with integers p, q, r) is a Beatty set with density p/q. We derive a formula for the Fourier transform \hat{B_{p,r}^q}(j):=\sum_{n=1}^p e^{-2 \pi i j \floor{nq/p+r} / q}. A. S. Fraenkel conjectured that there is essentially one way to partition the integers into m>2 Beatty sets with distinct densities. We conjecture a generalization of this, and use Fourier methods to prove several special cases of our generalized conjecture.
Can you hear the shape of a Beatty sequence?
Ron Graham,Kevin O'Bryant
Mathematics , 2008,
Abstract: Let K(x_1,...,x_d) be a polynomial. If you are not given the real numbers \alpha_1, \alpha_2, ...,\alpha_d, but are given the polynomial K and the sequence a_n=K(\floor{n\alpha_1},\floor{n\alpha_2},...,\floor{n\alpha_d}), can you deduce the values of \alpha_i? Not, it turns out, in general. But with additional irrationality hypotheses and certain polynomials, it is possible. We also consider the problem of deducing \alpha_i from the integer sequence with nested flooring (\floor{\floor{... \floor{\floor{n\alpha_1}\alpha_2}... \alpha_{d-1}}\alpha_d})_{n=1}^\infty.
On minimal colorings without monochromatic solutions to a linear equation
Boris Alexeev,Jacob Fox,Ron Graham
Mathematics , 2010,
Abstract: For a ring R and system L of linear homogeneous equations, we call a coloring of the nonzero elements of R minimal for L if there are no monochromatic solutions to L and the coloring uses as few colors as possible. For a rational number q and positive integer n, let E(q,n) denote the equation $\sum_{i=0}^{n-2} q^{i}x_i = q^{n-1}x_{n-1}$. We classify the minimal colorings of the nonzero rational numbers for each of the equations E(q,3) with q in {3/2,2,3,4}, for E(2,n) with n in {3,4,5,6}, and for x_1+x_2+x_3=4x_4. These results lead to several open problems and conjectures on minimal colorings.
Unrolling residues to avoid progressions
Steve Butler,Ron Graham,Linyuan Lu
Mathematics , 2012,
Abstract: We consider the problem of coloring $[n]={1,2,...,n}$ with $r$ colors to minimize the number of monochromatic $k$ term arithmetic progressions (or $k$-APs for short). We show how to extend colorings of $\mathbb{Z}_m$ which avoid nontrivial $k$-APs to colorings of $[n]$ by an unrolling process. In particular, by using residues to color $\mathbb{Z}_m$ we produce the best known colorings for minimizing the number of monochromatic $k$-APs for coloring with $r$ colors for several small values of $r$ and $k$.
Jumping sequences
Steve Butler,Ron Graham,Nan Zang
Mathematics , 2008,
Abstract: An integer sequence a(n) is called a jump sequence if a(1)=1 and 1<=a(n)=2. Such a sequence has the property that a^k(n)=a(a(...(a(n))...)) goes to 1 in finitely many steps and we call the pattern (n,a(n),a^2(n),...,a^k(n)=1) a jumping pattern from n down to 1. In this paper we look at jumping sequences which are weight minimizing with respect to various weight functions (where a weight w(i,j) is given to each jump from j down to i). Our main result is to show that if w(i,j)=(i+j)/i^2 then the cost minimizing jump sequence has the property that the number m satisfies m=a^q(p) for arbitrary q and some p (depending on q) if and only if m is a Pell number.
Partition and sum is fast
Steve Butler,Ron Graham,Richard Stong
Mathematics , 2015,
Abstract: We consider the following "partition and sum" operation on a natural number: Treating the number as a long string of digits insert several plus signs in between some of the digits and carry out the indicated sum. This results in a smaller number and repeated application can always reduce the number to a single digit. We show that surprisingly few iterations of this operation are needed to get down to a single digit.
Page 1 /4871
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.