70,541 research outputs found
Graph isomorphism completeness for trapezoid graphs
The complexity of the graph isomorphism problem for trapezoid graphs has been
open over a decade. This paper shows that the problem is GI-complete. More
precisely, we show that the graph isomorphism problem is GI-complete for
comparability graphs of partially ordered sets with interval dimension 2 and
height 3. In contrast, the problem is known to be solvable in polynomial time
for comparability graphs of partially ordered sets with interval dimension at
most 2 and height at most 2.Comment: 4 pages, 3 Postscript figure
Primary Facets Of Order Polytopes
Mixture models on order relations play a central role in recent
investigations of transitivity in binary choice data. In such a model, the
vectors of choice probabilities are the convex combinations of the
characteristic vectors of all order relations of a chosen type. The five
prominent types of order relations are linear orders, weak orders, semiorders,
interval orders and partial orders. For each of them, the problem of finding a
complete, workable characterization of the vectors of probabilities is
crucial---but it is reputably inaccessible. Under a geometric reformulation,
the problem asks for a linear description of a convex polytope whose vertices
are known. As for any convex polytope, a shortest linear description comprises
one linear inequality per facet. Getting all of the facet-defining inequalities
of any of the five order polytopes seems presently out of reach. Here we search
for the facet-defining inequalities which we call primary because their
coefficients take only the values -1, 0 or 1. We provide a classification of
all primary, facet-defining inequalities of three of the five order polytopes.
Moreover, we elaborate on the intricacy of the primary facet-defining
inequalities of the linear order and the weak order polytopes
On multipartite posets
A poset is {\em -partite} if has a
partition such that (1) each forms an
antichain in , and (2) implies and
where . In this article we derive a tight asymptotic upper bound on the
order dimension of -partite posets in terms of and their bipartite
sub-posets in a constructive and elementary way.Comment: 6 page
Sequences of rational torsions on abelian varieties
We address the question of how fast the available rational torsion on abelian varieties over Q increases with dimension. The emphasis will be on the derivation of sequences of torsion divisors on hyperelliptic curves. Work of Hellegouarch and Lozach (and Klein) may be made explicit to provide sequences of curves with rational torsion divisors of orders increasing linearly with respect to genus. The main results are applications of a new technique which provide sequences of hyperelliptic curves for all torsions in an interval where is quadratic in g and is linear in g. As well as providing an improvement from linear to quadratic, these results provide a wide selection of torsion orders for potential use by those involved in computer integration. We conclude by considering possible techniques for divisors of non-hyperelliptic curves, and for general abelian varieties
- …