Edge-Orders

Canonical orderings and their relatives such as st-numberings have been used as a key tool in algorithmic graph theory for the last decades. Recently, a unifying concept behind all these orders has been shown: they can be described by a graph decomposition into parts that have a prescribed vertex-connectivity. Despite extensive interest in canonical orderings, no analogue of this unifying concept is known for edge-connectivity. In this paper, we establish such a concept named edge-orders and show how to compute (1,1)-edge-orders of 2-edge-connected graphs as well as (2,1)-edge-orders of 3-edge-connected graphs in linear time, respectively. While the former can be seen as the edge-variants of st-numberings, the latter are the edge-variants of Mondshein sequences and non-separating ear decompositions. The methods that we use for obtaining such edge-orders differ considerably in almost all details from the ones used for their vertex-counterparts, as different graph-theoretic constructions are used in the inductive proof and standard reductions from edge- to vertex-connectivity are bound to fail. As a first application, we consider the famous Edge-Independent Spanning Tree Conjecture, which asserts that every k-edge-connected graph contains k rooted spanning trees that are pairwise edge-independent. We illustrate the impact of the above edge-orders by deducing algorithms that construct 2- and 3-edge independent spanning trees of 2- and 3-edge-connected graphs, the latter of which improves the best known running time from O(n^2) to linear time

The definability criterions for convex projective polyhedral reflection groups

Following Vinberg, we find the criterions for a subgroup generated by reflections \Gamma \subset \SL^{\pm}(n+1,\mathbb{R}) and its finite-index subgroups to be definable over $\mathbb{A}$ where $\mathbb{A}$ is an integrally closed Noetherian ring in the field $\mathbb{R}$. We apply the criterions for groups generated by reflections that act cocompactly on irreducible properly convex open subdomains of the $n$-dimensional projective sphere. This gives a method for constructing injective group homomorphisms from such Coxeter groups to \SL^{\pm}(n+1,\mathbb{Z}). Finally we provide some examples of \SL^{\pm}(n+1,\mathbb{Z})-representations of such Coxeter groups. In particular, we consider simplicial reflection groups that are isomorphic to hyperbolic simplicial groups and classify all the conjugacy classes of the reflection subgroups in \SL^{\pm}(n+1,\mathbb{R}) that are definable over $\mathbb{Z}$. These were known by Goldman, Benoist, and so on previously.Comment: 31 pages, 8 figure

The convex real projective orbifolds with radial or totally geodesic ends: a survey of some partial results

A real projective orbifold has a radial end if a neighborhood of the end is foliated by projective geodesics that develop into geodesics ending at a common point. It has a totally geodesic end if the end can be completed to have the totally geodesic boundary. The purpose of this paper is to announce some partial results. A real projective structure sometimes admits deformations to parameters of real projective structures. We will prove a homeomorphism between the deformation space of convex real projective structures on an orbifold $\mathcal{O}$ with radial or totally geodesic ends with various conditions with the union of open subspaces of strata of the corresponding subset of $$Hom(\pi_{1}(\mathcal{O}), PGL(n+1, \mathbb{R}))/PGL(n+1, \mathbb{R}).$$ Lastly, we will talk about the openness and closedness of the properly (resp. strictly) convex real projective structures on a class of orbifold with generalized admissible ends.Comment: 36 pages, 2 figure. Corrected a few mistakes including the condition (NA) on page 22, arXiv admin note: text overlap with arXiv:1011.106

Encoding !-tensors as !-graphs with neighbourhood orders

Diagrammatic reasoning using string diagrams provides an intuitive language for reasoning about morphisms in a symmetric monoidal category. To allow working with infinite families of string diagrams, !-graphs were introduced as a method to mark repeated structure inside a diagram. This led to !-graphs being implemented in the diagrammatic proof assistant Quantomatic. Having a partially automated program for rewriting diagrams has proven very useful, but being based on !-graphs, only commutative theories are allowed. An enriched abstract tensor notation, called !-tensors, has been used to formalise the notion of !-boxes in non-commutative structures. This work-in-progress paper presents a method to encode !-tensors as !-graphs with some additional structure. This will allow us to leverage the existing code from Quantomatic and quickly provide various tools for non-commutative diagrammatic reasoning.Comment: In Proceedings QPL 2015, arXiv:1511.0118

Similarity measures for mid-surface quality evaluation

Mid-surface models are widely used in engineering analysis to simplify the analysis of thin-walled parts, but it can be difficult to ensure that the mid-surface model is representative of the solid part from which it was generated. This paper proposes two similarity measures that can be used to evaluate the quality of a mid-surface model by comparing it to a solid model of the same part. Two similarity measures are proposed; firstly a geometric similarity evaluation technique based on the Hausdorff distance and secondly a topological similarity evaluation method which uses geometry graph attributes as the basis for comparison. Both measures are able to provide local and global similarity evaluation for the models. The proposed methods have been implemented in a software demonstrator and tested on a selection of representative models. They have been found to be effective for identifying geometric and topological errors in mid-surface models and are applicable to a wide range of practical thin-walled designs

Deterministic Automata for Unordered Trees

Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in Json or Xml format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper notion of determinism, which makes it difficult to distinguish subclasses of automata for which problems such as inclusion, equivalence, and minimization can be solved efficiently. In this paper, we propose and investigate different notions of "horizontal determinism", starting from automata for unranked trees in which the horizontal evaluation is performed by finite state automata. We show that a restriction to confluent horizontal evaluation leads to polynomial-time emptiness and universality, but still suffers from coNP-completeness of the emptiness of binary intersections. Finally, efficient algorithms can be obtained by imposing an order of horizontal evaluation globally for all automata in the class. Depending on the choice of the order, we obtain different classes of automata, each of which has the same expressiveness as CMso.Comment: In Proceedings GandALF 2014, arXiv:1408.556