Related papers: Counting multijoints

Kelly's theorem states that a set of $n$ points affinely spanning $\mathbb{C}^3$ must determine at least one ordinary complex line (a line passing through exactly two of the points). Our main theorem shows that such sets determine at least…

We show that the number of lines in an $m$--homogeneous supersolvable line arrangement is upper bounded by $3m-3$ and we classify the $m$--homogeneous supersolvable line arrangements with two modular points up-to lattice-isotopy. A lower…

In any infinite dimensional Hilbert space $\mathcal H$ there exist orthogonal projections $Q_1$, $Q_2$ and $Q_3$, such that a sequence $(P_n... P_1(x))$ diverges in norm for some $P_1,P_2,...\in\{Q_1,Q_2,Q_3\}$ and $x\in\mathcal H$.

We construct a boundary of a finite rank free group relative to a finite list of conjugacy classes of maximal cyclic subgroups. From the cut points and uncrossed cut pairs of this boundary we construct a simplicial tree on which the group…

Let $G$ be a nonabelian, simple group with a nontrivial conjugacy class $C \subseteq G$. Let $K$ be a diagram of an oriented knot in $S^3$, thought of as computational input. We show that for each such $G$ and $C$, the problem of counting…

Given a link L in the 3-sphere, we ask whether the components of L bound disjoint, nullhomologous disks properly embedded in a simply-connected positive-definite smooth 4-manifold; the knot case has been studied extensively in work of…

We say that a finite set of red and blue points in the plane in general position can be $K_{1,3}$-covered if the set can be partitioned into subsets of size $4$, with $3$ points of one color and $1$ point of the other color, in such a way…

Halin [1965] proved that if a graph has $n$ many pairwise disjoint rays for each $n$ then it has infinitely many pairwise disjoint rays. We analyze the complexity of this and other similar results in terms of computable and proof theoretic…

This paper considers the task of connecting points on a piece of paper by drawing a curve between each pair of them. Under mild assumptions, we prove that many pairwise disjoint curves are unavoidable if either of the following rules is…

The intersection distribution of a polynomial $f$ over finite field $\mathbb{F}_q$ was recently proposed in Li and Pott (arXiv:2003.06678v1), which concerns the collective behaviour of a collection of polynomials $\{f(x)+cx \mid c \in…

There are many notions of rank in multilinear algebra: tensor rank, partition rank, slice rank, and strength (or Schmidt rank) are a few examples. Typically the rank $\le r$ locus is not Zariski closed, and understanding the closure (the…

A more sums than differences (MSTD) set $A$ is a subset of $\mathbb{Z}$ for which $|A+A| > |A-A|$. Martin and O'Bryant used probabilistic techniques to prove that a non-vanishing proportion of subsets of $\{1, \dots, n\}$ are MSTD as $n \to…

For each pair $(Q_i,Q_j)$ of reference points and each real number $r$ there is a unique hyperplane $h \perp Q_iQ_j$ such that $d(P,Q_i)^2 - d(P,Q_j)^2 = r$ for points $P$ in $h$. Take $n$ reference points in $d$-space and for each pair…

We study continuous embeddings of the long line L into L^n (n>1) up to ambient isotopy of L^n. We define the direction of an embedding and show that it is (almost) a complete invariant in the case n=2 for continuous embeddings, and in the…

We derive an asymptotic formula for the number of connected 3-uniform hypergraphs with vertex set $[N]$ and $M$ edges for $M=N/2+R$ as long as $R$ satisfies $R = o(N)$ and $R=\omega(N^{1/3}\ln^{2} N)$. This almost completely fills the gap…

In this paper, we study the category of trigroups as a generalization of the notion of digroup [4] and analyze their relationship with 3-racks [1] and Leibniz 3-algebras [6]. Trigroups are essentially associative trioids in which there are…

We describe a method to show that certain elliptic surfaces do not admit purely inseparable multisections (equivalently, that genus one curves over function fields admit no points over the perfect closure of the base field) and use it to…

In this article, three types of joins are introduced for subspaces of a vector space. Decompositions of the Gra{\ss}mannian into joins are discussed. This framework admits a generalization of large set recursion methods for block designs to…

This dissertation studies the Fourier restriction, which is to find the range of the constants p, q such that the L^q norm on a chosen subset of the Fourier domain is bounded above by the L^p norm in a spacial domain, up to some constant…

The Multicut problem asks for a minimum cut separating certain pairs of vertices: formally, given a graph $G$ and demand graph $H$ on a set $T\subseteq V(G)$ of terminals, the task is to find a minimum-weight set $C$ of edges of $G$ such…