Related papers: Flag f-vectors of colored complexes
The relation between thermodynamic phase transitions in classical systems and topology changes in their configuration space is discussed for a one-dimensional, analytically tractable solid-on-solid model. The topology of a certain family of…
We study whether, in the pi-calculus, the match prefix-a conditional operator testing two names for (syntactic) equality-is expressible via the other operators. Previously, Carbone and Maffeis proved that matching is not expressible this…
The main result of this paper is an edge-coloured version of Tutte's $f$-factor theorem. We give a necessary and sufficient condition for an edge-coloured graph $G^c$ to have a properly coloured $f$-factor. We state and prove our result in…
Matrix permanents arise naturally in the context of linear optical networks fed with nonclassical states of light. In this letter we tie the computational complexity of a class of multi-dimensional integrals to the permanents of large…
If a characteristic class for two vector bundles over the same base space does not coincide, then the bundles are not isomorphic. We give under rather common assumptions a lower bound on the topological dimension of the set of all points in…
A {\em restraint} on a (finite undirected) graph $G = (V,E)$ is a function $r$ on $V$ such that $r(v)$ is a finite subset of ${\mathbb N}$; a proper vertex colouring $c$ of $G$ is {\em permitted} by $r$ if $c(v) \not\in r(v)$ for all…
We prove a representability theorem for moduli functors of framed torsion-free sheaves on nonsingular complex projective surfaces, using formal geometry along a curve in the surface. This has as a consequence that a certain restriction…
A \emph{Kempe chain} on colors $a$ and $b$ is a component of the subgraph induced by colors $a$ and $b$. A \emph{Kempe change} is the operation of interchanging the colors of some Kempe chain. For a list-assignment $L$ and an $L$-coloring…
We exhibit invariants of smooth projective algebraic varieties with integer values, whose nonvanishing modulo p prevents the existence of an action without fixed points of certain finite p-groups. The case of base fields of characteristic p…
In Defective Coloring we are given a graph $G$ and two integers $\chi_d$, $\Delta^*$ and are asked if we can $\chi_d$-color $G$ so that the maximum degree induced by any color class is at most $\Delta^*$. We show that this natural…
Strong uniform Glivenko-Cantelli classes are weak uniform Glivenko-Cantelli, but to date results that prove the converse require additional conditions on the function class. This paper shows that no such extra requirements are necessary.
We present new conditions that eliminate a large class of graphs from being induced neighbourhoods of finite vertex-transitive graphs.
We show that the combinatorial matter of graph coloring is, in fact, quantum in the sense of satisfying the sum over all the possible intermediate state properties of a path integral. In our case, the topological field theory (TFT) with…
Using Bridgeland stability conditions we give sufficient criteria for a stable vector bundle on a surface to remain stable when restricted to a curve. We give a stronger criterion when the vector bundle is a general vector bundle on the…
This paper introduces the concept of domination in the context of colored graphs (where each color assigns a weight to the vertices of its class), termed up-color domination, where a vertex dominating another must be heavier than the other.…
Hyperuniform particle arrangements are characterized by a local number variance that grows more slowly than the volume of the observation window. We generalize this concept to describe particle systems in which particles carry weights:…
We study whether, in the pi-calculus, the match prefix---a conditional operator testing two names for (syntactic) equality---is expressible via the other operators. Previously, Carbone and Maffeis proved that matching is not expressible…
The restrictions imposed on the strong force in the `non-commutative standard model' are examined. It is concluded that given the framework of non-commutative geometry and assuming the electroweak sector of the standard model many details…
We investigate scalar restriction, scalar extension, and scalar coextension functors for graded modules, including their interplay with coarsening functors, graded tensor products, and graded Hom functors. This leads to several…
A strong edge colouring of a graph is an assignment of colours to the edges of the graph such that for every colour, the set of edges that are given that colour form an induced matching in the graph. The strong chromatic index of a graph…