1,533 research outputs found

    Probabilistic lower bounds on maximal determinants of binary matrices

    Full text link
    Let D(n){\mathcal D}(n) be the maximal determinant for n×nn \times n {±1}\{\pm 1\}-matrices, and R(n)=D(n)/nn/2\mathcal R(n) = {\mathcal D}(n)/n^{n/2} be the ratio of D(n){\mathcal D}(n) to the Hadamard upper bound. Using the probabilistic method, we prove new lower bounds on D(n){\mathcal D}(n) and R(n)\mathcal R(n) in terms of d=n−hd = n-h, where hh is the order of a Hadamard matrix and hh is maximal subject to h≀nh \le n. For example, R(n)>(πe/2)−d/2\mathcal R(n) > (\pi e/2)^{-d/2} if 1≀d≀31 \le d \le 3, and R(n)>(πe/2)−d/2(1−d2(π/(2h))1/2)\mathcal R(n) > (\pi e/2)^{-d/2}(1 - d^2(\pi/(2h))^{1/2}) if d>3d > 3. By a recent result of Livinskyi, d2/h1/2→0d^2/h^{1/2} \to 0 as n→∞n \to \infty, so the second bound is close to (πe/2)−d/2(\pi e/2)^{-d/2} for large nn. Previous lower bounds tended to zero as n→∞n \to \infty with dd fixed, except in the cases d∈{0,1}d \in \{0,1\}. For d≄2d \ge 2, our bounds are better for all sufficiently large nn. If the Hadamard conjecture is true, then d≀3d \le 3, so the first bound above shows that R(n)\mathcal R(n) is bounded below by a positive constant (πe/2)−3/2>0.1133(\pi e/2)^{-3/2} > 0.1133.Comment: 17 pages, 2 tables, 24 references. Shorter version of arXiv:1402.6817v4. Typos corrected in v2 and v3, new Lemma 7 in v4, updated references in v5, added Remark 2.8 and a reference in v6, updated references in v

    Embedding cocylic D-optimal designs in cocylic Hadamard matrices

    Get PDF
    A method for embedding cocyclic submatrices with “large” determinants of orders 2t in certain cocyclic Hadamard matrices of orders 4t is described (t an odd integer). If these determinants attain the largest possible value, we are embedding D-optimal designs. Applications to the pivot values that appear when Gaussian elimination with complete pivoting is performed on these cocyclic Hadamard matrices are studied.Ministerio de Ciencia e Innovación MTM2008-06578Junta de Andalucía FQM-016Junta de Andalucía P07-FQM-0298

    An explicit construction for neighborly centrally symmetric polytopes

    Get PDF
    We give an explicit construction, based on Hadamard matrices, for an infinite series of floor{sqrt{d}/2}-neighborly centrally symmetric d-dimensional polytopes with 4d vertices. This appears to be the best explicit version yet of a recent probabilistic result due to Linial and Novik, who proved the existence of such polytopes with a neighborliness of d/400.Comment: 9 pages, no figure
    • 

    corecore