• Corpus ID: 53589255

The Bidirectional Ballot Polytope

@article{Miller2018TheBB,
  title={The Bidirectional Ballot Polytope},
  author={Steven J. Miller and Carsten Peterson and Carsten Sprunger and Roger Van Peski},
  journal={Integers},
  year={2018},
  volume={18},
  pages={A81}
}
A bidirectional ballot sequence (BBS) is a finite binary sequence with the property that every prefix and suffix contains strictly more ones than zeros. BBS's were introduced by Zhao, and independently by Bosquet-M{e}lou and Ponty as $(1,1)$-culminating paths. Both sets of authors noted the difficulty in counting these objects, and to date research on bidirectional ballot sequences has been concerned with asymptotics. We introduce a continuous analogue of bidirectional ballot sequences which we… 
2 Citations

Figures and Tables from this paper

S ep 2 01 7 A GEOMETRIC PERSPECTIVE ON THE MSTD QUESTION
A more sums than differences (MSTD) set A is a subset of Z for which |A + A| > |A − A|. Martin and O’Bryant used probabilistic techniques to prove that a non-vanishing proportion of subsets of {1, .
A Geometric Perspective on the MSTD Question
TLDR
Every finite subset of Z can be transformed into an element of I with the same additive behavior, and it is shown that there are no MSTD sets in I consisting of three or fewer intervals, but there are M STD sets for four or more intervals.

References

SHOWING 1-10 OF 20 REFERENCES
Analysis of Bidirectional Ballot Sequences and Random Walks Ending in Their Maximum
Consider non-negative lattice paths ending at their maximum height, which will be called admissible paths. We show that the probability for a lattice path to be admissible is related to the Chebyshev
A Geometric Perspective on the MSTD Question
TLDR
Every finite subset of Z can be transformed into an element of I with the same additive behavior, and it is shown that there are no MSTD sets in I consisting of three or fewer intervals, but there are M STD sets for four or more intervals.
FLASH: a fast look-up algorithm for string homology
  • A. Califano, I. Rigoutsos
  • Computer Science
    Proceedings of IEEE Conference on Computer Vision and Pattern Recognition
  • 1993
TLDR
The algorithm presented is based on a probabilistic indexing framework which requires minimal access to the database for each match, and is shown to scale well to databases containing billions of nucleotides with performances that are orders of magnitude better than the fastest of the current techniques.
Introduction to linear optimization
p. 27, l. −11, replace “Schwartz” by “Schwarz” p. 69, l. −13: “ai∗x = bi” should be “ai∗x = bi∗” p. 126, l. 16, replace “inequality constraints” by “linear inequality constraints” p. 153, l. −8,
Improved tools for biological sequence comparison.
  • W. Pearson, D. Lipman
  • Biology, Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 1988
TLDR
Three computer programs for comparisons of protein and DNA sequences can be used to search sequence data bases, evaluate similarity scores, and identify periodic structures based on local sequence similarity.
Basic local alignment search tool.
Lipm an, Basic local alignment search tool, J
  • Molecular Biology215(1990),
  • 1990
...
...