Improved packings of n(n-1) unit squares in a square

被引：0

作者：

Arslanov, M. Z. ^{[1
]}

Mustafin, S. A. ^{[1
]}

Shangitbayev, Z. K. ^{[2
]}

机构：

[1] Inst Informat & Computat Technol, Alma Ata, Kazakhstan

[2] Almaty Management Univ, Alma Ata, Kazakhstan

来源：

ELECTRONIC JOURNAL OF COMBINATORICS | 2021年 / 28卷 / 04期

关键词：

D O I：

10.37236/8586

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let s(n) be the side of the smallest square into which we can pack n unit squares. The purpose of this paper is to prove that s(n(2) - n) < n for all n >= 12. Besides, we show that s(18(2) - 17) < 18, s(17(2) - 16) < 17, and s(16(2) - 15) < 16.

引用

页数：11

共 50 条

[41] (n(n-1))/2的妙用
于新彬
福建教育, 2016, (44) : 33 - 34
[42] 用n还是用n-1?
向辉
统计, 1987, (08) : 39 - 39
[43] The least singular value of a random square matrix is O(n-1/2)
Rudelson, Mark
Vershynin, Roman
COMPTES RENDUS MATHEMATIQUE, 2008, 346 (15-16) : 893 - 896
[44] FURTHER COMMENTS ON N VS N-1
GAMES, PA
AMERICAN EDUCATIONAL RESEARCH JOURNAL, 1971, 8 (03) : 582 - 584
[45] 1/(n(n+1))=1/n-1/(n+1)的应用
刘运宜
中学生数学, 2012, (18) : 11 - 12
[46] Hermitian metrics, (n-1, n-1) forms and Monge-Ampere equations
Tosatti, Valentino
Weinkove, Ben
JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK, 2019, 755 : 67 - 101
[47] 关于Diophantine方程（a~n-1）(（a+1）~n-1)=x2
梁明
数学杂志, 2012, 32 (03) : 511 - 514
[48] COVERING AN N X N CHESSBOARD WITH N-1 LINES
GOLDBERG, M
OSNER, H
KELLER, T
AMERICAN MATHEMATICAL MONTHLY, 1982, 89 (06): : 425 - 426
[49] 满足φ(n)|n-1的合数n(英文)
单壿
中国科学技术大学学报, 1985, (01) : 109 - 112
[50] RANDOM PACKINGS AND COVERINGS OF UNIT N-SPHERE
WYNER, AD
BELL SYSTEM TECHNICAL JOURNAL, 1967, 46 (09): : 2111 - +

← 1 2 3 4 5 →