Related papers: Linear Lower Bounds for $\delta_c(p)$ for a Class …
We present a theory for constructing optimal lower bounds for the discrete half-line $p$-Laplacian of higher order $\ell\in\mathbb{N}$ and general $p>1$. The abstract framework introduces higher-order monotonicity and asymptotic constraints…
Collapse models constitute an alternative to quantum mechanics that solve the well-know quantum measurement problem. In this framework, a novel approach to include dissipation in collapse models has been recently proposed, and awaits…
We introduce a variational notion of essential spectrum for the Dirichlet $p-$Laplacian. We then extend the classical Persson Theorem to this nonlinear setting. This result provides a geometric characterization of the bottom of the…
In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…
In this paper we study the vertices of indecomposable Specht modules for symmetric groups. For any given indecomposable non-projective Specht module, the main theorem of the article describes a family of p-subgroups contained in its vertex.…
We consider the minmax Ljusternik-Schnirelmann levels of the constrained $p-$Dirichlet integral, on a general open set of the Euclidean space. We show that, whenever one of these levels lies below the threshold given by the $L^p$ Poincar\'e…
In r-neighbour bootstrap percolation on a graph G, a set of initially infected vertices A \subset V(G) is chosen independently at random, with density p, and new vertices are subsequently infected if they have at least r infected…
We define a continuum percolation model that provides a collection of random ellipses on the plane and study the behavior of the covered set and the vacant set, the one obtained by removing all ellipses. Our model generalizes a construction…
A new algorithm for the derivation of low-density series for percolation on directed lattices is introduced and applied to the square lattice bond and site problems. Numerical evidence shows that the computational complexity grows…
We analyse the cluster discovered by invasion percolation on a branching process with a power-law offspring distribution. Invasion percolation is a paradigm model of self-organised criticality, where criticality is approached without tuning…
Random systems of curves exhibiting fluctuating features on arbitrarily small scales ($\delta$) are often encountered in critical models. For such systems it is shown that scale-invariant bounds on the probabilities of crossing events imply…
Directed spiral percolation (DSP), percolation under both directional and rotational constraints, is studied on the triangular lattice in two dimensions (2D). The results are compared with that of the 2D square lattice. Clusters generated…
We study the existence, uniqueness and regularity of solutions of the equation $f_t = \Delta_p f = \text{div} (|Df|^{p-2} Df)$ under over-determined boundary conditions $f = 0$ and $|Df| = 1$. We show that if the initial data is concave and…
A power law is postulated for both site and bond percolation thresholds. The formula writes $p_c=p_0[(d-1)(q-1)]^{-a}d^{\ b}$, where $d$ is the space dimension and $q$ the coordination number. All thresholds up to $d\rightarrow \infty$ are…
We investigate site and bond percolation in triangular and square lattices subjected to linear distortion. In contrast to previously studied distortion schemes that preserve lattice geometry, linear distortion dislocates regular lattice…
Let $\delta_0(P,k)$ denote the degree $k$ dilation of a point set $P$ in the domain of plane geometric spanners. If $\Lambda$ is the infinite square lattice, it is shown that $1+\sqrt{2} \leq \delta_0(\Lambda,3) \leq (3+2\sqrt2) \, 5^{-1/2}…
Models of percolation processes on networks currently assume locally tree-like structures at low densities, and are derived exactly only in the thermodynamic limit. Finite size effects and the presence of short loops in real systems however…
We study the occurrence of number rigidity and deletion singularity in a class of point processes that we call {\it projected perturbed lattices}. These are generalizations of processes of the form…
We present exact calculations of the average number of connected clusters per site, $<k>$, as a function of bond occupation probability $p$, for the bond percolation problem on infinite-length strips of finite width $L_y$, of the square,…
We prove several new tight distributed lower bounds for classic symmetry breaking graph problems. As a basic tool, we first provide a new insightful proof that any deterministic distributed algorithm that computes a $\Delta$-coloring on…