相关论文: Nonconventional averages along arithmetic progress…

An edge coloring of a graph $G$ with colors $1,2,..., t$ is called an interval $t$-coloring if for each $i\in \{1,2,...,t\}$ there is at least one edge of $G$ colored by $i$, the colors of edges incident to any vertex of $G$ are distinct…

We present an explicit family of hypergraphs with arbitrarily large uniformity and chromatic number that admit realizations in both geometric and number-theoretic settings. As an application, we give a new proof of a theorem of Chen, Pach,…

Let $\mathcal{T}$ be a collection of 3-element subsets $S$ of $\{1, \ldots,n\}$ with the property that if $i<j<k$ and $a<b<c$ are two 3-element subsets in $S$, then there exists an integer sequence $x_1 < x_2 < \cdots < x_n$ such that $x_i,…

We study the non-equilibrium time evolution of the average transverse magnetisation and end-to-end correlation functions of the random Ising quantum chain. Starting with fully magnetised states, either in the $x$ or $z$ direction, we…

We study a graph coloring problem motivated by a fun Sudoku-style puzzle. Given a bipartition of the edges of a graph into {\em near} and {\em far} sets and an integer threshold $t$, a {\em threshold-coloring} of the graph is an assignment…

We consider the equilibrium dynamics of Ising spin models with multi-spin interactions on sparse random graphs (Bethe lattices). Such models undergo a mean field glass transition upon increasing the graph connectivity or lowering the…

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 study space-time fluctuations around a characteristic line for a one-dimensional interacting system known as the random average process. The state of this system is a real-valued function on the integers. New values of the function are…

Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; scheduling problems and aircraft assignments, for instance, motivate the robust coloring problem. This model gets to…

A branching process in random environment $(Z_n, n \in \N)$ is a generalization of Galton Watson processes where at each generation the reproduction law is picked randomly. In this paper we give several results which belong to the class of…

Spectral statistics and correlations are the usual way to study the presence or absence of quantum chaos in quantum systems. We present our investigation on the study of the fluctuation average and variance of certain correlation functions…

In this paper we continue the investigations about unlike powers in arithmetic progression. We provide sharp upper bounds for the length of primitive non-constant arithmetic progressions consisting of squares/cubes and $n$-th powers.

This paper studies quantitative deviation bounds for statistical ensembles evolving under the one-parameter flow of a nearly integrable Hamiltonian system. Combining Nekhoroshev-type stability estimates with phase-mixing arguments, we…

A diagrammatic formalism for lattices of 1/2 is developed. It is based on an unconstrained mapping between spin and Majorana operators. This allows the use of standard tools of diagrammatic quantum many-body theory without requiring…

We investigate the geometric properties displayed by the magnetic patterns developing on a two-dimensional Ising system, when a diffusive thermal dynamics is adopted. Such a dynamics is generated by a random walker which diffuses throughout…

Colored graphical models provide a parsimonious approach to modeling high-dimensional data by exploiting symmetries in the model parameters. In this work, we introduce the notion of coloring for extremal graphical models on multivariate…

Methods for the computation of invariants and symmetries of nonlinear evolution, wave, and lattice equations are presented. The algorithms are based on dimensional analysis, and can be implemented in any symbolic language, such as…

Coloring is a notoriously hard problem, and even more so in the online setting, where each arriving vertex has to be colored immediately and irrevocably. Already on trees, which are trivially two-colorable, it is impossible to achieve…

The dynamics of a one dimensional Ising spin system is investigated using three families of local update rules, the Galam majority rules, Glauber inflow influences and Sznadj outflow drives. Given an initial density p of up spins the…

This paper focuses on Majority Dynamics in sparse graphs, in particular, as a tool to study internal cuts. It is known that, in Majority Dynamics on a finite graph, each vertex eventually either comes to a fixed state, or oscillates with…