Related papers: Fractional Pebbling Game Lower Bounds
Given a configuration of pebbles on the vertices of a connected graph $G$, a \emph{pebbling move} removes two pebbles from some vertex and places one pebble on an adjacent vertex. The \emph{pebbling number} of a graph $G$ is the smallest…
Given a configuration of pebbles on the vertices of a graph $G$, a pebbling move removes two pebbles from a vertex and puts one pebble on an adjacent vertex. The pebbling number of a graph $G$ is the smallest number of pebbles required such…
Physical fractals invariably have upper and lower limits for their fractal structure. Berry has shown that a particle sharply confined to a box has a wave function that is fractal both in time and space, with no lower limit. In this…
A pebbling move on a graph consists of removing $2$ pebbles from a vertex and adding $1$ pebble to one of the neighbouring vertices. A vertex is called reachable if we can put $1$ pebble on it after a sequence of moves. The optimal pebbling…
We survey some recent regularity results for fractional p-Laplacian elliptic equations, especially focusing on pure and weighted boundary H\"older continuity of the solutions of related Dirichlet problems. Then, we present some applications…
The restricted edge pebbling distribution is a distribution of pebbles on the edges of $G$ is the placement of pebbles on the edges with the restriction that only an even number of pebbles should be placed on the edges with labels $0$.…
We devise a new formulation for the vertex coloring problem. Different from other formulations, decision variables are associated with the pairs of vertices. Consequently, colors will be distinguishable. Although the objective function is…
A pebbling move on a graph consists of taking two pebbles off from one vertex and add one pebble on an adjacent vertex, the $t$-pebbling number of a graph $G$ is the minimum number of pebbles so that we can move $t$ pebbles on any vertex on…
This article is concerned with the existence and uniqueness of solutions to some fractional order boundary value problems. Our results are based on some fixed point theorems. For the applicability of our results, we provide an example.
The Grundy number of an impartial game G is the size of the unique Nim heap equal to G. We introduce a new variant of Nim, Restricted Nim, which restricts the number of stones a player may remove from a heap in terms of the size of the…
We consider conditional-mean hedging in a fractional Black-Scholes pricing model in the presence of proportional transaction costs. We develop an explicit formula for the conditional-mean hedging portfolio in terms of the recently…
The topic of this treatise is a combinatorial technique called Graph Pebbling. We investigate pebbling numbers, weight functions, flow networks, hypercubes, and the zero-sum conjecture of Erd\H{o}s and Lemke. This investigation is a…
Under general assumptions, the numbers of semiclassical resonances is known to be bounded from above by a negative power of $h$ which is given by the fractal dimension of the trapped set. In this paper we provide examples of operators with…
Fractional-order elliptic problems are investigated in case of inhomogeneous Dirichlet boundary data. The boundary integral form is proposed as a suitable mathematical model. The corresponding theory is completed by sharpening the mapping…
Consider a distribution of pebbles on a graph. A pebbling move removes two pebbles from a vertex and place one at an adjacent vertex. A vertex is reachable under a pebble distribution if it has a pebble after the application of a sequence…
We consider average-energy games, where the goal is to minimize the long-run average of the accumulated energy. While several results have been obtained on these games recently, decidability of average-energy games with a lower-bound…
We introduce a new structural graph parameter called \emph{partial matching width}. For each (sufficiently large) integer $k \geq 1$, we introduce a class $\mathcal{G}_k$ of graphs of treewidth at most $k$ and max-degree $7$ such that for…
A system of two masses connected with a weightless rod (called dumbbell in this paper) interacting with a flat boundary is considered. The sharp bound on the number of collisions with the boundary is found using billiard techniques. In…
In this paper, we prove new upper bounds for sums of reciprocals of fractional parts over general aligned boxes, thus extending a previous result of the author concerning bounds for sums of reciprocals over symmetric boxes. These new upper…
The fractional diffusion equation is rigorously derived as a scaling limit from a deterministic Rayleigh gas, where particles interact via short range potentials with support of size $\varepsilon$ and the background is distributed in space…