相关论文: Chromatic completion

We show that several dichotomy theorems concerning the second level of the Borel hierarchy are special cases of the $\aleph_0$-dimensional generalization of the open graph dichotomy, which itself follows from the usual proof(s) of the…

We study completeness of a topological vector space with respect to different filters on the set N of all naturals. In the metrizable case all these kinds of completeness are the same, but in non-metrizable case the situation changes. For…

We study the chromatic quasisymmetric class function of a linearized combinatorial Hopf monoid. Given a linearized combinatorial Hopf monoid $H$, and an $H$-structure $h$ on a set $N$, there are proper colorings of $h$, generalizing graph…

In this paper we prove that the limiting distribution of the Chromatic number of a random graph $\mathcal{G}_{n,p}$, with fixed edge-probability $p$, after appropriate centering and scaling is Normal, when the number of vertices $n$, goes…

Let $H$ be a triple system with maximum degree $d>1$ and let $r>10^7\sqrt{d}\log^{2}d$. Then $H$ has a proper vertex coloring with $r$ colors such that any two color classes differ in size by at most one. The bound on $r$ is sharp in order…

We introduce a notion of proper morphism for schematic finite spaces and prove the analogue of Grothendieck's finiteness theorem for it by means of the classic result for schemes and general descent arguments. This result also generalizes…

Conformal fields with boundaries give rise to rich critical phenomena that can reveal information about the underlying conformality. While most existing studies focus on Hermitian systems, here we explore boundary critical phenomena in a…

By a finite type-graph we mean a graph whose set of vertices is the set of all $k$-subsets of $[n]=\{1,2,\ldots, n\}$ for some integers $n\ge k\ge 1$, and in which two such sets are adjacent if and only if they realise a certain order type…

In this note, we show that the difference between the chromatic and the cochromatic number of the random graph $G_{n,1/2}$ is not whp bounded by $n^{1/2-o(1)}$, addressing a question of Erd\H{o}s and Gimbel.

We give a general definition of the conformal anomaly for theories that are not classically Weyl invariant and show that this definition yields a quantity that is both finite and local. As an example we study the conformal anomaly for a…

This paper deals with the numerical approximation of normalizing constants produced by particle methods, in the general framework of Feynman-Kac sequences of measures. It is well-known that the corresponding estimates satisfy a central…

In this paper, based on the contributions of Tucker (1983) and Seb{\H{o}} (1992), we generalize the concept of a sequential coloring of a graph to a framework in which the algorithm may use a coloring rule-base obtained from suitable…

The family of Thom spectra $y(n)$ interpolates between the sphere spectrum and the mod two Eilenberg--MacLane spectrum. Computations of Mahowald, Ravenel, Shick, and the authors show that the associative ring spectrum $y(n)$ has type $n$.…

We show that the vanishing of certain cohomology groups of polyhedral complexes imply upper bounds on Ramsey numbers. Lovasz bounded the chromatic numbers of graphs using Hom complexes. Babson and Kozlov proved Lovasz conjecture and…

For positive integers $t$ and $n$ let $C_t^n$ be the $n$-cube over $t$ elements, that is, the set of ordered $n$-tuples over the alphabet $\{0,\dots, t-1\}$. We address the question of whether a balanced finite coloring of $C_t^n$…

We study the problem of colouring the vertices of a polygon, such that every viewer in it can see a unique colour. The goal is to minimise the number of colours used. This is also known as the conflict-free chromatic guarding problem with…

We examine maximum vertex coloring of random geometric graphs, in an arbitrary but fixed dimension, with a constant number of colors. Since this problem is neither scale-invariant nor smooth, the usual methodology to obtain limit laws…

We show that the homogeneous approximation property and the comparison theorem hold for arbitrary coherent frames. This observation answers some questions about the density of frames that are not covered by the theory of Balan, Casazza,…

In this paper, we examine the superadditivity of convex roof coherence measures. We put forward a theorem on the superadditivity of convex roof coherence measures, which provides a sufficient condition to identify the convex roof coherence…

A rainbow $q$-coloring of a $k$-uniform hypergraph is a $q$-coloring of the vertex set such that every hyperedge contains all $q$ colors. We prove that given a rainbow $(k - 2\lfloor \sqrt{k}\rfloor)$-colorable $k$-uniform hypergraph, it is…