Related papers: Thresholds for Pebbling on Grids
This paper studies intersections of principal blocks of a finite group with respect to different primes. We first define the block graph of a finite group $G$, whose vertices are the prime divisors of $|G|$ and there is an edge between two…
In confined plasmas, a localized fluctuation in a marginal or weakly damped region will propagate and generate an avalanche if it exceeds a threshold. In this letter, a new model for turbulence spreading based on subcritical instability in…
Let $Q_d$ denote the hypercube of dimension $d$. Given $d\geq m$, a spanning subgraph $G$ of $Q_d$ is said to be $(Q_d,Q_m)$-saturated if it does not contain $Q_m$ as a subgraph but adding any edge of $E(Q_d)\setminus E(G)$ creates a copy…
We perform streaming instability simulations at Hill density and beyond, to demonstrate that Planetesimal formation is not completed when pebble accumulations exceed the local Hill density. We find that Hill density is not a sufficient…
A two-dimensional crystal melts via the proliferation and unbinding of topological defects, yet quantitatively predicting the melting temperature $T_m$ in real systems is challenging. Here we resolve this discrepancy in quantum Hall…
We study a class of fourth order geometric equations defined on a 4-dimensional compact Riemannian manifold which includes the Q-curvature equation. We obtain sharp estimates on the difference near the blow-up points between a bubbling…
In a recent paper hep-lat/9704020 we investigated Potts models on ``thin'' random graphs -- generic Feynman diagrams, using the idea that such models may be expressed as the N --> 1 limit of a matrix model. The models displayed first order…
Hierarchical embedding constraints define a set of allowed cyclic orders for the edges incident to the vertices of a graph. These constraints are expressed in terms of FPQ-trees. FPQ-trees are a variant of PQ-trees that includes F-nodes in…
The familiar process of bubbles generated via breaking waves in the ocean is foundational to many natural and industrial applications. In this process, large pockets of entrained gas are successively fragmented by the ambient turbulence…
We use techniques from the theory of electrical networks to give nearly tight bounds for the transience class of the Abelian sandpile model on the two-dimensional grid up to polylogarithmic factors. The Abelian sandpile model is a discrete…
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…
We give a cohomological criterion for a parabolic vector bundle on a curve to be semistable. It says that a parabolic vector bundle $E$ with rational parabolic weights is semistable if and only if there is another parabolic vector bundle…
Vesicles are important surrogate structures made up of multiple phospholipids and cholesterol distributed in the form of a lipid bilayer. Tubular vesicles can undergo pearling i.e., formation of beads on the liquid thread akin to the…
It is known that for a curve defined over $\mathbb{Q}$ of genus $g \leq 4$, there exists a point on the curve defined over a solvable extension of $\mathbb{Q}$. We relate points on curves of genus $g \geq 5$ over solvable extensions to the…
In this paper we consider statistical estimates of threshold and strength of percolation clusters on square lattices. The percolation threshold $p_c$ and the strength of percolation clusters $P_\infty$ for a square lattice with $(1,…
We define a general variant of the graph clustering problem where the criterion of density for the clusters is (high) connectivity. In {\sc Clustering to Given Connectivities}, we are given an $n$-vertex graph $G$, an integer $k$, and a…
We give a new, effective proof of the separability of cubically convex-cocompact subgroups of special groups. As a consequence, we show that if $G$ is a virtually compact special hyperbolic group, and $Q\leq G$ is a $K$-quasiconvex…
We establish a stronger Bogomolov--Gieseker type inequality for slope-semistable sheaves on the smooth quintic threefold. Our approach combines a refined restriction theorem for tilt-stable objects with explicit Clifford-type bounds for…
Given a graph $G$, we consider a model for a random cover of $G$ by taking two parallel copies of $G$ and crossing every pair of parallel edges randomly with probability $q$ independently of each other. The resulting graph $G_q$, is a…
For $p,q\ge2$ the $\{p,q\}$-tiling graph is the (finite or infinite) planar graph $T_{p,q}$ where all faces are cycles of length $p$ and all vertices have degree $q$. We give algorithms for the problem of recognizing (induced) subgraphs of…