Related papers: Parallel Weighings
In this note, we find a new inequality involving primes and deduce several Bonse-type inequalities.
We describe a novel analogue algorithm that allows the simultaneous factorization of an exponential number of large integers with a polynomial number of experimental runs. It is the interference-induced periodicity of "factoring"…
Analogical reasoning is the ability to detect parallels between two seemingly distant objects or situations, a fundamental human capacity used for example in commonsense reasoning, learning, and creativity which is believed by many…
This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement on the two states to determine the players' payoffs. We…
We consider a logical puzzle which we call double pouring problem, which was original defined for $k=3$ vessels. We generalize this definition to $k \ge 2 $ as follows. Each of the $k$ vessels contains an integer amount of water, called its…
The aim of this article is to study rational parallelisms of algebraic varieties by means of the transcendence of their symmetries. The nature of this transcendence is measured by a Galois group built from the Picard-Vessiot theory of…
Determining the degree of inherent parallelism in classical sequential algorithms and leveraging it for fast parallel execution is a key topic in parallel computing, and detailed analyses are known for a wide range of classical algorithms.…
A probabilistic representation for initial value semilinear parabolic problems based on generalized random trees has been derived. Two different strategies have been proposed, both requiring generating suitable random trees combined with a…
The aim of this note is to show that Poincar\'e inequalities imply corresponding weighted versions in a quite general setting. Fractional Poincar\'e inequalities are considered, too. The proof is short and does not involve covering…
Unitals can be obtained as closures of affine unitals via parallelisms. The isomorphism type of the closure depends on the chosen parallelism, which need not be unique. For affine $\operatorname{SL}(2,q)$-unitals, we introduce a class of…
In this paper, we present several improvements in the parallelization of the in-place merge algorithm, which merges two contiguous sorted arrays into one with an O(T) space complexity (where T is the number of threads). The approach divides…
We establish some new theorems on pentagon and pentagram.
In this paper some new ways of generalizing perfect numbers are investigated, numerical results are presented and some conjectures are established.
In this paper we suggest analytical methods and associated algorithms for determining the sum of the subsets $X_m$ of the set $X_n$ (subset sum problem). Our algorithm has time complexity $T=O(C_{n}^{k})$ ($k=[m/2]$, which significantly…
Parallel fixed-parameter tractability studies how parameterized problems can be solved in parallel. A surprisingly large number of parameterized problems admit a high level of parallelization, but this does not mean that we can also…
A new $q$-analogue of Appell polynomial sequences and their generalizations are introduced and their main characterizations are proved. As consequences new $q$-analogue of Bernoulli and Euler polynomials and numbers is introduced, their…
Recently, Lai and Rohatgi discovered a shuffling theorem for lozenge tilings of doubly-dented hexagons, which generalized the earlier work of Ciucu. Later, Lai proved an analogous theorem for centrally symmetric tilings, which generalized…
In this letter, we prove an inequality involving alternating binomial logarithmic sums by exploiting the variance of the logarithm of the maximum of independent and identically distributed exponential random variables. This inequality was…
In this article we prove the impossibility of some disentanglement puzzles, first building mathematical models that reflect the essential characteristics of these puzzles.
Given a set of coins arranged in a line, we remove heads-up coins one at a time and flip any adjacent coins after each removal. The coin-removal problem is to determine for which arrangements of coins it is possible to remove all of the…