Related papers: 3-nets realizing a diassociative loop in a project…
In Francis and Steel (2015), it was shown that there exists non-trivial networks on $4$ leaves upon which the distance metric affords a metric on a tree which is not the base tree of the network. In this paper we extend this result in two…
We consider the space of all configurations of finitely many (potentially nested) circles in the plane. We prove that this space is aspherical, and compute the fundamental group of each of its connected components. It turns out these…
Let $\mathcal G$ be a family of subsets of an $n$-element set. The family $\mathcal G$ is called $3$-wise $t$-intersecting if the intersection of any three subsets in $\mathcal G$ is of size at least $t$. For a real number $p\in(0,1)$ we…
We prove the conjectures of Yau-Zaslow and Gottsche concerning the number curves on K3 surfaces. Specifically, let X be a K3 surface and C be a holomorphic curve in X representing a primitive homology class. We count the number of curves of…
We present NPNet, a fully non-parametric approach for 3D point-cloud classification and part segmentation. NPNet contains no learned weights; instead, it builds point features using deterministic operators such as farthest point sampling,…
Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…
Modern digital engineering design process commonly involves expensive repeated simulations on varying three-dimensional (3D) geometries. The efficient prediction capability of neural networks (NNs) makes them a suitable surrogate to provide…
We study point-line incidence structures and their properties in the projective plane. Our motivation is the problem of the existence of $(n_4)$ configurations, still open for few remaining values of $n$. Our approach is based on…
We study finite groups arising from configurations of pairwise skew lines in $\mathbb{P}^3_K$. To such a configuration ${L}$ one associates a group $G_{L}\subset \mathrm{PGL}_2(K)$ acting on each line, and we investigate which finite…
The SL(3,C)-representation variety R of a free group F arises naturally by considering surface group representations for a surface with boundary. There is a SL(3,C)-action on the coordinate ring of R by conjugation. The geometric points of…
A set of vertices of a graph $G$ such that each vertex of $G$ is either in the set or is adjacent to a vertex in the set is called a dominating set of $G$. If additionally, the set of vertices induces a connected subgraph of $G$ then the…
The elementary divisors of the incidence matrices of lines in $PG(3,p)$ are computed, where two lines are incident if and only if they are skew.
Product structure theorems are a collection of recent results that have been used to resolve a number of longstanding open problems on planar graphs and related graph classes. One particularly useful version states that every planar graph…
To each supersimple $2-(n,4,\lambda)$ design $\mathcal{D}$ one associates a `Conway groupoid,' which may be thought of as a natural generalisation of Conway's Mathieu groupoid associated to $M_{13}$ which is constructed from $\mathbb{P}_3$.…
Learning powerful deep generative models for 3D shape synthesis is largely hindered by the difficulty in ensuring plausibility encompassing correct topology and reasonable geometry. Indeed, learning the distribution of plausible 3D shapes…
Entanglement is a complexity measure of digraphs that origins in fixed-point logics. Its combinatorial purpose is to measure the nested depth of cycles in digraphs. We address the problem of characterizing the structure of graphs of…
We describe a new infinite family of line arrangements in the projective plane with only triple points singularities and recover previously known examples.
Coupled cell systems associated with a coupled cell network are determined by (smooth) vector fields that are consistent with the network structure. Here, we follow the formalisms of Stewart, Golubitsky and Pivato (Symmetry groupoids and…
We study configurations of $n$ points and $n$ lines that form $\Theta(n^{4/3})$ incidences, when the point set is a Cartesian product. We prove structural properties of such configurations, such that there exist many families of parallel…
Consider a family $\mathcal{T}$ of 3-connected graphs of moderate growth, and let $\mathcal{G}$ be the class of graphs whose 3-connected components are graphs in $\mathcal{T}$. We present a general framework for analyzing such graphs…