Related papers: Coins of Three Different Weights

For $n\in\nats$ and $3\leq k\leq n$ we compute the exact value of $E_k(n)$, the maximum number of edges of a simple planar graph on $n$ vertices where each vertex bounds an $\ell$-gon where $\ell\geq k$. The lower bound of $E_k(n)$ is…

In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring $R=\mathbb{F}_2+v\mathbb{F}_2+v^2\mathbb{F}_2$, where $v^3=1.$ These codes are defined as trace codes. They have the algebraic…

Linear codes with few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of…

In arrangements of pseudocircles (Jordan curves) the weight of a vertex (intersection point) is the number of pseudocircles that contain the vertex in its interior. We give improved upper bounds on the number of vertices of weight <=k in…

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…

A proposal in a weighted voting game is accepted if the sum of the (non-negative) weights of the "yea" voters is at least as large as a given quota. Several authors have considered representations of weighted voting games with minimum sum,…

A classic three-jug puzzle asks, given three jugs $A$, $B$, and $C$ with fixed maximum capacities, with jug $A$ filled with wine to its maximum capacity, whether is it possible to divide the wine into two halves by pouring it from one jug…

A 2-coloring of the n-cube in the n-dimensional Euclidean space can be considered as an assignment of weights of 1 or 0 to the vertices. Such a colored n-cube is said to be balanced if its center of mass coincides with its geometric center.…

In 2007, Alexander Shapovalov posed an old twist on the classical coin weighing problem by asking for strategies that manage to conceal the identities of specific coins while providing general information on the number of fake coins. In…

How many squares are spanned by $n$ points in the plane? Here we study the corresponding maximum possible number $S_{\square}(n)$ of squares and determine the exact values for all $n\le 17$. For $18\le n\le 100$ we give lower bounds for…

In this paper, based on the theory of defining sets, two classes of five-weight or six-weight linear codes over Fp are constructed. The weight distributions of the linear codes are determined by means of Weil sums and a new type of…

We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles have to be packed non-overlapping and orthogonal, i.e., axis-parallel. We present an…

Cages ($r$-regular graphs of girth $g$ and minimum order) and their variants have been studied for over seventy years. Here we propose a new variant, "weighted cages". We characterize their existence; for cases $g=3,4$ we determine their…

Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we solve one more special case. The problem of finding the weight distribution is transformed into a…

For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight…

We harness both human ingenuity and the power of symbolic computation to study the number of coin tosses until reaching $n$ Heads or $m$ Tails. We also talk about the closely related problem of reaching $n$ Heads and $m$ Tails. This paper…

Admissable weight is an important tool for studying spectral invariance in operator algebra. Common admissable weights include polynomial weights and sub exponential weights. This article mainly provides a proof that polynomial weights are…

Let P be a set of n weighted points, Q be a set of m unweighted points in the plane, and k a non-negative integer. We consider the problem of computing a subset $Q'\subseteq Q$ with size at most k such that the sum of the weights of the…

Importance sampling is widely used in machine learning and statistics, but its power is limited by the restriction of using simple proposals for which the importance weights can be tractably calculated. We address this problem by studying…

We show that in a broad class of random counting measures one may identify only three that are rescaled versions of themselves when restricted to a subspace. These are Poisson, binomial and negative binomial random measures. We provide some…