Related papers: Generalized Lantern Relations and Planar Line Arra…
Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…
The Szemer\'edi-Trotter theorem gives a bound on the maximum number of incidences between points and lines on the Euclidean plane. In particular it says that $n$ lines and $n$ points determine $O(n^{4/3})$ incidences. Let us suppose that an…
We prove that under certain combinatorial conditions, the realization spaces of line arrangements on the complex projective plane are connected. We also give several examples of arrangements with eight, nine and ten lines which have…
We prove that the vanishings of the modified diagonal cycles of Gross and Schoen govern the $\mathbb{Z}$-linear relations between small $m$-diagonals $\text{pt}^{\{1,\ldots,n\}\setminus A}\times\Delta_A$ in the rational Chow ring of $X^n$…
We observe that for planar graphs, the geometric duality relation generates both 2-isomorphism and abstract duality. This observation has the surprising consequence that for links, the equivalence relation defined by isomorphisms of…
We show that twisted doubled tori can be used to construct a general class of worldsheet models describing non-geometric string backgrounds. By employing a first order formulation of interacting chiral bosons, we first refine the analysis…
A general definition of a linear connection in noncommutative geometry has been recently proposed. Two examples are given of linear connections in noncommutative geometries which are based on matrix algebras. They both possess a unique…
We prove the existence of complexified real arrangements with the same combinatorics but different embeddings in the complex projective plane. Such pair of arrangements has an additional property: they admit conjugated equations on the ring…
A classical theorem of De Bruijn and Erd\H{o}s asserts that any noncollinear set of n points in the plane determines at least n distinct lines. We prove that an analogue of this theorem holds for graphs. Restricting our attention to…
A set of $n$ points in the Euclidean plane determines at least $n$ distinct lines unless these $n$ points are collinear. In 2006, Chen and Chv\'atal asked whether the same statement holds true in general metric spaces, where the line…
We describe a "concentration on the diagonal" condition on the Khovanov complex of tangles, show that this condition is satisfied by the Khovanov complex of the single crossing tangles, and prove that it is preserved by alternating planar…
In paper "A new twist on Lorenz links" (Journal of Topology 2(2009), 227-248) Joan Birman and Ilya Kofman prove the coincidence of the class of Lorenz links and the class of twisted links. The proof in that work is algebraic. We will…
We consider knots whose diagrams have a high amount of twisting of multiple strands. By encircling twists on multiple strands with unknotted curves, we obtain a link called a generalized augmented link. Dehn filling this link gives the…
In this paper, we show that symmetries, which are known in the theory of integrable systems, naturally appeared in the classical linear theory of deformations of thin shells. Our result shows that if the middle surface of a shell becomes…
For line arrangements in P^2 with nice combinatorics (in particular, for those which are nodal away the line at infinity), we prove that the combinatorics contains the same information as the fundamental group together with the meridianal…
The correspondence between 2-parameter families of oriented lines in ${\Bbb{R}}^3$ and surfaces in $T{\Bbb{P}}^1$ is studied, and the geometric properties of the lines are related to the complex geometry of the surface. Congruences…
We derive a generalized unitarity relation for an arbitrary linear scattering system that may violate unitarity, time-reversal invariance, ${\cal PT}$-symmetry, and transmission reciprocity.
In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a…
Generalizing work of Marin [12], we construct in a unified way all the "braids and ties'' algebras available in literature and new ones.
We generalize Jones' planar algebras by internalising the notion to a pivotal braided tensor category $\mathcal{C}$. To formulate the notion, the planar tangles are now equipped with additional `anchor lines' which connect the inner circles…