相关论文: Nonconventional averages along arithmetic progress…

Two-dimensional $CP^{N-1}$ models are investigated by Monte Carlo methods on the lattice, for values of $N$ ranging from 2 to 21. Scaling and rotation invariance are studied by comparing different definitions of correlation length $\xi$.…

In two recent papers we introduced some new techniques for constructing an extension of a probability-preserving system $T:\mathbb{Z}^d\curvearrowright (X,\mu)$ that enjoys certain desirable properties in connexion with the asymptotic…

We study a geometrically constrained coalescence model derived from spin systems. Given two probability distributions $\mathbb{P}_R$ and $\mathbb{P}_B$ on the positive reals with finite means, colour the real line alternately with red and…

We study a variation of the graph colouring problem on random graphs of finite average connectivity. Given the number of colours, we aim to maximise the number of different colours at neighbouring vertices (i.e. one edge distance) of any…

In this paper, we study unique colourings in random graphs as a generalization of both conflict-free and injective colourings. Specifically, we impose the condition that a fraction of vertices in the neighbourhood of any vertex are assigned…

We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic…

Solving a system of nonlinear inequalities is an important problem for which conventional numerical analysis has no satisfactory method. With a box-consistency algorithm one can compute a cover for the solution set to arbitrarily close…

If we want to color $1,2,\ldots,n$ with the property that all 3-term arithmetic progressions are rainbow (that is, their elements receive 3 distinct colors), then, obviously, we need to use at least $n/2$ colors. Surprisingly, much fewer…

The pinning of flux lattices by weak impurity disorder is studied in the absence of free dislocations using both the gaussian variational method and, to $O(\epsilon=4-d)$, the functional renormalization group. We find universal logarithmic…

We investigate numerically the time dependence of "window" overlaps in a three-dimensional Ising spin glass below its transition temperature after a rapid quench. Using an efficient GPU implementation, we are able to study large systems up…

We study first-passage percolation (FPP) on the square lattice. The model is defined using i.i.d. nonnegative random edge-weights $(t_e)$ associated to the nearest neighbor edges of $\mathbb{Z}^2$. The passage time between vertices $x$ and…

Via computer simulations we study evolution dynamics in systems of continuously moving Active Brownian Particles. The obtained results are discussed against those from the passive 2D Ising case. Following sudden quenches of uniform…

We study the computational complexity of approximately computing the partition function of a spin system. Techniques based on standard counting-to-sampling reductions yield $\tilde{O}(n^2)$-time algorithms, where $n$ is the size of the…

In the first part of this paper, we consider weighted domination in the case where the vertices of the complete graph on~\(n\) vertices are equipped with independent and identically distributed (i.i.d.) weights. We use the probabilistic…

This paper describes a sequence of natural numbers that grows faster than any Turing computable function. This sequence is generated from a version of the tiling problem, called a coloring system. In our proof that generates the sequence,…

We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagic squares and graphs, compositions of an…

The {\em acyclic chromatic number} of a graph is the least number of colors needed to properly color its vertices so that none of its cycles has only two colors. The {\em acyclic chromatic index} is the analogous graph parameter for edge…

Let $f(n,r)$ denote the maximum number of colourings of $A \subseteq \lbrace 1,\ldots,n\rbrace$ with $r$ colours such that each colour class is sum-free. Here, a sum is a subset $\lbrace x,y,z\rbrace$ such that $x+y=z$. We show that $f(n,2)…

We note that the standard inverse system volume scaling for finite-size corrections at a first-order phase transition (i.e., 1/L^3 for an L x L x L lattice in 3D) is transmuted to 1/L^2 scaling if there is an exponential low-temperature…

We develop a new approach for approximating large independent sets when the input graph is a one-sided spectral expander - that is, the uniform random walk matrix of the graph has its second eigenvalue bounded away from 1. Consequently, we…