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

Conformal symmetry is expected to be realized in many equilibrium statistical mechanical systems at criticality. Although this is certainly true in two-dimensional systems, the three-dimensional case is subtler, and only a few proofs exist,…

Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…

In the paper we state and prove theorem describing the upper bound on number of the graphs that have fixed number of vertices |V| and can be colored with the fixed number of n colors. The bound relates both numbers using power of 2, while…

We investigate the effects of four-fermion interactions on the phase diagram of strongly interacting theories for any representation as function of the number of colors and flavors. We show that the conformal window, for any representation,…

A version of the second order phase transition theory, in which the Nernst theorem holds automatically, is proposed. The theory is constructed in terms of the order parameter and the (configurational) entropy. It faithfully reproduces the…

High density phase transitions in a 4 dimensional Nambu-Jona-Lasinio model containing a single symmetry breaking order parameter coming from the fermion-antifermion condensates are researched and expounded by means of both the gap equation…

We analyze the macroscopic behavior of multi-populations randomly connected neural networks with interaction delays. Similar to cases occurring in spin glasses, we show that the sequences of empirical measures satisfy a large deviation…

We study the strong spatial mixing (decay of correlation) property of proper $q$-colorings of random graph $G(n, d/n)$ with a fixed $d$. The strong spatial mixing of coloring and related models have been extensively studied on graphs with…

One of the fundamental and most-studied algorithmic problems in distributed computing on networks is graph coloring, both in bounded-degree and in general graphs. Recently, the study of this problem has been extended in two directions.…

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…

We consider theories of fractons with $N$ fields. These theories have exotic spacetime symmetries, including a conserved dipole moment. Using collective fields we solve these models to leading order in large $N$. The large $N$ solution…

Weak and strong coloring numbers are generalizations of the degeneracy of a graph, where for each natural number $k$, we seek a vertex ordering such every vertex can (weakly respectively strongly) reach in $k$ steps only few vertices with…

We study the effects of topological (connectivity) disorder on phase transitions. We identify a broad class of random lattices whose disorder fluctuations decay much faster with increasing length scale than those of generic random systems,…

High-throughput experiments are shedding light on the topology of large regulatory networks and at the same time their functional states, namely the states of activation of the nodes (for example transcript or protein levels) in different…

In order to make more complex number-based strings from topological coding for defending against the intelligent attacks equipped with quantum computing and providing effective protection technology for the age of quantum computing, we will…

Random neural networks are dynamical descriptions of randomly interconnected neural units. These show a phase transition to chaos as a disorder parameter is increased. The microscopic mechanisms underlying this phase transition are unknown,…

We assume that, in equilibrium, nuclear matter at reduced density and moderate finite temperature, breaks up into many fragments. A strong support to this assumption is provided by date accumulated from intermediate energy heavy ion…

It is well known that two-dimensional fermionic systems with a nonzero Chern number must break the time reversal symmetry, manifested by the appearance of chiral edge modes on an open boundary. Such an incompatibility between topology and…

By critical analyses of the order parameter of symmetry breaking, we have researched the phase transitions at high density in D=2 and D=3 Gross-Neveu (GN) model and shown that the gap equation obeyed by the dynamical fermion mass has the…

The function of a real network depends not only on the reliability of its own components, but is affected also by the simultaneous operation of other real networks coupled with it. Robustness of systems composed of interdependent network…