{"entities":{"Q5619113":{"pageid":7648673,"ns":120,"title":"Item:Q5619113","lastrevid":110055734,"modified":"2026-11-15T03:10:10Z","type":"item","id":"Q5619113","labels":{},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3342867"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5619113$3F7C5A8D-705B-4277-B84C-35D65FEDE3C3","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"ed4db0700f79f5e65e6610d6e79a5ff6449125ff","datavalue":{"value":"0216.02004","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5619113$860E0FBA-30FD-4826-80F4-A8B567A46267","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"494f1ab1373bf3235b5cb823eac7ac66915a0004","datavalue":{"value":{"entity-type":"item","numeric-id":190555,"id":"Q190555"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5619113$F1BC6174-9A35-4A41-8624-8BB0A95B0A5E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5b404bb1473b1407fc2efb942c0635fd7c0a4185","datavalue":{"value":{"entity-type":"item","numeric-id":3669458,"id":"Q3669458"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5619113$306354BC-F939-4EE4-9F29-2C18E28599AF","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"e293d9e9c8dba13b0feb4b9b16887fc748f70c6f","datavalue":{"value":{"time":"+1970-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5619113$B05827E8-C0DD-4C84-8892-44D29E7FBEE5","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"772466e23f65811e4792a58a12ff09d79c338e5f","datavalue":{"value":"05B20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5619113$A61EF03E-E264-459F-BB61-EDBA815D59AC","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"87f562543e161f54e6d861d158048017a81bdb12","datavalue":{"value":"3342867","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5619113$3F5B076B-0E1E-4B10-8242-809E49AB86F8","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5619113$D1DE98D8-5D7A-4221-8844-D57183D7D863","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"88cdb31bfc834ff8479f69af8ba1f5eec1b08bcf","datavalue":{"value":"From the introduction: Let us consider a quadratic \\( n \\times \\dot{n} \\) matrix with elements \\(\\pm 1\\). We can multiply arbitrary rows and columns by \\(-1\\) and our aim is to minimize the absolute value of the sum of elements of the matrix. In other words we want to draw the number of \\(+1\\) to that of \\(-1\\) as near as possible. Put \\( S_{n}= \\) \\[ S_{n}=\\max _{\\left(a_{1 j}\\right)} \\min _{x_{1}, y_{j}}\\left|\\sum_{j, j=1}^{n} a_{1}, x_{i} y_{j}\\right|, \\] where \\( x_{1}, y_{j} \\) take the values \\(\\pm 1\\) in all possible ways and the maximum is extended for all \\( n \\times n \\) matrices \\( \\left(a_{1 j}\\right. \\) ) with elements \\(\\pm 1\\). Erd\u0151s has remarked that by applying the central limit theorem it is easy to show that \\( S_{n} \\leq \\sqrt{cn\\log n} \\). Moser and Moon have guessed that for all \\(n\\) \\(S_n\\le 2\\). In this paper we prove this conjecture for \\(n\\ge n_0\\). More precisely (for \\(n>n_0\\)) \\[ S_n=1\\text{ if }n \\text{ is odd, } S_n=2\\text{ if }n \\text{ is even.} \\tag{1} \\] [Actually we shall prove that \\(S_n\\le 2\\), but this is equivalent to (1) as for odd \\(n\\)  \\(S_n\\ge 1\\), and the example (\\(a_{ii}=-1, a_{ij}=1\\) for \\(i+j>2\\)) shows that for even \\(n\\)  \\(S_n\\ge 2\\).]","type":"string"},"datatype":"string"},"type":"statement","id":"Q5619113$E050FCF5-1148-43A4-A1FD-570326C812F3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:5619113","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:5619113"}}}}}