30,893 research outputs found
A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs
We consider the problem of computing all-pairs shortest paths in a directed
graph with real weights assigned to vertices.
For an 0-1 matrix let be the complete weighted graph
on the rows of where the weight of an edge between two rows is equal to
their Hamming distance. Let be the weight of a minimum weight spanning
tree of
We show that the all-pairs shortest path problem for a directed graph on
vertices with nonnegative real weights and adjacency matrix can be
solved by a combinatorial randomized algorithm in time
As a corollary, we conclude that the transitive closure of a directed graph
can be computed by a combinatorial randomized algorithm in the
aforementioned time.
We also conclude that the all-pairs shortest path problem for uniform disk
graphs, with nonnegative real vertex weights, induced by point sets of bounded
density within a unit square can be solved in time
Density of isoperimetric spectra
We show that the set of k-dimensional isoperimetric exponents of finitely
presented groups is dense in the interval [1, \infty) for k > 1. Hence there is
no higher-dimensional analogue of Gromov's gap (1,2) in the isoperimetric
spectrum.Comment: 34 pages, 3 figure
A general tool for consistency results related to I1
In this paper we provide a general tool to prove the consistency of
with various combinatorial properties at typical at
settings with , that does not need a profound knowledge of
the forcing notions involved. Examples of such properties are the first failure
of GCH, a very good scale and the negation of the approachability property, or
the tree property at and
Measure Recognition Problem
This is an article in mathematics, specifically in set theory. On the example
of the Measure Recognition Problem (MRP) the article highlights the phenomenon
of the utility of a multidisciplinary mathematical approach to a single
mathematical problem, in particular the value of a set-theoretic analysis. MRP
asks if for a given Boolean algebra \algB and a property of measures
one can recognize by purely combinatorial means if \algB supports a strictly
positive measure with property . The most famous instance of this problem
is MRP(countable additivity), and in the first part of the article we survey
the known results on this and some other problems. We show how these results
naturally lead to asking about two other specific instances of the problem MRP,
namely MRP(nonatomic) and MRP(separable). Then we show how our recent work D\v
zamonja and Plebanek (2006) gives an easy solution to the former of these
problems, and gives some partial information about the latter. The long term
goal of this line of research is to obtain a structure theory of Boolean
algebras that support a finitely additive strictly positive measure, along the
lines of Maharam theorem which gives such a structure theorem for measure
algebras
- …