Related papers: No Efficient Disjunction or Conjunction of Switch-…
A giant cluster emerges discontinuously in bond percolation in various networks when the growth of large clusters is globally suppressed. It was recently revealed that this phenomenon occurs even in a scale-free (SF) network, where hubs…
We study the variation of Lyapunov exponents of simple dynamical systems near attractor-widening and attractor-merging crises. The largest Lyapunov exponent has universal behaviour, showing abrupt variation as a function of the control…
For a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let H be the largest matching among such pairs. Let M be a maximum matching of G. We show that 5/4 is a tight upper bound for…
In the perfect conductivity problem, it is interesting to study whether the electric field can become arbitrarily large or not, in a narrow region between two adjacent perfectly conducting inclusions. In this paper, we show that the…
It is generally believed that, in the thermodynamic limit, the microcanonical description as a function of energy coincides with the canonical description as a function of temperature. However, various examples of systems for which the…
We consider $O(n)$-invariant and reflection-positive quantum spin systems on the integer lattice in any dimension, and prove that spin-spin correlations decay exponentially fast provided n is large enough. This answers a question of…
We show that the total-variation mixing time of the lamplighter random walk on fractal graphs exhibit sharp cutoff when the underlying graph is transient (namely of spectral dimension greater than two). In contrast, we show that such cutoff…
The L-loop 4-point ladder diagram of massless phi^3 theory is finite when all 4 legs are off-shell and is given in terms of polylogarithms with orders ranging from L to 2L. We obtain the exact solution of the linear Dyson-Schwinger equation…
We study the effect of regime switches on finite size Lyapunov exponents (FSLEs) in determining the error growth rates and predictability of multiscale systems. We consider a dynamical system involving slow and fast regimes and switches…
In a general class of one and two dimensional Hubbard models, we prove upper bounds for the two-point correlation functions at finite temperatures for electrons, for electron pairs, and for spins. The upper bounds decay exponentially in one…
The roughly linear rise of the potential found between adjoint sources in SU(N) in lattice simulations is expected to saturate into a state of two `gluelumps' due to gluonic screening. We examine this in SU(2) in 2+1 dimensions. Crossover…
We simulate the formation and the evolution of global strings taking into account the expansion of the universe and the concomitant change of the effective potential, that is, the change from the restoration stage of the global {\it…
This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms…
There are conflicting reports in the literature regarding the finite-size scaling of the Liouvillian gap and dynamical fluctuations at discontinuous phase transitions, with various studies reporting either exponential or power-law behavior.…
Let an $n\times n$ array $\left( a_{ij}\right) $ of lights be given, each either on (when $a_{ij}=1$) or off (when $a_{ij}=-1$). For each row and each column there is a switch so that if the switch is pulled ($x_{i}=-1$ for row $i$ and…
The finite satisfiability problem for the two-variable fragment of first-order logic interpreted over trees was recently shown to be ExpSpace-complete. We consider two extensions of this logic. We show that adding either additional binary…
The big-line-big-clique conjecture states that for all $k,\ell\geq2$ there is an integer $n$ such that every finite set of at least $n$ points in the plane contains $\ell$ collinear points or $k$ pairwise visible points. We show that this…
Using the correspondence between a cycle up-down permutation and a pair of matchings, we give a combinatorial proof of the enumeration of alternating permutations according to the given peak set.
We show that any $2-$factor of a cubic graph can be extended to a maximum $3-$edge-colorable subgraph. We also show that the sum of sizes of maximum $2-$ and $3-$edge-colorable subgraphs of a cubic graph is at least twice of its number of…
Blow-up in graph theory is a procedure in which each vertex is replaced by copies of itself, and two copies are adjacent if and only if the original vertices are adjacent. In this paper, we extend the concept of graph blow-up to a more…