The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs

AbstractIn this paper, we consider the complexity of a number of combinatorial problems; namely, Intervalizing Colored Graphs (DNA physical mapping), Triangulating Colored Graphs (perfect phylogeny), (Directed) (Modified) Colored Cutwidth, Feasible Register Assignment and Module Allocation for graphs of bounded pathwidth. Each of these problems has as a characteristic a uniform upper bound on the tree or path width of the graphs in “yes”-instances. For all of these problems with the exceptions of Feasible Register Assignment and Module Allocation, a vertex or edge coloring is given as part of the input. Our main results are that the parameterized variant of each of the considered problems is hard for the complexity classes W[t] for all t∈N. We also show that Intervalizing Colored Graphs, Triangulating Colored Graphs, and Colored Cutwidth are NP-Complete

The full Schwinger-Dyson tower for random tensor models

We treat random rank-$D$ tensor models as $D$-dimensional quantum field theories---tensor field theories (TFT)---and review some of their non-perturbative methods. We classify the correlation functions of complex tensor field theories by boundary graphs, sketch the derivation of the Ward-Takahashi identity and stress its relevance in the derivation of the tower of exact, analytic Schwinger-Dyson equations for all the correlation functions (with connected boundary) of TFTs with quartic pillow-like interactions.Comment: Proceedings: Corfu 2017 Training School "Quantum Spacetime and Physics Models

Some Triangulated Surfaces without Balanced Splitting

Let G be the graph of a triangulated surface $\Sigma$ of genus $g\geq 2$. A cycle of G is splitting if it cuts $\Sigma$ into two components, neither of which is homeomorphic to a disk. A splitting cycle has type k if the corresponding components have genera k and g-k. It was conjectured that G contains a splitting cycle (Barnette '1982). We confirm this conjecture for an infinite family of triangulations by complete graphs but give counter-examples to a stronger conjecture (Mohar and Thomassen '2001) claiming that G should contain splitting cycles of every possible type.Comment: 15 pages, 7 figure

Hand Keypoint Detection in Single Images using Multiview Bootstrapping

We present an approach that uses a multi-camera system to train fine-grained detectors for keypoints that are prone to occlusion, such as the joints of a hand. We call this procedure multiview bootstrapping: first, an initial keypoint detector is used to produce noisy labels in multiple views of the hand. The noisy detections are then triangulated in 3D using multiview geometry or marked as outliers. Finally, the reprojected triangulations are used as new labeled training data to improve the detector. We repeat this process, generating more labeled data in each iteration. We derive a result analytically relating the minimum number of views to achieve target true and false positive rates for a given detector. The method is used to train a hand keypoint detector for single images. The resulting keypoint detector runs in realtime on RGB images and has accuracy comparable to methods that use depth sensors. The single view detector, triangulated over multiple views, enables 3D markerless hand motion capture with complex object interactions.Comment: CVPR 201

Bosonic Colored Group Field Theory

Bosonic colored group field theory is considered. Focusing first on dimension four, namely the colored Ooguri group field model, the main properties of Feynman graphs are studied. This leads to a theorem on optimal perturbative bounds of Feynman amplitudes in the "ultraspin" (large spin) limit. The results are generalized in any dimension. Finally integrating out two colors we write a new representation which could be useful for the constructive analysis of this type of models

Coloring Graphs Drawn with Crossings

This dissertation will examine various results for graph colorings. It begins by introducing some basic graph theory concepts, focusing on those ideas relevant to graph embeddings, and by introducing terminology to allow a formal discussion of drawings of graphs. Chapter 2 focuses on results for proper colorings of graphs with good drawings, using a previous result from Král and Stacho as inspiration. Chapter 3 expands on the ideas of Chapter 2 and focuses on cyclic colorings of embedded graphs. Chapters 5 and 6 examine results for total and list colorings, respectively, of drawings of graphs. Finally, Chapter 6 introduces generalized pseudosurfaces and examines results for proper and cyclic colorings of graphs embedded in generalized pseudosurfaces