26,991 research outputs found
On grounded L-graphs and their relatives
We consider the graph class Grounded-L corresponding to graphs that admit an
intersection representation by L-shaped curves, where additionally the topmost
points of each curve are assumed to belong to a common horizontal line. We
prove that Grounded-L graphs admit an equivalent characterisation in terms of
vertex ordering with forbidden patterns.
We also compare this class to related intersection classes, such as the
grounded segment graphs, the monotone L-graphs (a.k.a. max point-tolerance
graphs), or the outer-1-string graphs. We give constructions showing that these
classes are all distinct and satisfy only trivial or previously known
inclusions.Comment: 16 pages, 6 figure
Properties of continuous Fourier extension of the discrete cosine transform and its multidimensional generalization
A versatile method is described for the practical computation of the discrete
Fourier transforms (DFT) of a continuous function given by its values
at the points of a uniform grid generated by conjugacy classes
of elements of finite adjoint order in the fundamental region of
compact semisimple Lie groups. The present implementation of the method is for
the groups SU(2), when is reduced to a one-dimensional segment, and for
in multidimensional cases. This simplest case
turns out to result in a transform known as discrete cosine transform (DCT),
which is often considered to be simply a specific type of the standard DFT.
Here we show that the DCT is very different from the standard DFT when the
properties of the continuous extensions of these two discrete transforms from
the discrete grid points to all points are
considered. (A) Unlike the continuous extension of the DFT, the continuous
extension of (the inverse) DCT, called CEDCT, closely approximates
between the grid points . (B) For increasing , the derivative of CEDCT
converges to the derivative of . And (C), for CEDCT the principle of
locality is valid. Finally, we use the continuous extension of 2-dimensional
DCT to illustrate its potential for interpolation, as well as for the data
compression of 2D images.Comment: submitted to JMP on April 3, 2003; still waiting for the referee's
Repor
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
On the intersection of tolerance and cocomparability graphs.
It has been conjectured by Golumbic and Monma in 1984 that the intersection of tolerance and cocomparability graphs coincides with bounded tolerance graphs. Since cocomparability graphs can be efficiently recognized, a positive answer to this conjecture in the general case would enable us to efficiently distinguish between tolerance and bounded tolerance graphs, although it is NP-complete to recognize each of these classes of graphs separately. The conjecture has been proved under some – rather strong – structural assumptions on the input graph; in particular, it has been proved for complements of trees, and later extended to complements of bipartite graphs, and these are the only known results so far. Furthermore, it is known that the intersection of tolerance and cocomparability graphs is contained in the class of trapezoid graphs. In this article we prove that the above conjecture is true for every graph G, whose tolerance representation satisfies a slight assumption; note here that this assumption concerns only the given tolerance representation R of G, rather than any structural property of G. This assumption on the representation is guaranteed by a wide variety of graph classes; for example, our results immediately imply the correctness of the conjecture for complements of triangle-free graphs (which also implies the above-mentioned correctness for complements of bipartite graphs). Our proofs are algorithmic, in the sense that, given a tolerance representation R of a graph G, we describe an algorithm to transform R into a bounded tolerance representation R  ∗  of G. Furthermore, we conjecture that any minimal tolerance graph G that is not a bounded tolerance graph, has a tolerance representation with exactly one unbounded vertex. Our results imply the non-trivial result that, in order to prove the conjecture of Golumbic and Monma, it suffices to prove our conjecture. In addition, there already exists evidence in the literature that our conjecture is true
- …