Related papers: Circles and crossing planar compact convex sets

Proposed in 1954 by Gell-Mann, Goldberger, and Thirring, crossing symmetry postulates that particles are indistinguishable from anti-particles traveling back in time. Its elusive proof amounts to demonstrating that scattering matrices in…

In 1970 Lov\'asz conjectured that every connected vertex-transitive graph admits a Hamilton cycle, apart from five exceptional graphs. This conjecture has recently been settled for graphs defined by intersecting set systems, which feature…

In 1898, Tait asserted several properties of alternating knot diagrams. These assertions became known as Tait's conjectures and remained open until the discovery of the Jones polynomial in 1985. The new polynomial invariants soon led to…

In recent work of T. Cassidy and the author, a notion of complete intersection was defined for (non-commutative) regular skew polynomial rings, defining it using both algebraic and geometric tools, where the commutative definition is a…

The notion of constant cycle curves on K3 surfaces is introduced. These are curves that do not contribute to the Chow group of the ambient K3 surface. Rational curves are the most prominent examples. We show that constant cycle curves…

It is very well-known that there are precisely two minimal non-planar graphs: $K_5$ and $K_{3,3}$ (degree 2 vertices being irrelevant in this context). In the language of crossing numbers, these are the only 1-crossing-critical graphs: they…

We define and study noncommutative crossing partitions which are a generalization of non-crossing partitions. By introducing a new cover relation on binary trees, we show that the partially ordered set of noncommutative crossing partitions…

Since the crossing number of K_{12} is now known to be 150, it is well-known that simple counting arguments and Kleitman's parity theorem for the crossing number of K_{2n+1} combine with a specific drawing of K_{13} to show that the…

We solve two open problems in Coxeter-Catalan combinatorics. First, we introduce a family of rational noncrossing objects for any finite Coxeter group, using the combinatorics of distinguished subwords. Second, we give a type-uniform proof…

For a proper map $f:X\to S$ between varieties over $\mathbb{C}$ with $X$ smooth, we introduce increasing filtrations $\textbf{P}^{\leq \cdot}_f\subset P^{\leq \cdot}_f$ on $\text{gr}^\cdot K_\cdot(X)$, the associated graded on $K$-theory…

The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. Our main result is that every graph $G$ that does not contain a fixed graph as a minor has crossing number $O(\Delta n)$, where $G$…

We prove new lower bounds on the crossing number of a complete graphs assuming that it is drawn in such a way that it contains a Hamiltonian cycle with no crossings.

We define a $C(k)$ to be a family of $k$ sets $F_1,\dots,F_k$ such that $\textrm{conv}(F_i\cup F_{i+1})\cap \textrm{conv}(F_j\cup F_{j+1})=\emptyset$ when $\{i,i+1\}\cap \{j,j+1\}=\emptyset$ (indices are taken modulo $k$). We show that if…

This paper has two objectives. First, we study lattices with skew-Hermitian forms over division algebras with positive involutions. For division algebras of Albert types I and II, we show that such a lattice contains an "orthogonal" basis…

We prove a converse theorem for split even special orthogonal groups over finite fields. This is the only case left on converse theorems of split classical groups and the difficulty is the existence of the outer automorphism. In this paper,…

A conjecture of Richter and Salazar about graphs that are critical for a fixed crossing number $k$ is that they have bounded bandwidth. A weaker well-known conjecture of Richter is that their maximum degree is bounded in terms of $k$. In…

The crossing number of a graph is the minimum number of crossings over all of its drawings on the plane. The Crossing Lemma, proved more than 40 years ago, is a tight lower bound on the crossing number of a graph in terms of the number of…

A cap of spherical radius $\alpha$ on a unit $d$-sphere $S$ is the set of points within spherical distance $\alpha$ from a given point on the sphere. Let $\mathcal F$ be a finite set of caps lying on $S$. We prove that if no hyperplane…

The main result is a wall crossing formula for central projections defined on submanifolds of a real projective space. Our formula gives the jump of the degree of such a projection when the center of the projection varies. The fact that the…

The Carpenter's Rule Theorem states that any chain linkage in the plane can be folded continuously between any two configurations while preserving the bar lengths and without the bars crossing. However, this theorem applies only to strictly…