Related papers: Finding cores of random 2-SAT formulae via Poisson…
Let $\mathcal{F}$ be a collection of $r$-uniform hypergraphs, and let $0 < p < 1$. It is known that there exists $c = c(p,\mathcal{F})$ such that the probability of a random $r$-graph in $G(n,p)$ not containing an induced subgraph from…
We investigate the structure of large uniform random maps with $n$ edges, $\mathrm{f}_n$ faces, and with genus $\mathrm{g}_n$ in the so-called sparse case, where the ratio between the number vertices and edges tends to $1$. We focus on two…
I propose a two component analytic formula $F(s,t)=F^{(1)}(s,t)+F^{(2)}(s,t)$ for $(ab\rightarrow ab) +(a\bar{b}\rightarrow a\bar{b})$ scattering at energies $\ge 100 GeV$ ,where $s,t$ denote squares of c.m. energy and momentum transfer.It…
Measuring the 2S-2P Lamb shift in a hydrogen-like muonic atom allows one to extract its nuclear charge radius with a high precision that is limited by the uncertainty in the nuclear structure corrections. The charge radius of the proton…
The Poisson equation has applications across many areas of physics and engineering, such as the dynamic process simulation of ocean current. Here we present a quantum Fast Poisson Solver, including the algorithm and the complete and modular…
The positive operator valued localizations (POL) of a massive scalar boson are constructed and a characterization and structural analyses of their kernels are obtained. In the focus of this article are the causal features of the POL. There…
For graphs $F$ and $G$, let $F\to G$ signify that any red/blue edge coloring of $F$ contains a monochromatic $G$. Denote by ${\cal G}(N,p)$ the random graph space of order $N$ and edge probability $p$. Using the regularity method, one can…
The binomial random bipartite graph $G(n,n,p)$ is the random graph formed by taking two partition classes of size $n$ and including each edge between them independently with probability $p$. It is known that this model exhibits a similar…
We give an algorithm for computing an inseparable endomorphism of a supersingular elliptic curve $E$ defined over $\mathbb F_{p^2}$, which, conditional on GRH, runs in expected $O(p^{1/2}(\log p)^2(\log\log p)^3)$ bit operations and…
Let $\Bbbk$ be a field of characteristic zero. For any positive integer $n$ and any scalar $a\in\Bbbk$, we construct a family of Artin-Schelter regular algebras $R(n,a)$, which are quantisations of Poisson structures on…
We present the current fastest deterministic algorithm for $k$-SAT, improving the upper bound $(2-2/k)^{n + o(n)}$ dues to Moser and Scheder [STOC'11]. The algorithm combines a branching algorithm with the derandomized local search, whose…
Floating-point round-off errors are ubiquitous in numerically intensive programs arising in fields such as scientific computing and optimization. As floating-point errors potentially lead to unexpected and catastrophic program failures, one…
As a powerful tool for longitudinal data analysis, the generalized estimating equations have been widely studied in the academic community. However, in large-scale settings, this approach faces pronounced computational and storage…
Integer partitions which are simultaneously $t$--cores for distinct values of $t$ have attracted significant interest in recent years. When $s$ and $t$ are relatively prime, Olsson and Stanton have determined the size of the maximal…
Hypothesis tests for the presence of new sources of Poisson counts amidst background processes are frequently performed in high energy physics (HEP), gamma ray astronomy (GRA), and other branches of science. While there are conceptual…
Tensor factorizations are computationally hard problems, and in particular, are often significantly harder than their matrix counterparts. In case of Boolean tensor factorizations -- where the input tensor and all the factors are required…
We present a numerically tractable method to solve exactly the evolution of a N boson system with binary interactions. The density operator of the system rho is obtained as the stochastic average of particular operators |Psi_1><Psi_2| of…
This article presents a numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming (LP) problem. Each iteration of the proposed algorithm consists of two Gauss-Jordan pivoting…
Language models generate text based on successively sampling the next word. A decoding procedure based on nucleus (top-$p$) sampling chooses from the smallest possible set of words whose cumulative probability exceeds the probability $p$.…
Sorting is a fundamental problem in computer science. In the classical setting, it is well-known that $(1\pm o(1)) n\log_2 n$ comparisons are both necessary and sufficient to sort a list of $n$ elements. In this paper, we study the Noisy…