Related papers: Fractional Pebbling Game Lower Bounds
We analyze here different forms of fractional relaxation equations of order {\nu}\in(0,1) and we derive their solutions both in analytical and in probabilistic forms. In particular we show that these solutions can be expressed as crossing…
Red-blue pebble games model the computation cost of a two-level memory hierarchy. We present various hardness results in different red-blue pebbling variants, with a focus on the oneshot model. We first study the relationship between…
This paper investigates fractional torsional rigidity on compact, connected metric graphs, a novel extension of the classical concept to nonlocal operators. The fractional torsional rigidity is defined as the $L^1$-norm of the fractional…
We present new properties for the Fractional Poisson process and the Fractional Poisson field on the plane. A martingale characterization for Fractional Poisson processes is given. We extend this result to Fractional Poisson fields,…
We obtain regularity results in weighted Sobolev spaces for the solution of the obstacle problem for the integral fractional Laplacian. The weight is a power of the distance to the boundary. These bounds then serve us as a guide in the…
We prove that a pointwise fractional Hardy inequality implies a fractional Hardy inequality, defined via a Gagliardo-type seminorm. The proof consists of two main parts. The first one is to characterize the pointwise fractional Hardy…
A version of fractional diffusion on bounded domains, subject to 'homogeneous Dirichlet boundary conditions' is derived from a kinetic transport model with homogeneous inflow boundary conditions. For nonconvex domains, the result differs…
In this paper we study the fine-grained complexity of the CFL reachability problem. We first present one of the existing algorithms for the problem and an overview of conditional lower bounds based on widely believed hypotheses. We then use…
A \emph{binary tanglegram} is a drawing of a pair of rooted binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example, in phylogenetics, it is essential…
We consider the nonlinear degenerate parabolic equation of porous medium type, whose diffusion is driven by the (spectral) fractional Laplacian on the hyperbolic space. We provide existence results for solutions, in an appropriate weak…
We investigate the fractional diffusion limit of a Linear Boltzmann equation with heavy-tailed velocity equilibrium in a half-space with Maxwell boundary conditions. We derive a new confined version of the fractional Laplacian and show…
We present simple proofs of a discrete fractional and non-fractional Hardy inequality, Our constants are explicit, but not optimal. In the class of power weights, we get a complete picture of when the non-fractional Hardy inequality holds,…
A \emph{general branch-and-bound tree} is a branch-and-bound tree which is allowed to use general disjunctions of the form $\pi^{\top} x \leq \pi_0 \,\vee\, \pi^{\top}x \geq \pi_0 + 1$, where $\pi$ is an integer vector and $\pi_0$ is an…
We give a simple technic to derive the Berry-Ess\'een bounds for the quadratic variation of the subfractional Brownian motion (subfBm). Our approach has two main ingredients: ($i$) bounding from above the covariance of quadratic variation…
We provide a uniform upper bound on the minimal drift so that the one-per-site frog model on a $d$-ary tree is recurrent. To do this, we introduce a subprocess that couples across trees with different degrees. Finding couplings for frog…
A generalization to the Gibbons-Hawking-York boundary term for metric $f(R)$ gravity theories is introduced. A redefinition of the Gibbons-Hawking-York term is proposed. The proposed new definition is used to derive a consistent set of…
We give a solution to the Poincar\'e Problem, in the formulation of Cerveau and Lins Neto. We obtain a bound on the degree of general leaves of foliations of general type, which is linear in $g$. To achieve this we study the birational…
In [3] L.Zapponi studied the arithmetic of plane bipartite trees with prime number of edges. He obtained a lower bound on the degree of tree's definition field. Here we obtain a similar lower bound in the following case. There exists a…
Computing a minimum-area planar straight-line drawing of a graph is known to be NP-hard for planar graphs, even when restricted to outerplanar graphs. However, the complexity question is open for trees. Only a few hardness results are known…
This paper surveys recent analytical and numerical research on linear problems for the integral fractional Laplacian, fractional obstacle problems, and fractional minimal graphs. The emphasis is on the interplay between regularity,…