Related papers: An extension theorem for signotopes

A space $Y$ is called an {\em extension} of a space $X$ if $Y$ contains $X$ as a dense subspace. Two extensions of $X$ are said to be {\em equivalent} if there is a homeomorphism between them which fixes $X$ point-wise. For two (equivalence…

Spanners for low dimensional spaces (e.g. Euclidean space of constant dimension, or doubling metrics) are well understood. This lies in contrast to the situation in high dimensional spaces, where except for the work of Har-Peled, Indyk and…

We use 5-brane webs to study the two-dimensional space of supersymmetric mass deformations of higher rank generalizations of the 5d $E_1$ and $\tilde{E}_1$ theories. Some of the resulting IR phases are described by IR free supersymmetric…

By adapting the iterative yardstick construction of Stockmeyer, we show that the reachability problem for vector addition systems with a stack does not have elementary complexity. As a corollary, the same lower bound holds for the…

We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…

Refining an argument of the second author, we improve the known bounds for the number of rational points near a submanifold of $\mathbb{R}^d$ of intermediate dimension under a natural curvature condition. Furthermore, in the codimension $2$…

In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite extensions of finite fields, enriched with some not published recent results as well as analyzes enhancing the qualitative…

In this paper, we introduce the concept of graded extension dimension for a group graded ring R, denoted by gr.ext.dim(R). We prove that when R is strongly graded, its graded extension dimension coincides with the non-graded extension…

Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…

Associated to Legendrian links in the standard contact three-space, Ruling polynomials are Legendrian isotopy invariants, which also compute augmentation numbers, that is, the points-counting of augmentation varieties for Legendrian links…

Whereas matrix rank is additive under direct sum, in 1981 Sch\"onhage showed that one of its generalizations to the tensor setting, tensor border rank, can be strictly subadditive for tensors of order three. Whether border rank is additive…

We construct a cover of the non-incident point-hyperplane graph of projective dimension 3 for fields of characteristic 2. If the cardinality of the field is larger than 2, we obtain an elementary construction of the non-split extension of…

In this article we investigate the century-old continuous extension problem of the Riemann map. Let $G$ be a simply connected domain. We call $\lambda$ in $\partial G$ a multiple point if there are simply connected subdomains $ U$ and $V$…

Extensions of one-parameter operator semigroups on Archimedean vector lattices to their order/ru-completions are studied. Existence and uniqueness of the extension to the ru-completion is established in the class of positive semigroups. An…

We present a new explicit construction for expander graphs with nearly optimal spectral gap. The construction is based on a series of 2-lift operations. Let $G$ be a graph on $n$ vertices. A 2-lift of $G$ is a graph $H$ on $2n$ vertices,…

In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…

We introduce a new class of line arrangements in the projective plane, called nearly supersolvable, and show that any arrangement in this class is either free or nearly free. More precisely, we show that the minimal degree of a Jacobian…

The Erd\H{o}s-Szekeres conjecture states that any set of more than $2^{n-2}$ points in the plane with no three on a line contains the vertices of a convex $n$-gon. Erd\H{o}s, Tuza, and Valtr strengthened the conjecture by stating that any…

We provide a doubly exponential upper bound in $p$ on the size of forbidden pivot-minors for symmetric or skew-symmetric matrices over a fixed finite field $\mathbb{F}$ of linear rank-width at most $p$. As a corollary, we obtain a doubly…

We consider rooted subgraphs in random graphs, i.e., extension counts such as (i) the number of triangles containing a given vertex or (ii) the number of paths of length three connecting two given vertices. In 1989, Spencer gave sufficient…