相关论文: Dynamically broken Topcolor at Large-N

We study graphs whose chromatic number is close to the order of the graph (the number of vertices). Both when the chromatic number is a constant multiple of the order and when the difference of the chromatic number and the order is a small…

We use monadic second-order logic to define two-dimensional subshifts, or sets of colorings of the infinite plane. We present a natural family of quantifier alternation hierarchies, and show that they all collapse to the third level. In…

The spherical limit of strongly commensurate dirty-bosons is studied perturbatively at weak disorder and numerically at strong disorder in two dimensions (2D). We argue that disorder is not perfectly screened by interactions, and…

We initiate a study of large deviations for block model random graphs in the dense regime. Following Chatterjee-Varadhan(2011), we establish an LDP for dense block models, viewed as random graphons. As an application of our result, we study…

The classical random graph model $G(n,\lambda/n)$ satisfies a `duality principle', in that removing the giant component from a supercritical instance of the model leaves (essentially) a subcritical instance. Such principles have been proved…

We revisit asynchronous computing in networks of crash-prone processes, under the asynchronous variant of the standard LOCAL model, recently introduced by Fraigniaud et al. [DISC 2022]. We focus on the vertex coloring problem, and our…

In this paper, we exploit the theory of dense graph limits to provide a new framework to study the stability of graph partitioning methods, which we call structural consistency. Both stability under perturbation as well as asymptotic…

Arrangements of pseudolines are a widely studied generalization of line arrangements. They are defined as a finite family of infinite curves in the Euclidean plane, any two of which intersect at exactly one point. One can state various…

We study the thermodynamics of massive Gross-Neveu models with explicitly broken discrete or continuous chiral symmetries for finite temperature and fermion densities. The large $N$ limit is discussed bearing attention to the no-go theorems…

Spontaneous symmetry breaking generally circumvents one-dimensional systems with local interactions in thermal equilibrium. Here, we analyze a category of one-dimensional Hermitian models via local non-Hermitian constructions. Notably,…

The DP-coloring problem is a generalization of the list-coloring problem in which the goal is to find an independent transversal in a certain topological cover of a graph $G$. In the online DP-coloring problem, the cover of $G$ is revealed…

We explore the phase structure of fermions in the U(N) Chern-Simons gauge theory in three dimensions using the large N limit where N is the number of colors and the fermions are taken to be in the fundamental representation of the U(N)…

In this paper, we show that Higher-Order Coloured Unification - a form of unification developed for automated theorem proving - provides a general theory for modeling the interface between the interpretation process and other sources of…

An exact analytical solution of the statistical multifragmentation model is found in thermodynamic limit. Excluded volume effects are taken into account in the thermodynamically self-consistent way. The model exhibits a 1-st order phase…

A graph G is dually chordal if there is a spanning tree T of G such that any maximal clique of G induces a subtree in T. This paper investigates the Colourability problem on dually chordal graphs. It will show that it is NP-complete in case…

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…

What does an Erdos-Renyi graph look like when a rare event happens? This paper answers this question when p is fixed and n tends to infinity by establishing a large deviation principle under an appropriate topology. The formulation and…

We study a ${N=1}$ supersymmetric model in a ${S}^{1}{\times R}^{3}$ spacetime. We find that by choosing appropriate boundary conditions for the contributing fields supersymmetry can be preserved. However if we add a hard supersymmetry…

Combinatorial optimization problems near algorithmic phase transitions represent a fundamental challenge for both classical algorithms and machine learning approaches. Among them, graph coloring stands as a prototypical constraint…

Imagine that you are handed a rule for determining whether a cycle in a digraph is "good" or "bad", based on which edges of the cycle are traversed in the forward direction and which edges are traversed in the backward direction. Can you…