相关论文: Fire retainment on Cayley graphs

We prove a threshold phenomenon for the existence/non-existence of energy minimizing solitary solutions of the diffraction management equation for strictly positive and zero average diffraction. Our methods allow for a large class of…

We prove a new pointwise ergodic theorem for probability-measure-preserving (pmp) actions of free groups, where the ergodic averages are taken over arbitrary finite subtrees of the standard Cayley graph rooted at the identity. This result…

This paper considers the edge-connectivity and restricted edge-connectivity of replacement product graphs, gives some bounds on edge-connectivity and restricted edge-connectivity of replacement product graphs and determines the exact values…

The algebraic stability theorem for $\mathbb{R}$-persistence modules is a fundamental result in topological data analysis. We present a stability theorem for $n$-dimensional rectangle decomposable persistence modules up to a constant…

Let $\Gamma$ be a Cayley graph of the permutation group generated by a transposition tree $T$ on $n$ vertices. In an oft-cited paper \cite{Akers:Krishnamurthy:1989} (see also \cite{Hahn:Sabidussi:1997}), it is shown that the diameter of the…

The following short note provides an alternative proof of a result of Coornaert: namely, that given a non-elementary word-hyperbolic group $G$ with a finite generating set $X$, there exist constants $\lambda,D > 1$ such that \[…

In this paper, we investigate the stability of the transmission problem for Rayleigh beam model with heat conduction. First, we reformulate our system into an evolution equation and prove our problem's well-posedness. Next, we demonstrate…

In this paper we study a sub-Finsler geometric problem on the free-nilpotent group of rank 2 and step 3. Such a group is also called Cartan group and has a natural structure of Carnot group, which we metrize considering the $\ell_\infty$…

Our main result is an extension of Pansu's theorem to random metrics, where the edges of the Cayley are i.i.d. random variable with some finite exponential moment. Based on a previous work by the second author, the proof relies on…

We study the heat trace for both the drifting Laplacian as well as Schr\"odinger operators on compact Riemannian manifolds. In the case of a finite regularity potential or weight function, we prove the existence of a partial (six term)…

We consider the edge-isoperimetric problem on the graph of the infinite grid $\mathbb{N}^{2}$ in the $\ell_{\infty}$ metric. We first show that the solutions are not nested, so that techniques other than compressions have to be used. We…

The local properties problem of Erd\H{o}s and Shelah generalizes many Ramsey problems and some distinct distances problems. In this work, we derive a variety of new bounds for the local properties problem and its variants. We do this by…

Rayleigh-Taylor (RT) unstable flames are a key component of Type Ia and Iax supernovae explosions, but their complex hydrodynamics is still not well understood. These flames are affected not only by the RT instability, but also by the…

We present a series of almost settled inapproximability results for three fundamental problems. The first in our series is the subexponential-time inapproximability of the maximum independent set problem, a question studied in the area of…

The vertices of the Cayley graph of a finitely generated semigroup form a set of sites which can be labeled by elements of a finite alphabet in a manner governed by a nonnegative real interaction matrix, respecting nearest neighbor…

The edge isoperimetric problem for a graph $G$ is to determine, for each $n$, the minimum number of edges leaving any set of $n$ vertices. In general this problem is NP-hard, but exact solutions are known in some special cases, for example…

We give lower and upper bounds for the separation profile (introduced by Benjamini, Schramm & Tim\'ar) for various graphs using the isoperimetric profile, growth and Hilbertian compression. For graphs which have polynomial isoperimetry and…

We consider the approximability of the maximum edge-disjoint paths problem (MEDP) in undirected graphs, and in particular, the integrality gap of the natural multicommodity flow based relaxation for it. The integrality gap is known to be…

We establish a uniform-in-scaling error estimate for the asymptotic preserving scheme proposed in \cite{XW21} for the L\'evy-Fokker-Planck (LFP) equation. The main difficulties stem from not only the interplay between the scaling and…

The three-in-a-tree problem asks for an induced tree of the input graph containing three mandatory vertices. In 2006, Chudnovsky and Seymour [Combinatorica, 2010] presented the first polynomial time algorithm for this problem, which has…