Related papers: A parallel algorithm for the enumeration of benzen…
A well known method for convergence acceleration of continued fraction $\K(a_n/b_n)$ is to use the modified approximants $S_n(\omega_n)$ in place of the classical approximants $S_n(0)$, where $\omega_n$ are close to tails $f^{(n)}$ of…
An algebraic number $\beta \in \mathbb{C}$ with no conjugate of modulus 1 can serve as the base of a numeration system $(\beta, \mathcal{A})$ with parallel addition, i.e., the sum of two operands represented in base $\beta$ with digits from…
We propose a fast method for high order approximation of potentials of the Helmholtz type operator Delta+kappa^2 over hyper-rectangles in R^n. By using the basis functions introduced in the theory of approximate approximations, the cubature…
Cellular Automata (CA) are an interesting computational model for designing Pseudorandom Number Generators (PRNG), due to the complex dynamical behavior they can exhibit depending on the underlying local rule. Most of the CA-based PRNGs…
In this paper, first we give a sequential linear-time algorithm for the longest path problem in meshes. This algorithm can be considered as an improvement of [13]. Then based on this sequential algorithm, we present a constant-time parallel…
We calculate the $S$-matrix element for the Higgs boson decay to a $Z$-boson and a photon, $h\to Z\gamma$, at one-loop in the Standard-Model Effective Field Theory (SMEFT) framework and in linear $R_{\xi}$-gauges. Our SMEFT expansion…
We present upgraded theoretical predictions for inclusive and exclusive radiative decays of {\it B} mesons. Our results include those next-to-leading order corrections that have already been computed. Our best estimates in the Standard…
Generative molecular design has moved from proof-of-concept to real-world applicability, as marked by the surge in very recent papers reporting experimental validation. Key challenges in explainability and sample efficiency present…
In cellular automata with multiple speeds for each cell $i$ there is a positive integer $p_i$ such that this cell updates its state still periodically but only at times which are a multiple of $p_i$. Additionally there is a finite upper…
We have searched for B_{s}^{0}->hh decays, where h stands for a charged or neutral kaon, or a charged pion. These results are based on a 23.6 fb^{-1} data sample collected with the Belle detector on the \Upsilon(5S) resonance at the KEKB…
We compute semi-leptonic $B_s$ decay form factors using Heavy Quark Effective Theory on the lattice. To obtain good control of the $1/m_b$ expansion, one has to take into account not only the leading static order but also the terms arising…
This work proposes a new efficient approach for calculating the bending stiffness of two-dimensional materials using simple atomistic tests on small periodic unit cells. The tests are designed such that bending deformations are dominating…
Bandgap engineering by substituting C with B and N atoms in graphene has been shown to be a promising way to improve semiconducting properties of graphene. Such hybridized monolayers consisting of hexagonal BN phases in graphene (h-BNC)…
Fixed-parameter algorithms have been successfully applied to solve numerous difficult problems within acceptable time bounds on large inputs. However, most fixed-parameter algorithms are inherently \emph{sequential} and, thus, make no use…
Using first principles calculations, the energetic stability of two-dimensional (2D) binary compounds $XY$ is investigated, where $X$ and $Y$ indicate the metallic element from Li to Pb in the periodic table. Here, 1081 compounds in the…
A hexagonal patch is a plane graph in which inner faces have length 6, inner vertices have degree 3, and boundary vertices have degree 2 or 3. We consider the following counting problem: given a sequence of twos and threes, how many…
The effectiveness of a new algorithm, parallel tempering, is studied for numerical simulations of biological molecules. These molecules suffer from a rough energy landscape. The resulting slowing down in numerical simulations is overcome by…
We present an algorithm to extend subhalo merger trees in a low-resolution dark-matter-only simulation by conditionally matching them to those in a high-resolution simulation. The algorithm is general and can be applied to simulation data…
We study the problem of computing a full Conjunctive Query in parallel using $p$ heterogeneous machines. Our computational model is similar to the MPC model, but each machine has its own cost function mapping from the number of bits it…
By using the recent experimental measurements of B -> pi pi and B -> K pi branching ratios, we find that the amplitudes computed at the leading order of the LambdaQCD/mb expansion disagree with the observed BRs, even taking into account the…