67,867 research outputs found
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings
Consider a directed or an undirected graph with integral edge weights from
the set [-W, W], that does not contain negative weight cycles. In this paper,
we introduce a general framework for solving problems on such graphs using
matrix multiplication. The framework is based on the usage of Baur-Strassen's
theorem and of Strojohann's determinant algorithm. It allows us to give new and
simple solutions to the following problems:
* Finding Shortest Cycles -- We give a simple \tilde{O}(Wn^{\omega}) time
algorithm for finding shortest cycles in undirected and directed graphs. For
directed graphs (and undirected graphs with non-negative weights) this matches
the time bounds obtained in 2011 by Roditty and Vassilevska-Williams. On the
other hand, no algorithm working in \tilde{O}(Wn^{\omega}) time was previously
known for undirected graphs with negative weights. Furthermore our algorithm
for a given directed or undirected graph detects whether it contains a negative
weight cycle within the same running time.
* Computing Diameter and Radius -- We give a simple \tilde{O}(Wn^{\omega})
time algorithm for computing a diameter and radius of an undirected or directed
graphs. To the best of our knowledge no algorithm with this running time was
known for undirected graphs with negative weights.
* Finding Minimum Weight Perfect Matchings -- We present an
\tilde{O}(Wn^{\omega}) time algorithm for finding minimum weight perfect
matchings in undirected graphs. This resolves an open problem posted by
Sankowski in 2006, who presented such an algorithm but only in the case of
bipartite graphs.
In order to solve minimum weight perfect matching problem we develop a novel
combinatorial interpretation of the dual solution which sheds new light on this
problem. Such a combinatorial interpretation was not know previously, and is of
independent interest.Comment: To appear in FOCS 201
The absolute order on the hyperoctahedral group
The absolute order on the hyperoctahedral group is investigated. It is
proved that the order ideal of this poset generated by the Coxeter elements is
homotopy Cohen-Macaulay and the M\"obius number of this ideal is computed.
Moreover, it is shown that every closed interval in the absolute order on
is shellable and an example of a non-Cohen-Macaulay interval in the absolute
order on is given. Finally, the closed intervals in the absolute order on
and which are lattices are characterized and some of their
important enumerative invariants are computed.Comment: 26 pages, 6 figures. Theorem 1.3 of the previous version of this
paper is omitted due to a gap in the proof
A two-sided analogue of the Coxeter complex
For any Coxeter system of rank , we introduce an abstract boolean
complex (simplicial poset) of dimension that contains the Coxeter
complex as a relative subcomplex. Faces are indexed by triples , where
and are subsets of the set of simple generators, and is a
minimal length representative for the parabolic double coset . There
is exactly one maximal face for each element of the group . The complex is
shellable and thin, which implies the complex is a sphere for the finite
Coxeter groups. In this case, a natural refinement of the -polynomial is
given by the "two-sided" -Eulerian polynomial, i.e., the generating function
for the joint distribution of left and right descents in .Comment: 26 pages, several large tables and figure
Largest minimally inversion-complete and pair-complete sets of permutations
We solve two related extremal problems in the theory of permutations. A set Q of permutations of the integers 1 to n is inversion-complete (resp., pair-complete) if for every
inversion (j; i), where 1 j), where i 6= j), there exists a permutation in Q where j is before i. It is minimally inversion-complete if in addition no proper subset of Q is inversion-complete; and similarly for pair-completeness. The problems we consider are to determine the maximum cardinality of a minimal inversion- complete set of permutations, and that of a minimal pair-complete set of permutations. The latter problem arises in the determination of the Caratheodory numbers for certain abstract convexity structures on the (n1)-dimensional real and integer vector spaces. Using Mantel's Theorem on the maximum number of edges in a triangle-free graph, we determine these two maximum cardinalities and we present a complete description of the optimal sets of permutations for each problem. Perhaps surprisingly (since there are twice as many pairs to cover as inversions), these two maximum cardinalities coincide when ever n>=4
- …