3,096 research outputs found

    Recognizing halved cubes in a constant time per edge

    Get PDF
    AbstractGraphs that can be isometrically embedded into the metric space l1 are called l1-graphs. Halved cubes play an important role in the characterization of l1-graphs. We present an algorithm that recognizes halved cubes in O(n log2 n) time

    Primary Non-QE Graphs on Six Vertices

    Full text link
    A connected graph is called of non-QE class if it does not admit a quadratic embedding in a Euclidean space. A non-QE graph is called primary if it does not contain a non-QE graph as an isometrically embedded proper subgraph. The graphs on six vertices are completely classified into the classes of QE graphs, of non-QE graphs, and of primary non-QE graphs.Comment: arXiv admin note: text overlap with arXiv:2206.0584

    Characterizations of the Suzuki tower near polygons

    Get PDF
    In recent work, we constructed a new near octagon G\mathcal{G} from certain involutions of the finite simple group G2(4)G_2(4) and showed a correspondence between the Suzuki tower of finite simple groups, L3(2)<U3(3)<J2<G2(4)<SuzL_3(2) < U_3(3) < J_2 < G_2(4) < Suz, and the tower of near polygons, H(2,1)H(2)DHJG\mathrm{H}(2,1) \subset \mathrm{H}(2)^D \subset \mathsf{HJ} \subset \mathcal{G}. Here we characterize each of these near polygons (except for the first one) as the unique near polygon of the given order and diameter containing an isometrically embedded copy of the previous near polygon of the tower. In particular, our characterization of the Hall-Janko near octagon HJ\mathsf{HJ} is similar to an earlier characterization due to Cohen and Tits who proved that it is the unique regular near octagon with parameters (2,4;0,3)(2, 4; 0, 3), but instead of regularity we assume existence of an isometrically embedded dual split Cayley hexagon, H(2)D\mathrm{H}(2)^D. We also give a complete classification of near hexagons of order (2,2)(2, 2) and use it to prove the uniqueness result for H(2)D\mathrm{H}(2)^D.Comment: 20 pages; some revisions based on referee reports; added more references; added remarks 1.4 and 1.5; corrected typos; improved the overall expositio

    Embedding of metric graphs on hyperbolic surfaces

    Full text link
    An embedding of a metric graph (G,d)(G, d) on a closed hyperbolic surface is \emph{essential}, if each complementary region has a negative Euler characteristic. We show, by construction, that given any metric graph, its metric can be rescaled so that it admits an essential and isometric embedding on a closed hyperbolic surface. The essential genus ge(G)g_e(G) of (G,d)(G, d) is the lowest genus of a surface on which such an embedding is possible. In the next result, we establish a formula to compute ge(G)g_e(G). Furthermore, we show that for every integer gge(G)g\geq g_e(G), (G,d)(G, d) admits such an embedding (possibly after a rescaling of dd) on a surface of genus gg. Next, we study minimal embeddings where each complementary region has Euler characteristic 1-1. The maximum essential genus gemax(G)g_e^{\max}(G) of (G,d)(G, d) is the largest genus of a surface on which the graph is minimally embedded. Finally, we describe a method explicitly for an essential embedding of (G,d)(G, d), where ge(G)g_e(G) and gemax(G)g_e^{\max}(G) are realized.Comment: Revised version, 11 pages, 3 figure

    Coarse geometry of the fire retaining property and group splittings

    Full text link
    Given a non-decreasing function f ⁣:NNf \colon \mathbb{N} \to \mathbb{N} we define a single player game on (infinite) connected graphs that we call fire retaining. If a graph GG admits a winning strategy for any initial configuration (initial fire) then we say that GG has the ff-retaining property; in this case if ff is a polynomial of degree dd, we say that GG has the polynomial retaining property of degree dd. We prove that having the polynomial retaining property of degree dd is a quasi-isometry invariant in the class of uniformly locally finite connected graphs. Henceforth, the retaining property defines a quasi-isometric invariant of finitely generated groups. We prove that if a finitely generated group GG splits over a quasi-isometrically embedded subgroup of polynomial growth of degree dd, then GG has polynomial retaining property of degree d1d-1. Some connections to other work on quasi-isometry invariants of finitely generated groups are discussed and some questions are raised.Comment: 16 pages, 1 figur
    corecore