Related papers: Lines, Quadrics, and Cremona Transformations in Tw…

We prove new barrier results in arithmetic complexity theory, showing severe limitations of natural lifting (aka escalation) techniques. For example, we prove that even optimal rank lower bounds on $k$-tensors cannot yield non-trivial lower…

In a projective plane over a finite field, complete $(k,n)$-arcs with few characters are rare but interesting objects with several applications to finite geometry and coding theory. Since almost all known examples are large, the…

In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of…

In this paper we consider plane quartics with to involutions. We compute the Dixmier invariants, the bitangents and the Matrix representation problem of these curves, showing that they have symbolic solutions for the last two questions.

We study the problem of learning a partially observed matrix under the low rank assumption in the presence of fully observed side information that depends linearly on the true underlying matrix. This problem consists of an important…

We show that the geometry associated to certain non-split sharply 2-transitive groups does not contain a proper projective plane. For a sharply 2-transitive group of finite Morley rank we improve known rank inequalities for this geometry…

Let $n,k$ denote integers with $n>2k\geq 6$. Let $\mathbb{F}_q$ denote a finite field with $q$ elements, and let $V$ denote a vector space over $\mathbb{F}_q$ that has dimension $n$. The projective geometry $P_q(n)$ is the partially ordered…

The higher-rank numerical range is a convex compact set generalizing the classical numerical range of a square complex matrix, first appearing in the study of quantum error correction. We will discuss some of the real algebraic and convex…

The Euclidean distance geometry problem arises in a wide variety of applications, from determining molecular conformations in computational chemistry to localization in sensor networks. When the distance information is incomplete, the…

A configuration of 7 points in RP2 is called typical if it has no collinear triples and no coconic sextuples of points. We show that there exist 14 deformation classes of such configurations. This yields classification of real Aronhold…

Optimization problems with rank constraints arise in many applications, including matrix regression, structured PCA, matrix completion and matrix decomposition problems. An attractive heuristic for solving such problems is to factorize the…

We give a method for constructing many examples of automorphisms with positive entropy on rational complex surfaces. The general idea is to begin with a quadratic Cremona transformation that fixes a reduced cubic curve and then use the…

Let $X_{2k}$ be a set of $2k$ labeled points in convex position in the plane. We consider geometric non-intersecting straight-line perfect matchings of $X_{2k}$. Two such matchings, $M$ and $M'$, are disjoint compatible if they do not have…

For an $n \times n$ matrix $M$ with entries in $\mathbb{Z}_2$ denote by $R(M)$ the minimal rank of all the matrices obtained by changing some numbers on the main diagonal of $M$. We prove that for each non-negative integer $k$ there is a…

Let V be a rank N vector bundle on a d-dimensional complex projective scheme X; assume that V is equipped with a quadratic form with values in a line bundle L and that S^2 V^* \otimes L is ample. Suppose that the maximum rank of the…

Data can be visually represented using visual channels like position, length or luminance. An existing ranking of these visual channels is based on how accurately participants could report the ratio between two depicted values. There is an…

The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$-th Catalan number and independent on $m$. In this paper, we consider the refinements of Dyck paths with flaws by four…

In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful…

Let $\mathcal{K}$ denote a nonsingular conic in the complex projective plane. Pascal's theorem says that, given six distinct points $A,B,C,D,E,F$ on $\mathcal{K}$, the three intersection points $AE \cap BF, AD \cap CF, BD \cap CE$ are…

Given a $2^N$-dimensional Cayley-Dickson algebra, where $3 \leq N \leq 6$, we first observe that the multiplication table of its imaginary units $e_a$, $1 \leq a \leq 2^N -1$, is encoded in the properties of the projective space PG$(N-1,2)$…