Mathematics Problem Archive
Greenberg's pseudo-null conjecture
v1.3 research notesLet $F$ be totally real, let $\widetilde F$ be the compositum of all $\mathbb Z_p$-extensions of $F$, let $\widetilde L$ be its maximal unramified abe...
Second Hardy–Littlewood zeta-function conjecture
v1.3 research notesFor every $\varepsilon>0$, do constants $T_0(\varepsilon),c(\varepsilon)>0$ exist such that, for $T\geq T_0$ and $H=T^{1/2+\varepsilon}$, the number $...
Topology of planar Brownian trace
v1.3 research notesLet $X_t$ be two-dimensional Brownian motion. (i) For every pair $x,y \notin X[0,1]$, is there a Jordan arc $\Gamma$ containing $x$ and $y$ such that ...
Percolation dimension of planar Brownian trace
v1.3 research notesFor a set $B$, define its percolation dimension as the infimum of the Hausdorff dimensions of Jordan arcs $A\subset B$ containing at least two distinc...
Efficient couplings in acute triangles
v1.3 research notesLet $D$ be a triangle whose angles are all strictly less than $\pi/2$, and let $\mu_2>0$ be the second eigenvalue of the Laplacian on $D$ with Neumann...
Convergence of synchronous reflected-Brownian couplings
v1.3 research notesLet $D\subset\mathbb{R}^2$ be a connected open set with smooth boundary, and let $X,Y$ be synchronously coupled reflected Brownian motions in $D$ driv...
Concatenated bounded Brownian pieces
v1.3 research notesFor each $k\in\mathbb{Z}$, let $B^k$ be Brownian motion and $T_k$ a stopping time, with the stopped pieces independent, $0\le T_k<\infty$, and with th...
Do peaks of random labelings repel each other?
v1.3 research notesChoose uniformly a bijective labeling of the vertices of the $n\times n$ discrete square by $1,2,\ldots,n^2$, and call a vertex a peak when all adjace...
Martingale for practical purposes
v1.3 research notesGive a mathematically useful definition of a process being a 'martingale for practical purposes', so that failure means it is practical to find a stop...
Analytic toy model for a percolation-fragmentation congestion transition
v1.3 research notesFind a simple network-and-demand toy model in which the marginal satisfiability proportion $r(t)$ can be calculated analytically and exhibits the prop...
Universal compression of sparse labeled graphs
v1.3 research notesFor sparse $n$-vertex graphs of average degree $O(1)$ whose vertices have distinct $O(\log n)$-length labels over a finite alphabet, construct univers...
Mixing times for coagulation-fragmentation processes
v1.3 research notesObtain relaxation- and mixing-time bounds for reversible coagulation-fragmentation Markov chains on finite sets in terms of their model parameters....
Low-density lineage limit of coalescing branching random walk
v1.3 research notesFor the two stationary branching-coalescing models on $\mathbb{Z}^3$ described by Aldous, prove that as particle intensity tends to zero the suitably ...
Constrained Ising storage model on a time-varying graph
v1.3 research notesStudy the constrained Ising storage model described on the page when the underlying graph itself changes in time....
Constant-factor online scheduling of subadditive batches
v1.3 research notesTasks arrive as a rate-one Poisson process and have types in $[0,1]$; batch processing time $S$ is monotone and strictly subadditive and type $a$ incu...
Relaxation time of Metropolis chains on Cayley graphs
v1.3 research notesFor the Metropolis chain on a finite Cayley graph with stationary law $\mu(p)$ obtained by stopping random walk at a geometric time, analyze its relax...
Spectral gap of a Bayesian graph Laplacian
v1.3 research notesFor the posterior random weighted graphs $G(t)$ defined from independent Poisson edge counts and flat priors, study the process $\operatorname{gap}(G(...
Sharp phase transition for SIS epidemics on general networks
v1.3 research notesFor sequences of finite weighted networks with vertex recovery rates and stationary SIS infection counts $X^{(n)}_{\theta,\varepsilon}$ satisfying the...
Shortest routes in random proximity networks
v1.3 research notesFor random proximity graphs on a planar Poisson point process, determine rigorous orders of magnitude for the transversal deviation $T_r$ of a shortes...
Mixing of branch rotation and triangulation chains
v1.3 research notesFor both the diagonal-flip chain on triangulations of the regular $n$-gon and the branch-rotation chain on $n$-cladograms, prove that the relaxation t...
Random Eulerian excursion dichotomy on high-dimensional tori
v1.3 research notesOn the bidirected torus $\mathbb{Z}_N^d$ with fixed $d\ge3$, let $b^{(N)},t^{(N)},m^{(N)}$ count excursions of a uniform Eulerian circuit longer than ...
Second-longest Eulerian excursion on the two-dimensional torus
v1.3 research notesFor a uniform Eulerian circuit on the bidirected two-dimensional torus, does $\log L_2^{(N)}/\log N$ converge in distribution to a random variable wit...
Excursion counts in a random Eulerian circuit on a complete graph
v1.3 research notesOn the bidirected complete $n$-vertex graph, is the expected number of length-$i$ excursions in a uniform Eulerian circuit asymptotic to $e^{-i/n}$?...
Shortest Eulerian excursion on the Hamming cube
v1.3 research notesFor a uniform Eulerian circuit on the bidirected Hamming cube $\{0,1\}^d$, determine the asymptotic behavior or distribution of the shortest excursion...
Eulerian-circuit continuum limits and SLE
v1.3 research notesIs there a relation between space-filling $\operatorname{SLE}_\kappa$ for $\kappa>8$ and the conjectural continuum limit of uniform Eulerian circuits ...
Stretch-length exponent in spatial networks
v1.3 research notesImprove the explicit upper and lower bounds for the minimum network length functions $\Psi^{ave}(s)$ and $\Psi^{worst}(s)$, and prove whether there is...
Largest common subcladogram exponents
v1.3 research notesFor two independent random $n$-cladograms, under both the uniform and coalescent distributions, prove $\mathbb{E}C_n=n^{\gamma+o(1)}$ for respective c...
Largest common suborder of two random two-dimensional orders
v1.3 research notesFor two independent coordinatewise partial orders generated by uniform points in the unit square, prove $\mathbb{E}C_n\sim c n^{1/3}$ and establish th...
Percolation criteria for merging planar empires
v1.3 research notesFor continuous-time processes that merge adjacent polygonal planar regions $A,B$ at a geometry-dependent rate $r(A,B)$, give sufficient conditions on ...
Percolation of planar empires at unit merger rate
v1.3 research notesWhen every adjacent pair of planar empires merges at rate $r(A,B)=1$, does percolation occur?...
Growth exponents in the balanced city-growth regime
v1.3 research notesIn the balanced regime $0<\alpha<1$ and $\beta>2\alpha$, prove that the upper and lower growth exponents for influence and city population all equal $...
Largest-city growth at alpha=1
v1.3 research notesIf $\alpha=1$ and $\beta>2$, prove $N_{(1)}(t)=t(\log t)^{1-2/\beta+o(1)}$ almost surely....
Stability dichotomy for the associated city dynamical system
v1.3 research notesFor the associated influence-cell dynamical system in general position with positive initial weights, prove that one weight tends to $1$ if $\alpha>1$...
Feasible statistic triples for SIRSNs
v1.3 research notesDetermine the set of possible triples $(\Delta=\mathbb{E}D_1,\ell,p(1))$ over all scale-invariant random spatial networks....
Optimal length-route tradeoff for SIRSNs
v1.3 research notesGive quantitative estimates improving the known bound on $\ell^*(\Delta)$, the infimum edge intensity among SIRSNs with mean unit-distance route lengt...
Local finiteness of SIRSN traffic intensity
v1.3 research notesShow, perhaps under regularity hypotheses on a SIRSN, that for $2<\beta<4$ the paper's source-destination measure with displacement density $|z|^{-\be...
Unbounded component uniqueness in a SIRSN
v1.3 research notesDoes the major-road subnetwork $E(\infty,1)$ of a SIRSN almost surely have exactly one unbounded connected component?...
Integrability of all routes to random points in a SIRSN
v1.3 research notesUnder what additional assumptions, if any, is $\mathbb{E}\sup_{i\ge1}\operatorname{len}[R(0,U_i)]<\infty$ for independent uniform points $U_i$ in the ...
Expected length of a SIRSN spanning subnetwork
v1.3 research notesFor $k$ uniform random points $Z_1,\ldots,Z_k$ in a square of area $k$, prove $\mathbb{E}\operatorname{len}[\operatorname{span}(Z_1,\ldots,Z_k)]\sim\e...
SIRSN subnetworks cannot be trees
v1.3 research notesProve that in a scale-invariant random spatial network the subnetwork $S(1)$ cannot be a tree, even allowing Steiner points....
Online minimum spanning tree constant
v1.3 research notesFor the complete graph with i.i.d. uniform edge weights revealed online, prove that the minimum expected cost $\mathbb{E}Y_n$ of an online spanning-tr...
Stationary law of a drift-jump particle process
v1.3 research notesGive a reasonably explicit description of the unique stationary distribution of the one-dimensional Hammersley-type process whose particles drift righ...
Near-one asymptotics for oriented-percolation flow
v1.3 research notesFor the limiting maximum-flow density $v(p)$ in oriented bond percolation on the square lattice, prove $1-v(p)\sim\sqrt{2(1-p)}$ as $p\uparrow1$....
Setwise convergence versus total-variation convergence of shifted processes
v1.3 research notesLet $X$ and $X'$ be discrete-time stochastic processes on the same state space, and let $\theta_n$ denote the shift. If $\mathbb{P}(\theta_nX\in A)\to...
Coupling characterization of setwise asymptotic stationarity
v1.3 research notesIf setwise convergence $\mathbb{P}(\theta_nX\in A)\to\mathbb{P}(X'\in A)$ for every measurable path-space set $A$ does not imply total-variation conve...
Two-process coupling characterization of weak convergence
v1.3 research notesSuppose $\theta_nX$ converges in distribution to $X'$ on a separable metric path space. Is there a coupling characterization involving only a joint co...
Conjecture 0.1 — Is there an infinite expander?
v1.3 research notesCall an infinite connected graph $G$ of uniformly bounded degree an infinite expander if there is a constant $c>0$ such that, for every vertex set $S$...
Finite groups in the property-T collapse window
v1.3 research notesIn Gromov's density model with generators $a,a^{-1},b,b^{-1}$, choose $3^{nd}$ relators independently and uniformly from the reduced words of length $...
Explicit bound for symmetric point configurations on the sphere
v1.3 research notesCall a finite subset $X\subset S^2$ symmetric if a finite group acts transitively on $X$ by isometries. Determine an explicit universal upper bound fo...
Additive-error graph model of the Euclidean plane
v1.3 research notesDoes there exist a graph $G$ and a map $f:V(G)\to\mathbb{R}^2$ such that $|\|f(x)-f(y)\|_2-d_G(x,y)|<C$ for every $x,y\in V(G)$ and some constant $C<\...