相关论文: Some small cancellation properties of random group…

A locally compact groupoid is said to be exact if its associated reduced crossed product functor is exact. In this paper, we establish some permanence properties of exactness, including generalizations of some known results for exact…

We construct, in locally compact, second countable, amenable groups, sets with large density that fail to have certain combinatorial properties. For the property of being a shift of a set of measurable recurrence we show that this is…

We study constraints that anticipated DEEP survey galaxy counts versus redshift data will place on cosmological model parameters in models with and without a constant or time-variable cosmological constant $\Lambda$. This data will result…

Viewing Dehn's algorithm as a rewriting system, we generalise to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to…

We show the existence of generalized clusters of a finite or even infinite number of sets, with minimal total perimeter and given total masses, in metric measure spaces homogeneous with respect to a group acting by measure preserving…

We consider a random geometric graph with vertices sampled from a probability measure supported on $\mathbb R^d$, and study its connectivity. We show the graph is typically disconnected, unless the sampling density has superexponential…

We develop a theoretical approach to ``spontaneous stochasticity'' in classical dynamical systems that are nearly singular and weakly perturbed by noise. This phenomenon is associated to a breakdown in uniqueness of solutions for fixed…

The Katz-Sarnak Density Conjecture states that zeros of families of $L$-functions are well-modeled by eigenvalues of random matrix ensembles. For suitably restricted test functions, this correspondence yields upper bounds for the families'…

Let $d\ge 3$ be a fixed integer. Let $y:= y(p)$ be the probability that the root of an infinite $d$-regular tree belongs to an infinite cluster after $p$-bond-percolation. We show that for every constants $b,\alpha>0$ and $1<\lambda< d-1$,…

The scaling form of the whole distribution P(D) of the random diffusion coefficient D(x) in a model of classically diffusing particles is investigated. The renormalization group approach above the lower critical dimension d=0 is applied to…

We analyse the density of states of the random graph Laplacian in the percolating regime. A symmetry argument and knowledge of the density of states in the nonpercolating regime allows us to isolate the density of states of the percolating…

We study the isoperimetric subgraphs of the infinite cluster $\textbf{C}_\infty$ for supercritical bond percolation on $\mathbb{Z}^d$ with $d\geq 3$. Specifically, we consider the subgraphs of $\textbf{C}_\infty \cap [-n,n]^d$ which have…

In this study, we report a parallel algorithm for the infinite-size density matrix renormalization group (iDMRG) that is applicable to one-dimensional (1D) quantum systems with $\ell$-site periods, where $\ell$ is an even number. It…

The massive dark matter halos that host groups and clusters of galaxies have observable properties that appear to be log-normally distributed about power-law mean scaling relations in halo mass. Coupling this assumption with either…

We prove that there are only finitely many distinct semi-simple gauge groups and matter representations possible in consistent 6D chiral (1,0) supergravity theories with one tensor multiplet. The proof relies only on features of the…

The aim of this note is to announce some results about the probabilistic and deterministic asymptotic properties of linear groups. The first one is the analogue, for norms of random matrix products, of the classical theorem of Cramer on…

We derive conditions under which random sequences of polarizations (two-point symmetrizations) converge almost surely to the symmetric decreasing rearrangement. The parameters for the polarizations are independent random variables whose…

The problem of the logarithmic discretization of an arbitrary positive function (such as the density of states) is studied in general terms. Logarithmic discretization has arbitrary high resolution around some chosen point (such as Fermi…

We introduce a regularity method for sparse graphs, with new regularity and counting lemmas which use the Schatten-von-Neumann norms to measure uniformity. This leads to $k$-cycle removal lemmas in subgraphs of mildly-pseudorandom graphs,…

The property that the polynomial cohomology with coefficients of a finitely generated discrete group is canonically isomorphic to the group cohomology is called the (weak) isocohomological property for the group. In the case when a group is…