In a previous report, we studied the problem of recon-Kuba's heuristic algorithm [7] reconstructs some convex sets. structing a discrete set S from its horizontal and vertical projections. Some of the properties imposed on the sets eliminate all ambigu- We defined an algorithm that decides whether
✦ LIBER ✦
A superadditivity and submultiplicativity property for cardinalities of sumsets
✍ Scribed by Katalin Gyarmati; Máté Matolcsi; Imre Z. Ruzsa
- Publisher
- Springer-Verlag
- Year
- 2010
- Tongue
- English
- Weight
- 425 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Medians of polyominoes: A property for r
✍
E. Barcucci; A. Del Lungo; M. Nivat; R. Pinzani
📂
Article
📅
1998
🏛
John Wiley and Sons
🌐
English
⚖ 273 KB
Convergence properties of MLE's and asym
✍
Taskin Atilgan; Hamparsum Bozdogan
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 533 KB
On a Property of Matrices for Subsystems
✍
Dolph Ulrich
📂
Article
📅
1976
🏛
John Wiley and Sons
🌐
English
⚖ 173 KB
A unified model of property integration
✍
Cheng-Liang Chen; Jui-Yuan Lee; Denny Kok Sum Ng; Dominic Chwan Yee Foo
📂
Article
📅
2009
🏛
American Institute of Chemical Engineers
🌐
English
⚖ 797 KB
The Hopfian property for a class of fund
✍
Karen N. Frederick
📂
Article
📅
1963
🏛
John Wiley and Sons
🌐
English
⚖ 354 KB
Closure for the property of having a ham
✍
Daniel Král; Ladislav Stacho
📂
Article
📅
2007
🏛
John Wiley and Sons
🌐
English
⚖ 252 KB
## Abstract We prove that a graph __G__ of order __n__ has a hamiltonian prism if and only if the graph Cl~4__n__/3–4/3~(__G__) has a hamiltonian prism where Cl~4__n__/3–4/3~(__G__) is the graph obtained from __G__ by sequential adding edges between non‐adjacent vertices whose degree sum is at leas