122 research outputs found
On a combinatorial problem of Erdos, Kleitman and Lemke
In this paper, we study a combinatorial problem originating in the following
conjecture of Erdos and Lemke: given any sequence of n divisors of n,
repetitions being allowed, there exists a subsequence the elements of which are
summing to n. This conjecture was proved by Kleitman and Lemke, who then
extended the original question to a problem on a zero-sum invariant in the
framework of finite Abelian groups. Building among others on earlier works by
Alon and Dubiner and by the author, our main theorem gives a new upper bound
for this invariant in the general case, and provides its right order of
magnitude.Comment: 15 page
Modified Linear Programming and Class 0 Bounds for Graph Pebbling
Given a configuration of pebbles on the vertices of a connected graph , a
\emph{pebbling move} removes two pebbles from some vertex and places one pebble
on an adjacent vertex. The \emph{pebbling number} of a graph is the
smallest integer such that for each vertex and each configuration of
pebbles on there is a sequence of pebbling moves that places at least
one pebble on .
First, we improve on results of Hurlbert, who introduced a linear
optimization technique for graph pebbling. In particular, we use a different
set of weight functions, based on graphs more general than trees. We apply this
new idea to some graphs from Hurlbert's paper to give improved bounds on their
pebbling numbers.
Second, we investigate the structure of Class 0 graphs with few edges. We
show that every -vertex Class 0 graph has at least
edges. This disproves a conjecture of Blasiak et al. For diameter 2 graphs, we
strengthen this lower bound to , which is best possible. Further, we
characterize the graphs where the bound holds with equality and extend the
argument to obtain an identical bound for diameter 2 graphs with no cut-vertex.Comment: 19 pages, 8 figure
Thresholds for zero-sums with small cross numbers in abelian groups
For an additive group the sequence of
elements of is a zero-sum sequence if .
The cross number of is defined to be the sum , where
denotes the order of in . Call good if it contains a
zero-sum subsequence with cross number at most 1. In 1993, Geroldinger proved
that if is abelian then every length sequence of its
elements is good, generalizing a 1989 result of Lemke and Kleitman that had
proved an earlier conjecture of Erd\H{o}s and Lemke. In 1989 Chung re-proved
the Lemke and Kleitman result by applying a theorem of graph pebbling, and in
2005, Elledge and Hurlbert used graph pebbling to re-prove and generalize
Geroldinger's result. Here we use probabilistic theorems from graph pebbling to
derive a sharp threshold version of Geroldinger's theorem for abelian groups of
a certain form. Specifically, we prove that if are (not
necessarily distinct) primes and has the form then there is a function (which we specify
in Theorem 4) with the following property: if as
then the probability that is good in tends
to 1, while if then that probability tends to 0
- …