Related papers: Fractional Pebbling Game Lower Bounds
Standard approaches to probabilistic reasoning require that one possesses an explicit model of the distribution in question. But, the empirical learning of models of probability distributions from partial observations is a problem for which…
We obtain bounds on fractional parts of binary forms of the shape $$\Psi(x,y)=\alpha_k x^k+\alpha_l x^ly^{k-l}+\alpha_{l-1}x^{l-1}y^{k-l+1}+\cdots+\alpha_0 y^k$$ with $\alpha_k,\alpha_l,\ldots,\alpha_0\in\mathbb{R}$ and $l\leq k-2.$ By…
Based on an optimal rate wavelet series representation, we derive a local modulus of continuity result with a refined almost sure upper bound for fractional Brownian motion. \sloppy The obtained upper bound of the small fractional Brownian…
Upper bounds are given for the weight distribution of binary weakly self-dual codes. To get these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert spaces. This method is motivated by recent progress on…
We consider a variation on Maker-Breaker games on graphs or digraphs where the edges have random costs. We assume that Maker wishes to choose the edges of a spanning tree, but wishes to minimise his cost. Meanwhile Breaker wants to make…
In this note, an upper bound for the sum of fractional parts of certain smooth functions is established. Such sums arise naturally in numerous problems of analytic number theory. The main feature is here an improvement of the main term due…
In a recent paper, the question of determining the fraction of binary trees that contain a fixed pattern known as the snowflake was posed. We show that this fraction goes to 1, providing two very different proofs: a purely combinatorial one…
We consider combinatorial problems that can be solved in polynomial time for graphs of bounded treewidth but where the order of the polynomial that bounds the running time is expected to depend on the treewidth bound. First we review some…
In this paper the classical Euler-Bernoulli beam (CEBB) theory is reformulated utilising fractional calculus. Such generalisation is called fractional Euler-Bernoulli beams (FEBB) and results in non-local spatial description. The parameters…
The classical (parallel) black pebbling game is a useful abstraction which allows us to analyze the resources (space, space-time, cumulative space) necessary to evaluate a function $f$ with a static data-dependency graph $G$. Of particular…
We derive and analyze a fully computable discrete scheme for fractional partial differential equations posed on the full space $\mathbb{R}^d$ . Based on a reformulation using the well-known Caffarelli-Silvestre extension, we study a…
We present a new proof rule for verifying lower bounds on quantities of probabilistic programs. Our proof rule is not confined to almost-surely terminating programs -- as is the case for existing rules -- and can be used to establish…
In this article, we investigate the fractional Borg-Levinson problem, an inverse spectral problem focused on recovering potentials from boundary spectral data. We demonstrate that the potential can, in fact, be uniquely determined by this…
This paper studies bulk-surface splitting methods of first order for (semi-linear) parabolic partial differential equations with dynamic boundary conditions. The proposed Lie splitting scheme is based on a reformulation of the problem as a…
We introduce the notion of classical fractional query algorithms, which generalize decision trees in the average-case setting, and can potentially perform better than them. We show that the limiting run-time complexity of a natural class of…
We consider the computational complexity of finding a legal black pebbling of a DAG $G=(V,E)$ with minimum cumulative cost. A black pebbling is a sequence $P_0,\ldots, P_t \subseteq V$ of sets of nodes which must satisfy the following…
The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…
For semiclassical problems we establish upper bounds on the number of resonances in boxes of size $h$ along the real axis, in terms of the dimension of the set of trapped trajectories. The proof uses second microlocalization.
We discuss the ``fractional D-branes'' which arise in orbifold resolution. We argue that they arise as subsectors of the Coulomb branch of the quiver gauge theory used to describe both string theory D-brane and Matrix theory on an orbifold,…
The cumulative pebbling complexity of a directed acyclic graph $G$ is defined as $\mathsf{cc}(G) = \min_P \sum_i |P_i|$, where the minimum is taken over all legal (parallel) black pebblings of $G$ and $|P_i|$ denotes the number of pebbles…