𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sets of Uniqueness and Minimal Matrices

✍ Scribed by Adolfo Torres-Cházaro; Ernesto Vallejo

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
142 KB
Volume
208
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

✦ Synopsis

In this note we give an algebraic characterization of sets of uniqueness in terms of matrices with non-negative integer coefficients and prescribed row and column sums, and of the dominance order of partitions or majorization. Our proof uses some identities involving characters of the symmetric group. As an application we Ž .

📜 SIMILAR VOLUMES

Minimal Completely Separating Systems of
Minimal Completely Separating Systems of k-Sets
✍ André Kündgen; Dhruv Mubayi; Prasad Tetali 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Let n and k be fixed positive integers. A collection C of k-sets of [n] is a completely separating system if, for all distinct i, j # [n], there is an S # C for which i # S and j  S. Let R(n, k) denote the minimum size of such a C. Our results include showing that if n k is a sequence with k< 0, th

Mass matrices by minimization of modal e
Mass matrices by minimization of modal errors
✍ Per-Anders Hansson; Göran Sandberg 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 274 KB

A new approach to constructing mass matrices is presented, based on expressing it through use of a variable parameter. This allows the mass matrix to be adjusted in such a way that a simple eigenvalue problem get the best solution possible in terms of some error measure. This procedure is used to cr

Minimal Diameter of Certain Sets in the
Minimal Diameter of Certain Sets in the Plane
✍ András Bezdek; Ferenc Fodor 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 91 KB

We investigate the problem of finding the smallest diameter D(n) of a set of n points such that all the mutual distances between them are at least 1. The asymptotic behaviour of D(n) is known; the exact value of D(n) can be easily found up to 6 points. Bateman and Erdo s proved that D(7)=2. In this

Largest minimal blocking sets in PG(2,8)
Largest minimal blocking sets in PG(2,8)
✍ J. Barát; S. Innamorati 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB 👁 1 views

## Abstract Bruen and Thas proved that the size of a large minimal blocking set is bounded by $q \cdot {\sqrt{q}} + 1$. Hence, if __q__ = 8, then the maximal possible size is 23. Since 8 is not a square, it was conjectured that a minimal blocking 23‐set does not exist in PG(2,8). We show that this