Related papers: Effective bounds for monochromatic connectivity me…
We advance a probabilistic approach to the Hadwiger-Nelson problem initially developed by the Polymath16 project, in particular relating the approach to finite unit-distance graphs. We define the numerical \textit{badness} of a given…
Measures of association between cortical regions based on activity signals provide useful information for studying brain functional connectivity. Difficulties occur with signals of electric neuronal activity, where an observed signal is a…
We consider a Markov chain on $\mathbb{R}^d$ with invariant measure $\mu$. We are interested in the rate of convergence of the empirical measures towards the invariant measure with respect to various dual distances, including in particular…
We investigate the power of the most important lower bound technique in randomized communication complexity, which is based on an evaluation of the maximal size of approximately monochromatic rectangles, minimized over all distributions on…
We study the existence of uniformly bounded extension and trace operators for $W^{1,p}$-functions on randomly perforated domains, where the geometry is assumed to be stationary ergodic. Such extension and trace operators are important for…
The modern definition of optical coherence highlights a frequency dependent function based on a matrix of spectra and cross-spectra. Due to general properties of matrices, such a function is invariant in changes of basis. In this article,…
Consider a graph $G$ drawn on a fixed surface, and assign to each vertex a list of colors of size at least two if $G$ is triangle-free and at least three otherwise. We prove that we can give each vertex a color from its list so that each…
Recently, Balla, Janzer, and Sudakov showed a lower bound on the MaxCut in terms of the vector chromatic number, recovering known results on the MaxCut of $H$-free graphs. In this note, we show that their bound is tight, providing a…
We prove the convergence, in the small mass limit, of statistically invariant states for a class of semi-linear damped wave equations, perturbed by an additive Gaussian noise, both with Lipschitz-continuous and with polynomial…
We study local connectedness, local accessibility and finite connectedness at the boundary, in relation to the compactness of the Mazurkiewicz completion of a bounded domain in a metric space. For countably connected planar domains we…
We establish connectedness of volume constrained minimisers of energies involving surface tensions and convex potentials. By a previous result of McCann, this implies that minimisers are convex in dimension two. This positively answers an…
We consider a discrete-time, continuous-state random walk with steps uniformly distributed in a disk of radius of $h$. For a simply connected domain $D$ in the plane, let $\omega_h(0,\cdot;D)$ be the discrete harmonic measure at $0\in D$…
An arithmetical discrete plane is said to have critical connecting thickness if its thickness is equal to the infimum of the set of values that preserve its $2$-connectedness. This infimum thickness can be computed thanks to the fully…
Homology has long been accepted as an important computable tool for quantifying complex structures. In many applications, these structures arise as nodal domains of real-valued functions and are therefore amenable only to a numerical study…
We study how generalized Jones $\beta$-numbers relate to harmonic measure. Firstly, we generalize a result of Garnett, Mourgoglou and Tolsa by showing that domains in $\mathbb{R}^{d+1}$ whose boundaries are lower $d$-content regular admit…
We extend to all planar simply connected domains Makarov-type results about the Hausdorff dimension of $p$-harmonic measure pioneered by Lewis and Bennewitz in the context of quasidisks. The key to our analysis is a gradient estimate using…
We consider the problem of digitalizing Euclidean segments. Specifically, we look for a constructive method to connect any two points in $\mathbb{Z}^d$. The construction must be {\em consistent} (that is, satisfy the natural extension of…
A matching $M$ in a graph $G$ is connected if all the edges of $M$ are in the same component of $G$. Following \L uczak,there have been many results using the existence of large connected matchings in cluster graphs with respect to regular…
Gy\'arf\'as famously showed that in every $r$-coloring of the edges of the complete graph $K_n$, there is a monochromatic connected component with at least $\frac{n}{r-1}$ vertices. A recent line of study by Conlon, Tyomkyn, and the second…
We define the chromatic measure of a finite simple graph as the uniform distribution on its chromatic roots. We show that for a Benjamini-Schramm convergent sequence of finite graphs, the chromatic measures converge in holomorphic moments.…