Related papers: ApSimon's Mint Problem with Three or More Weighing…
Devising a weight assignment policy for assigning credits to multiple authors of a manuscript is a challenging task. In this paper, we present a scheme for assigning credits to multiple authors that we call a polynomial weight assignment…
Counting the number of permutations of a given total displacement is equivalent to counting weighted Motzkin paths of a given area (Guay-Paquet and Petersen, 2014). The former combinatorial problem is still open. In this work, we show that…
The twin prime conjecture asserts that there are infinitely many pairs of primes that differ by two. While recent advances have improved our understanding of bounded prime gaps, the conjecture remains unresolved. This paper refines the…
The article proposes a heuristic approximation approach to the bin packing problem under multiple objectives. In addition to the traditional objective of minimizing the number of bins, the heterogeneousness of the elements in each bin is…
We consider stamps with different values (denominations) and same dimensions, and an envelope with a fixed maximum number of stamp positions. The local postage stamp problem is to find the smallest value that cannot be realized by the sum…
In this article we present method of solving some additive problems with primes. The method may be employed to the Goldbach-Euler conjecture and the twin primes conjecture. The presented method also makes it possible to obtain some…
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…
Packing problems are in general NP-hard, even for simple cases. Since now there are no highly efficient algorithms available for solving packing problems. The two-dimensional bin packing problem is about packing all given rectangular items,…
Mathematics has been used in the exploration and enumeration of juggling patterns. In the case when we catch and throw one ball at a time the number of possible juggling patterns is well-known. When we are allowed to catch and throw any…
We consider the unbalanced allocation of $m$ balls into $n$ bins by a randomized algorithm using the "power of two choices". For each ball, we select a set of bins at random, then place the ball in the fullest bin within the set.…
For given coprime positive integers $a$ and $b$, the classical Frobenius coin problem asked to find the largest number that cannot be expressed in the form $ax+by$ for nonnegative integers $x$ and $y$, also known as the Frobenius number.…
This paper is an attempt to solve an important class of hypersingular integral equations of the second kind. To this end, we apply a new weighted and modified perturbation method which includes some special cases of the Adomian…
The linear codes with a few weights have been applied widely in combinatorial designs, secret sharing, association schemes, authentication codes and strongly regular graphs. In this paper, we first correct an erroneous result about the…
The high-pressure compaction of three dimensional granular packings is simulated using a bonded particle model (BPM) to capture linear elastic deformation. In the model, grains are represented by a collection of point particles connected by…
We discuss the Fermion sign problem and, by examining a very general Hubbard-Stratonovich (HS) transformation, argue that the sign problem cannot be solved with such methods. We propose a different kind of transformation which, while not…
The multiplicative multiple Horn problem is asking to determine possible singular values of the combinations $AB, BC$ and $ABC$ for a triple of invertible matrices $A,B,C$ with given singular values. There are similar problems for…
The notion of disjoint weighing matrices is introduced as a generalization of orthogonal designs. A recursive construction along with a computer search lead to some infinite classes of disjoint weighing matrices, which in turn are shown to…
We investigate a coin-weighing puzzle that appeared in the Moscow Math Olympiad in 1991. We generalize the puzzle by varying the number of participating coins, and deduce an upper bound on the number of weighings needed to solve the puzzle…
While looking for abductive explanations of a given set of manifestations, an ordering between possible solutions is often assumed. The complexity of finding/verifying optimal solutions is already known. In this paper we consider the…
A problem that enjoys an enduring popularity asks: "what is the least number of pound weights that can be used on a scale pan to weigh any integral number of pounds from 1 to 40 inclusive, if the weights can be placed in either of the scale…