Related papers: Six Ways to Implement Divisibility by Three in min…

We numerically integrate finite two- and three-loop scalar integrals using the threshold subtraction method. This represents a first step towards extending our calculation of the $N_f$-part to the full NNLO virtual corrections for the…

A long-investigated problem in circuit complexity theory is to decompose an $n$-input or $n$-variable Majority Boolean function (call it $M_n$) using $k$-input ones ($M_k$), $k < n$, where the objective is to achieve the decomposition using…

We propose a method for certifying the fairness of the classification result of a widely used supervised learning algorithm, the k-nearest neighbors (KNN), under the assumption that the training data may have historical bias caused by…

Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…

In this paper, by using Strang's second-order splitting method, the numerical procedure for the three-dimensional (3D) space fractional Allen-Cahn equation can be divided into three steps. The first and third steps involve an ordinary…

Side-channel based instruction disassembly has been proposed as a low-cost and non-invasive approach for security applications such as IP infringement detection, code flow analysis, malware detection, and reconstructing unknown code from…

There is strong evidence for the belief that `almost all' finite semigroups, whether we consider multiplication operations on a fixed set or their isomorphism classes, are nilpotent of index 3 (3-nilpotent for short). The only known method…

A deterministic algorithm for factoring $n$ using $n^{1/3+o(1)}$ bit operations is presented. The algorithm tests the divisibility of $n$ by all the integers in a short interval at once, rather than integer by integer as in trial division.…

A Kallen-Lehman approach to 3D Ising model is analyzed numerically both at low and high temperature. It is shown that, even assuming a minimal duality breaking, one can fix three parameters of the model to get a very good agreement with the…

Let ${{B}_{3}}(n)$ denote the number of partition triples of $n$ where each partition is 3-core. With the help of generating function manipulations, we find several infinite families of arithmetic identities and congruences for…

We study the problem of fairly allocating a set of m indivisible chores (items with non-positive value) to n agents. We consider the desirable fairness notion of 1-out-of-d maximin share (MMS) -- the minimum value that an agent can…

We present a statically typed embedding of relational programming (specifically a dialect of miniKanren with disequality constraints) in Haskell. Apart from handling types, our dialect extends standard relational combinator repertoire with…

Two algorithms for computing $P(n,m)$, the number of integer partitions of $n$ into exactly $m$ parts, are described, and using a combination of these two algorithms, the resulting algorithm is $O(n^{3/2})$. The second algorithm uses a list…

The method of brackets is an efficient method for the evaluation of a large class of definite integrals on the half-line. It is based on a small collection of rules, some of which are heuristic. The extension discussed here is based on the…

In this paper, we introduce a new method for calculating fractional integrals and differentials. The method involves an equation that we have obtained from infinite applied integration by parts. The equation works for special class of…

This paper presents a way of reducing the complexity of parsing free coordination. It lives on the Coordinative Count Invariant, a property of derivable sequences in occurrence-sensitive categorial grammar. This invariant can be exploited…

Here we present four independent advances which facilitate the computation of phonons and their interactions from first-principles. First, we implement a group-theoretical approach to construct the order N Taylor series of a d-dimensional…

Splitting algorithms for finding a zero of sum of operators often involve multiple steps which are referred to as forward or backward steps. Forward steps are the explicit use of the operators and backward steps involve the operators…

Consider the set $\{1,2,\ldots,3n\}$. We are interested in the number of partitions of this set into subsets of three elements each, where the sum of two of them equals the third. We give some criteria such a partition has to fulfill, which…

We discuss an algorithm for the numerical evaluation of NLO multiparton processes. We focus hereby on the virtual part of the NLO calculation, i.e. on evaluating the one-loop integration numerically. We employ and extend the ideas of the…