1,787 research outputs found
Self-Improving Algorithms
We investigate ways in which an algorithm can improve its expected
performance by fine-tuning itself automatically with respect to an unknown
input distribution D. We assume here that D is of product type. More precisely,
suppose that we need to process a sequence I_1, I_2, ... of inputs I = (x_1,
x_2, ..., x_n) of some fixed length n, where each x_i is drawn independently
from some arbitrary, unknown distribution D_i. The goal is to design an
algorithm for these inputs so that eventually the expected running time will be
optimal for the input distribution D = D_1 * D_2 * ... * D_n.
We give such self-improving algorithms for two problems: (i) sorting a
sequence of numbers and (ii) computing the Delaunay triangulation of a planar
point set. Both algorithms achieve optimal expected limiting complexity. The
algorithms begin with a training phase during which they collect information
about the input distribution, followed by a stationary regime in which the
algorithms settle to their optimized incarnations.Comment: 26 pages, 8 figures, preliminary versions appeared at SODA 2006 and
SoCG 2008. Thorough revision to improve the presentation of the pape
Feynman Diagrams of Generalized Matrix Models and the Associated Manifolds in Dimension 4
The problem of constructing a quantum theory of gravity has been tackled with
very different strategies, most of which relying on the interplay between ideas
from physics and from advanced mathematics. On the mathematical side, a central
role is played by combinatorial topology, often used to recover the space-time
manifold from the other structures involved. An extremely attractive
possibility is that of encoding all possible space-times as specific Feynman
diagrams of a suitable field theory. In this work we analyze how exactly one
can associate combinatorial 4-manifolds to the Feynman diagrams of certain
tensor theories.Comment: 25 pages, 10 figures. Minor cange
A Generating Function for all Semi-Magic Squares and the Volume of the Birkhoff Polytope
We present a multivariate generating function for all n x n nonnegative
integral matrices with all row and column sums equal to a positive integer t,
the so called semi-magic squares. As a consequence we obtain formulas for all
coefficients of the Ehrhart polynomial of the polytope B_n of n x n
doubly-stochastic matrices, also known as the Birkhoff polytope. In particular
we derive formulas for the volumes of B_n and any of its faces.Comment: 24 pages, 1 figure. To appear in Journal of Algebraic Combinatoric
Shortest Path in a Polygon using Sublinear Space
\renewcommand{\Re}{{\rm I\!\hspace{-0.025em} R}}
\newcommand{\SetX}{\mathsf{X}} \newcommand{\VorX}[1]{\mathcal{V} \pth{#1}}
\newcommand{\Polygon}{\mathsf{P}} \newcommand{\Space}{\overline{\mathsf{m}}}
\newcommand{\pth}[2][\!]{#1\left({#2}\right)} We resolve an open problem due
to Tetsuo Asano, showing how to compute the shortest path in a polygon, given
in a read only memory, using sublinear space and subquadratic time.
Specifically, given a simple polygon \Polygon with vertices in a read
only memory, and additional working memory of size \Space, the new algorithm
computes the shortest path (in \Polygon) in O( n^2 /\, \Space ) expected
time. This requires several new tools, which we believe to be of independent
interest
Subword complexes via triangulations of root polytopes
Subword complexes are simplicial complexes introduced by Knutson and Miller
to illustrate the combinatorics of Schubert polynomials and determinantal
ideals. They proved that any subword complex is homeomorphic to a ball or a
sphere and asked about their geometric realizations. We show that a family of
subword complexes can be realized geometrically via regular triangulations of
root polytopes. This implies that a family of -Grothendieck polynomials
are special cases of reduced forms in the subdivision algebra of root
polytopes. We can also write the volume and Ehrhart series of root polytopes in
terms of -Grothendieck polynomials.Comment: 17 pages, 15 figure
- …