Related papers: Crossing-changeable braids from chromatic configur…
We show that by coupling complex three-state systems to branched-polymer like ensembles we can obtain models with gamma-string different from one half. It is also possible to study the interpolation between dynamical and crystalline graphs…
A crossing in a knot is nugatory if changing the crossing does not change the knot type. Using an invariant of certain types of closed 3-braid diagrams, we show that if a closed 3-braid contains a nugatory crossing then its braid index is…
Garside-theoretical solutions to the conjugacy problem in braid groups depend on the determination of a characteristic subset of the conjugacy class of any given braid, e.g. the sliding circuit set. It is conjectured that, among rigid…
The {\em chromatic gap} is the difference between the chromatic number and the clique number of a graph. Here we investigate $\gap(n)$, the maximum chromatic gap over graphs on $n$ vertices. Can the extremal graphs be explored? While…
A colored graph is a directed graph in which nodes or edges have been assigned colors that are not necessarily unique. Observability problems in such graphs consider whether an agent observing the colors of edges or nodes traversed on a…
We consider knots equipped with a representation of their knot groups onto a dihedral group D_{2n} (where n is odd). To each such knot there corresponds a closed 3-manifold, the (irregular) dihedral branched covering space, with the…
Merge-width is a recently introduced family of graph parameters that unifies treewidth, clique-width, twin-width, and generalised colouring numbers. We prove the equivalence of several alternative definitions of merge-width, thus…
In this article we will overview several aspects of the string landscape, namely intersecting D-brane models and their statistics, possible model independent LHC signatures of intersecting brane models, flux compactification, moduli…
Let G be a combinatorial graph with vertices V and edges E. A proper coloring of G is an assignment of colors to the vertices such that no edge connects two vertices of the same color. These are the colorings considered in the famous Four…
Classes with bounded rankwidth are MSO-transductions of trees and classes with bounded linear rankwidth are MSO-transductions of paths. These results show a strong link between the properties of these graph classes considered from the point…
We present an elementary construction of an uncountably chromatic graph without uncountable, infinitely connected subgraphs.
The Burling sequence is a sequence of triangle-free graphs of unbounded chromatic number. The class of Burling graphs consists of all the induced subgraphs of the graphs of this sequence. In the first and second parts of this work, we…
In this thesis we discuss some nonperturbative and noncommutative aspects of string theory. We present low-energy background field solutions corresponding to various D-branes (and their bound states) and intersecting branes in flat and…
We investigate the complexity of generalizations of colourings (acyclic colourings, $(k,\ell)$-colourings, homomorphisms, and matrix partitions), for the class of transitive digraphs. Even though transitive digraphs are nicely structured,…
Crossings of energy bands in solids that are not pinned at symmetry points in the Brillouin zone and yet cannot be removed by perturbations are thought to be conditioned on the presence of a nonsymmorphic symmetry. In this Letter we show…
This paper focuses on mechanical aspects of chromatin biological functioning. Within a basic geometric modeling of the chromatin assembly, we give for the first time the complete set of elastic constants (twist and bend persistence lengths,…
An $(m,n)$-mixed graph generalizes the notions of oriented graphs and edge-coloured graphs to a graph object with $m$ arc types and $n$ edge types. A simple colouring of such a graph is a non-trivial homomorphism to a reflexive target. We…
The defect conformal field theory describing intersecting D3-branes at a C^2/Z_k orbifold is used to (de)construct the theory of intersecting M5-branes, as well as M5-branes wrapping the holomorphic curve xy=c. The possibility of a 't Hooft…
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…
We introduce the notion of a braiding on a skew monoidal category, whose curious feature is that the defining isomorphisms involve three objects rather than two. These braidings are shown to arise from, and classify, cobraidings (also known…