Related papers: A Strong Direct Sum Theorem for Distributional Que…
We study a robust selling problem where a seller attempts to sell one item to a buyer but is uncertain about the buyer's valuation distribution. Existing literature shows that robust screening provides a stronger theoretical guarantee than…
The strong maximum principle is a remarkable characterization of parabolic equations, which is expected to be partly inherited by fractional diffusion equations. Based on the corresponding weak maximum principle, in this paper we establish…
Special high-accuracy direct force summation N-body algorithms and their relevance for the simulation of the dynamical evolution of star clusters and other gravitating N-body systems in astrophysics are presented, explained and compared…
We prove a query complexity variant of the weak polynomial Freiman-Ruzsa conjecture in the following form. For any $\epsilon > 0$, a set $A \subset \mathbb{Z}^d$ with doubling $K$ has a subset of size at least $K^{-\frac{4}{\epsilon}}|A|$…
In this paper, we seek a natural problem and a natural distribution of instances such that any $O(n^{c-\epsilon})$-time algorithm fails to solve most instances drawn from the distribution, while the problem admits an $n^{c+o(1)}$-time…
The product homomorphism problem (PHP) takes as input a finite collection of relational structures A1, ..., An and another relational structure B, all over the same schema, and asks whether there is a homomorphism from the direct product A1…
Many materials of contemporary interest, such as gels, biological tissues and elastomers, are easily deformed but essentially incompressible. Traditional linear theory of elasticity implements incompressibility only to first order and thus…
In this paper we study the volatility and its probability distribution function for the cumulative production based on the experience curve hypothesis. This work presents a generalization of the study of volatility in [1], which addressed…
We construct near optimal linear decision trees for a variety of decision problems in combinatorics and discrete geometry. For example, for any constant $k$, we construct linear decision trees that solve the $k$-SUM problem on $n$ elements…
Computational fluid dynamics is a direct modeling of physical laws in a discretized space. The basic physical laws include the mass, momentum and energy conservations, physically consistent transport process, and similar domain of…
A function $f:[n]^{d} \to \mathbb{F}_2$ is a \defn{direct sum} if there are functions $L_i:[n]\to \mathbb{F}_2$ such that ${f(x) = \sum_{i}L_i(x_i)}$. In this work we give multiple results related to the property testing of direct sums. Our…
In this paper we describe a heuristic for decomposing a directed graph into factors according to the direct product (also known as Kronecker, cardinal or tensor product). Given a directed, unweighted graph~$G$ with adjacency matrix…
One of the fundamental theorems of uniform distribution theory states that the fractional parts of the sequence $(n \alpha)_{n \geq 1}$ are uniformly distributed modulo one (u.d. mod 1) for every irrational number $\alpha$. Another…
We introduce and study the new notion of an {\em exact factorization} $\mathcal{B}=\mathcal{A}\bullet \mathcal{C}$ of a fusion category $\mathcal{B}$ into a product of two fusion subcategories $\mathcal{A},\mathcal{C}\subseteq \mathcal{B}$…
We apply diffusion quantum Monte Carlo (DMC) to a broad set of solids, benchmarking the method by comparing bulk structural properties (equilibrium volume and bulk modulus) to experiment and DFT based theories. The test set includes…
We consider a linear recursion of the form $$R^{(k+1)}\stackrel{\mathcal D}{=}\sum_{i=1}^{N}C_iR^{(k)}_i+Q,$$ where $(Q,N,C_1,C_2,\dots)$ is a real-valued random vector with $N\in\mathbb{N}=\{0, 1, 2, \dots\}$,…
In modern computing units, division operations are generally slower than other arithmetic operations and require more resources, such as area and power, than multiplication. To reduce the delay, fast division algorithms use an initial…
We derive recursions for the probability distribution of random sums by computer algebra. Unlike the well-known Panjer-type recursions, they are of finite order and thus allow for computation in linear time. This efficiency is bought by the…
The Glivenko-Cantelli theorem states that the empirical distribution function converges uniformly almost surely to the theoretical distribution for a random variable $X \in \mathbb{R}$. This is an important result because it establishes the…
We introduce an efficient algorithmic procedure for implementing the direct formula that represents the product of splines in the B-spline basis. We first demonstrate the relevance of this direct approach through numerical evidence showing…