Related papers: Singer difference sets and the projective norm gra…
Matching minors are a specialisation of minors fit for the study of graph with perfect matchings. The notion of matching minors has been used to give a structural description of bipartite graphs on which the number of perfect matchings can…
A digraph $H$ is a ``semi-strong minor'' of another, $G$, if a subdivision of $H$ can be obtained from a subdigraph of $G$ by contracting strongly-connected subdigraphs to single vertices. We will define a width measure of ``plane''…
The projective norm graphs P(q, 4) introduced by Alon, R\'onyai and Szab\'o are explicit examples of extremal graphs not containing K_4,7. Ball and Pepe showed that P(q, 4) does not contain a copy of K_5,5 either for q >= 7, asymptotically…
A graph $G$ is a non-separating planar graph if there is a drawing $D$ of $G$ on the plane such that (1) no two edges cross each other in $D$ and (2) for any cycle $C$ in $D$, any two vertices not in $C$ are on the same side of $C$ in $D$.…
A strong blocking set in a finite projective space is a set of points that intersects each hyperplane in a spanning set. We provide a new graph theoretic construction of such sets: combining constant-degree expanders with asymptotically…
Let $k$ be an integer with $k\geq 2$. A $k$-king in a digraph $D$ is a vertex which can reach every other vertex by a directed path of length at most $k$ and a non-king is a vertex which is not a 3-king. A subset $K$ is $k$-independent if…
A universal representation theorem is derived that shows any graph is the intersection graph of one chordal graph, a number of co-bipartite graphs, and one unit interval graph. Central to the the result is the notion of the clique cover…
We show that every $(2^n,2^n,2^n,1)$-relative difference set $D$ in $\Z_4^n$ relative to $\Z_2^n$ can be represented by a polynomial $f(x)\in \F_{2^n}[x]$, where $f(x+a)+f(x)+xa$ is a permutation for each nonzero $a$. We call such an $f$ a…
We prove that the $k$-power of any planar graph $G$ is contained in $H\boxtimes P\boxtimes K_{f(\Delta(G),k)}$ for some graph $H$ with bounded treewidth, some path $P$, and some function $f$. This resolves an open problem of Ossona de…
We study the Horn problem in the context of algebraic codes on a smooth projective curve defined over a finite field, reducing the problem to the representation theory of the special linear group $SL(2,F_q)$. We characterize the…
An $\mathbb{F}_q$-linear set of rank $k$ on a projective line $\mathrm{PG}(1,q^h)$, containing at least one point of weight one, has size at least $q^{k-1}+1$ (see [J. De Beule and G. Van De Voorde, The minimum size of a linear set, J.…
An inclusion of II$_1$ factors $N \subset M$ with finite Jones index gives rise to a powerful set of invariants that can be approached successfully in a number of different ways. We describe Jones' pictorial description of the standard…
We describe the norming sets for the space of global holomorphic sections to a $k$-power of a positive holomorphic line bundle on a compact complex manifold $X$. We characterize in metric terms the sequence of measurable subsets…
The set $\mathcal{R}_{G}(h,k)$ consists of all possible sizes for the $h$-fold sumset of sets containing $k$ elements from an additive abelian group $G$. The exact makeup of this set is still unknown, but there has been progress towards…
The Kadison-Singer Conjecture, as proved by Marcus, Spielman, and Srivastava (MSS) [Ann. Math. 182, 327-350 (2015)], has been informally thought of as a strengthening of Batson, Spielman, and Srivastava's theorem that every undirected graph…
We determine the structure of the obstruction group of the Hasse norm principle for a finite separable extension $K/k$ of a global field of degree $d$, where $d$ has a square-free prime factor $p$ and a $p$-Sylow subgroup of the Galois…
We give the first linear kernels for the (Connected) Dominating Set problems on H-topological minor free graphs. We prove the existence of polynomial time algorithms that, for a given H-topological-minor-free graph G and a positive integer…
Assuming projective determinacy, we extend Spector's strong version of the Spector-Gandy Theorem to all odd levels of the projective hierarchy: Theorem. For every space $X$ which is a finite product of the natural numbers $N$ and Baire…
In this paper we show that simple semidefinite programs inspired by degree $4$ SOS can exactly solve the tensor nuclear norm, tensor decomposition, and tensor completion problems on tensors with random asymmetric components. More precisely,…
In the 1960s, statistical physicists discovered a fascinating algorithm for counting perfect matchings in planar graphs. Valiant later showed that the same problem is #P-hard for general graphs. Since then, the algorithm for planar graphs…