110 research outputs found
On the Complexity of Digraph Colourings and Vertex Arboricity
It has been shown by Bokal et al. that deciding 2-colourability of digraphs
is an NP-complete problem. This result was later on extended by Feder et al. to
prove that deciding whether a digraph has a circular -colouring is
NP-complete for all rational . In this paper, we consider the complexity
of corresponding decision problems for related notions of fractional colourings
for digraphs and graphs, including the star dichromatic number, the fractional
dichromatic number and the circular vertex arboricity. We prove the following
results:
Deciding if the star dichromatic number of a digraph is at most is
NP-complete for every rational .
Deciding if the fractional dichromatic number of a digraph is at most is
NP-complete for every .
Deciding if the circular vertex arboricity of a graph is at most is
NP-complete for every rational .
To show these results, different techniques are required in each case. In
order to prove the first result, we relate the star dichromatic number to a new
notion of homomorphisms between digraphs, called circular homomorphisms, which
might be of independent interest. We provide a classification of the
computational complexities of the corresponding homomorphism colouring problems
similar to the one derived by Feder et al. for acyclic homomorphisms.Comment: 21 pages, 1 figur
Group field theories for all loop quantum gravity
Group field theories represent a 2nd quantized reformulation of the loop
quantum gravity state space and a completion of the spin foam formalism. States
of the canonical theory, in the traditional continuum setting, have support on
graphs of arbitrary valence. On the other hand, group field theories have
usually been defined in a simplicial context, thus dealing with a restricted
set of graphs. In this paper, we generalize the combinatorics of group field
theories to cover all the loop quantum gravity state space. As an explicit
example, we describe the GFT formulation of the KKL spin foam model, as well as
a particular modified version. We show that the use of tensor model tools
allows for the most effective construction. In order to clarify the
mathematical basis of our construction and of the formalisms with which we
deal, we also give an exhaustive description of the combinatorial structures
entering spin foam models and group field theories, both at the level of the
boundary states and of the quantum amplitudes.Comment: version published in New Journal of Physic
On the Parameterized Intractability of Monadic Second-Order Logic
One of Courcelle's celebrated results states that if C is a class of graphs
of bounded tree-width, then model-checking for monadic second order logic
(MSO_2) is fixed-parameter tractable (fpt) on C by linear time parameterized
algorithms, where the parameter is the tree-width plus the size of the formula.
An immediate question is whether this is best possible or whether the result
can be extended to classes of unbounded tree-width. In this paper we show that
in terms of tree-width, the theorem cannot be extended much further. More
specifically, we show that if C is a class of graphs which is closed under
colourings and satisfies certain constructibility conditions and is such that
the tree-width of C is not bounded by \log^{84} n then MSO_2-model checking is
not fpt unless SAT can be solved in sub-exponential time. If the tree-width of
C is not poly-logarithmically bounded, then MSO_2-model checking is not fpt
unless all problems in the polynomial-time hierarchy can be solved in
sub-exponential time
Large-scale rigidity properties of the mapping class groups
We study the coarse geometry of the mapping class group of a
compact orientable surface. We show that, apart from a few low-complexity cases, any quasi-isometric embedding of a mapping class group into itself agrees up to bounded distance with a left multiplication. In particular, such a map is a quasi-isometry. This is a strengthening of the result of Hamenst¨adt and of Behrstock, Kleiner, Minsky and Mosher that the mapping class groups are quasi-isometrically rigid. In the course of proving this, we also develop the
general theory of coarse median spaces and median metric spaces with a view to applications to Teichm¨uller space, and related spaces
Topics in Graph Theory: Extremal Intersecting Systems, Perfect Graphs, and Bireflexive Graphs
In this thesis we investigate three different aspects of graph theory.
Firstly, we consider interesecting systems of independent sets in graphs, and the extension of the classical theorem of Erdos, Ko and Rado to graphs.
Our main results are a proof of an Erdos-Ko-Rado type theorem for a class of trees, and a class of trees which form counterexamples to a conjecture of Hurlberg and Kamat, in such a way that extends the previous counterexamples given by Baber.
Secondly, we investigate perfect graphs - specifically, edge modification aspects of perfect graphs and their subclasses. We give some alternative characterisations of perfect graphs in terms of edge modification, as well as considering the possible connection of the critically perfect graphs - previously studied by Wagler - to the Strong Perfect Graph Theorem. We prove that the situation where critically perfect graphs arise has no analogue in seven different subclasses of perfect graphs (e.g. chordal, comparability graphs), and consider the connectivity of a bipartite reconfiguration-type graph associated to each of these subclasses.
Thirdly, we consider a graph theoretic structure called a bireflexive graph where every vertex is both adjacent and nonadjacent to itself, and use this to characterise modular decompositions as the surjective homomorphisms of these structures. We examine some analogues of some graph theoretic notions and define a “dual” version of the reconstruction conjecture
Free subgroups of free products and combinatorial hypermaps
We derive a generating series for the number of free subgroups of finite
index in by using a connection between
free subgroups of and certain hypermaps (also known as ribbon graphs
or "fat" graphs), and show that this generating series is transcendental. We
provide non-linear recurrence relations for the above numbers based on
differential equations that are part of the Riccati hierarchy. We also study
the generating series for conjugacy classes of free subgroups of finite index
in , which correspond to isomorphism classes of hypermaps. Asymptotic
formulas are provided for the numbers of free subgroups of given finite index,
conjugacy classes of such subgroups, or, equivalently, various types of
hypermaps and their isomorphism classes.Comment: 27 pages, 3 figures; supplementary SAGE worksheets available at
http://sashakolpakov.wordpress.com/list-of-papers
- …