Related papers: Thresholds for Pebbling on Grids
This dissertation presents a method for simulation of motion of the pebbles in a PBR. A new mechanical motion simulator, PEBBLES, efficiently simulates the key elements of motion of the pebbles in a PBR. This model simulates gravitational…
The phase diagram of the penetrable square-well fluid is investigated through Monte Carlo simulations of various nature. This model was proposed as the simplest possibility of combining bounded repulsions at short scale and short-range…
We consider gauged Q-balls in the gravity-mediation-type model in the Affleck-Dine mechanism, which is described by the potential $V_{\rm grav.}(\phi):=(m_{\rm grav.}^2/2)\phi^2\left[1+K\ln(\phi/M)^2\right]$ with $K<0$. In many models of…
Explicit solutions for extended objects of a Q-ball type were found analytically in a model describing complex scalar field with piecewise parabolic potential in (3+1)- and (1+1)-dimensional space-times. Such a potential provides a variety…
In this paper we introduce a new formulation of Bennett's logical depth based on pebble transducers. This notion is defined based on the difference between the minimal length descriptional complexity of prefixes of infinite sequences from…
In this note, we clarify that the boundary criterion for relative cubulation of the first author and Groves works even when the peripheral subgroups are not one-ended. Specifically, if the boundary criterion is satisfied for a relatively…
A new gridding technique for the solution of partial differential equations in cubical geometry is presented. The method is based on volume penalization, allowing for the imposition of a cubical geometry inside of its circumscribing sphere.…
A simple model is presented for the formation of rolling grain ripples on a flat sand bed by the oscillatory flow generated by a surface wave. An equation of motion is derived for the individual ripples, seen as "particles", on the…
Let $X$ be a smooth complex projective curve of genus $g\geq 2$. We prove that a parabolic vector bundle $\mathcal{E}$ on $X$ on $X$ is (strongly) wobbly, i.e. $\mathcal{E}$ has a non-zero (strongly) parabolic nilpotent Higgs field, if and…
Several concepts that model processes of spreading (of information, disease, objects, etc.) in graphs or networks have been studied. In many contexts, we assume that some vertices of a graph $G$ are contaminated initially, before the…
A theoretical formulation is proposed for forced mass transport by pressure gradients in a liquid binary mixture around a spherical bubble undergoing volume oscillations in a sound field. Assuming the impermeability of the bubble wall to…
This work develops a flexible and mathematically sound framework for the design and analysis of graph scattering networks with variable branching ratios and generic functional calculus filters. Spectrally-agnostic stability guarantees for…
Divergence and vorticity damping, which operate upon horizontal divergence and relative vorticity, are explicit diffusion mechanisms used in dynamical cores to ensure stability. To avoid numerical blow-up from excessively strong diffusion,…
The goal of this paper is to discuss some of the results in [31] and [32] and expand upon the work there by proving a global weak existence result as well as a first bubbling analysis in finite time. In addition, an alternative local…
Disagreement percolation connects a Gibbs lattice gas and i.i.d. site percolation on the same lattice such that non-percolation implies uniqueness of the Gibbs measure. This work generalises disagreement percolation to the hard-sphere model…
In this paper we continue the study of prime graphs of finite solvable groups. The prime graph, or Gruenberg-Kegel graph, of a finite group G has vertices consisting of the prime divisors of the order of G and an edge from primes p to q if…
We analyse the jigsaw percolation process, which may be seen as a measure of whether two graphs on the same vertex set are `jointly connected'. Bollob\'as, Riordan, Slivken and Smith proved that when the two graphs are independent binomial…
A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. The authors recently proved a conjecture of McDiarmid, Steger, and…
We prove sharpness of the phase transition for the random-cluster model with $q \geq 1$ on graphs of the form $\mathcal{S} := \mathcal{G} \times S$, where $\mathcal{G}$ is a planar lattice with mild symmetry assumptions, and $S$ a finite…
Distributing entangled pairs among multiple users is a fundamental problem in quantum networks. Existing protocols like $X$ protocol introduced in (npj Quantum Information 5, 76 (2019)) use graph theoretic tools like local complementation…