English
Related papers

Related papers: On the DJL conjecture for order 6

200 papers

The positive semidefinite rank of a convex body $C$ is the size of its smallest positive semidefinite formulation. We show that the positive semidefinite rank of any convex body $C$ is at least $\sqrt{\log d}$ where $d$ is the smallest…

Optimization and Control · Mathematics 2017-12-06 Hamza Fawzi , Mohab Safey El Din

We give a simple proof of the matrix Spencer conjecture up to poly-logarithmic rank: given symmetric $d \times d$ matrices $A_1,\ldots,A_n$ each with $\|A_i\|_{\mathsf{op}} \leq 1$ and rank at most $n/\log^3 n$, one can efficiently find…

Data Structures and Algorithms · Computer Science 2022-08-30 Nikhil Bansal , Haotian Jiang , Raghu Meka

The article is concerned with the problem of the additivity of the tensor rank. That is for two independent tensors we study when the rank of their direct sum is equal to the sum of their individual ranks. The statement saying that…

Algebraic Geometry · Mathematics 2022-09-23 Filip Rupniewski

We give a short proof for Strassen's result that the rank of the 2 by 2 matrix multiplication tensor is at most 7. The proof requires no calculations and also no pattern matching or other type of nontrivial verification, and is based solely…

Data Structures and Algorithms · Computer Science 2025-03-10 Christian Ikenmeyer , Jakob Moosbauer

Let $p\geq 5$ be a prime number. Let $\mathsf{E}/\mathbb{Q}$ be an elliptic curve with good ordinary reduction at $p$. Let $K$ be an imaginary quadratic field where $p$ splits, and such that the generalized Heegner hypothesis holds. Under…

Number Theory · Mathematics 2025-04-16 Debanjana Kundu , Antonio Lei

Let $r$ and $n$ be positive integers such that $r<n$, and $\mathbb{K}$ be an arbitrary field. We determine the maximal dimension for an affine subspace of $n$ by $n$ symmetric (or alternating) matrices with entries in $\mathbb{K}$ and with…

Rings and Algebras · Mathematics 2016-04-21 Clément de Seguins Pazzis

We find a counterexample to a conjecture of Ga{\l}\k{e}ski by constructing for some positive integers $m<n$ a mapping $f\in C^1(\mathbb{R}^n,\mathbb{R}^n)$ satisfying $\mathrm{rank}\, Df\leq m$ that, even locally, cannot be uniformly…

Classical Analysis and ODEs · Mathematics 2018-06-05 Paweł Goldstein , Piotr Hajłasz

Let $F=(p,q):\mathbb R^2\to \mathbb R^2$ be a polynomial map with nowhere zero Jacobian determinant. A long-standing problem is to determine the largest integer $k$ such that the condition $\deg p\le k$ guarantees the global injectivity of…

Algebraic Geometry · Mathematics 2026-05-26 F. Braun , J. Gwoździewicz , F. Fernandes , B. Oréfice-Okamoto

Matrix Completion is the problem of recovering an unknown real-valued low-rank matrix from a subsample of its entries. Important recent results show that the problem can be solved efficiently under the assumption that the unknown matrix is…

Computational Complexity · Computer Science 2014-04-11 Moritz Hardt , Raghu Meka , Prasad Raghavendra , Benjamin Weitz

In this article, we verify the additivity for rank of a sum of coprime monomials and bivariate polynomials generalizing the result in (\cite{CCG}). We also show similar results hold for cactus rank.

Algebraic Geometry · Mathematics 2014-06-24 Youngho Woo

A rack on $[n]$ can be thought of as a set of maps $(f_x)_{x \in [n]}$, where each $f_x$ is a permutation of $[n]$ such that $f_{(x)f_y} = f_y^{-1}f_xf_y$ for all $x$ and $y$. In 2013, Blackburn showed that the number of isomorphism classes…

Combinatorics · Mathematics 2017-06-28 Matthew Ashford , Oliver Riordan

The low-rank matrix completion problem asks whether a given real matrix with missing values can be completed so that the resulting matrix has low rank or is close to a low-rank matrix. The completed matrix is often required to satisfy…

Computational Complexity · Computer Science 2025-06-24 Dror Chawin , Ishay Haviv

The theory of elliptic pairs, as investigated in a paper by Castravet, Laface, Tevelev, and Ugaglia, provides useful conditions to determine polyhedrality of the pseudo-effective cone, which give rise to interesting arithmetic questions…

Algebraic Geometry · Mathematics 2023-11-30 Pranavkrishnan Ramakrishnan

This papers contains two results concerning random $n \times n$ Bernoulli matrices. First, we show that with probability tending to one the determinant has absolute value $\sqrt {n!} \exp(O(\sqrt(n log n)))$. Next, we prove a new upper…

Combinatorics · Mathematics 2008-07-01 Terence Tao , Van Vu

We consider 2-positive almost order zero (disjointness preserving) maps on C*-algebras. Generalizing the argument of M. Choi for multiplicative domains, we give an internal characterization of almost order zero for 2-positive maps. It is…

Operator Algebras · Mathematics 2020-10-13 Yasuhiko Sato

We prove that any odd-dimensional modular category of rank at most 23 is pointed. We also show that an odd-dimensional modular category of rank 25 is either pointed, perfect, or equivalent to $\operatorname{Rep}(D^\omega(\mathbb Z_7\rtimes…

Quantum Algebra · Mathematics 2023-11-01 Agustina Czenky , William Gvozdjak , Julia Plavnik

It is well known that the Chern classes $c_i$ of a rank $n$ vector bundle on $\PP^N$, generated by global sections, are non-negative if $i\leq n$ and vanish otherwise. This paper deals with the following question: does the above result hold…

Algebraic Geometry · Mathematics 2009-11-26 Cristina Bertone , Margherita Roggero

In this paper, if prime $p\equiv 3\pmod 4$ is sufficiently large then we prove an upper bound on the number of occurences of any arbitrary pattern of quadratic residues and nonresidues of length $k$ as $k$ tends to $\lceil \log_2 p\rceil$.…

Number Theory · Mathematics 2022-01-25 Shivarajkumar

Let $n\geq 2$ and $\mathbb K $ be a number field of characteristic $0$. Jacobian Conjecture asserts for a polynomial map $\mathcal P$ from $\mathbb K ^n$ to itself, if the determinant of its Jacobian matrix is a nonzero constant in $\mathbb…

General Mathematics · Mathematics 2020-05-19 Jiang Liu

We show that the edge graph of a 6-dimensional polytope with 12 facets has diameter at most 6, thus verifying the d-step conjecture of Klee and Walkup in the case of d=6. This implies that for all pairs (d,n) with n-d \leq 6 the diameter of…

Combinatorics · Mathematics 2011-08-24 David Bremner , Lars Schewe