Related papers: The Intersection problem for 2-(v; 5; 1) directed …
Finding the intersection of two conics is a commonly occurring problem. For example, it occurs when identifying patterns of craters on the lunar surface, detecting the orientation of a face from a single image, or estimating the attitude of…
It is established that up to isomorphism,there are only one (K_4-e)-design of order 6, three (K_4-e)-designs of order 10 and two (K_4-e)-designs of order 11. As an application of our enumerative results, we discuss the fine triangle…
We study the version of the $k$-disjoint paths problem where $k$ demand pairs $(s_1,t_1)$, $\dots$, $(s_k,t_k)$ are specified in the input and the paths in the solution are allowed to intersect, but such that no vertex is on more than $c$…
Recall that combinatorial $2s$-designs admit a classical lower bound $b \ge \binom{v}{s}$ on their number of blocks, and that a design meeting this bound is called tight. A long-standing result of Bannai is that there exist only finitely…
Given a rank 3 real arrangement $\mathcal A$ of $n$ lines in the projective plane, the Dirac-Motzkin conjecture (proved by Green and Tao in 2013) states that for $n$ sufficiently large, the number of simple intersection points of $\mathcal…
In this paper, we design a supervisor to prevent vehicle collisions at intersections. An intersection is modeled as an area containing multiple conflict points where vehicle paths cross in the future. At every time step, the supervisor…
A problem that arises in drawings of transportation networks is to minimize the number of crossings between different transportation lines. While this can be done efficiently under specific constraints, not all solutions are visually…
We introduce a new Steiner-type problem for directed graphs named \textsc{$q$-Root Steiner Tree}. Here one is given a directed graph $G=(V,A)$ and two subsets of its vertices, $R$ of size $q$ and $T$, and the task is to find a minimum size…
A mixed graph $G$ is a graph that consists of both undirected and directed edges. An orientation of $G$ is formed by orienting all the undirected edges of $G$, i.e., converting each undirected edge $\{u,v\}$ into a directed edge that is…
Given a set of $n$ circular arcs of the same radius in the plane, we consider the problem of computing the number of intersections among the arcs. The problem was studied before and the previously best algorithm solves the problem in…
Kontsevich's work on Airy matrix integrals has led to explicit results for the intersection numbers of the moduli space of curves. In this article we show that a duality between k-point functions on $N\times N$ matrices and N-point…
The Joint Crossing Number problem asks for a simultaneous embedding of two disjoint graphs into one surface such that the number of edge crossings (between the two graphs) is minimized. It was introduced by Negami in 2001 in connection with…
We present a new solution to the doublet-triplet splitting problem which also works in a supersymmetric SU(5) grand unified theory and is testable at TeV-scale collider experiments. In our model, the SU(5) symmetry is broken through the…
This paper investigates $2$-$(v,5,\lambda)$ designs $\mathcal{D}$ admitting a block-transitive automorphism group $G$. We first prove that if $G$ is point-imprimitive, then $v$ must be one of 16, 21, or 81. We further provide a complete…
We produce a family of reductions for Schubert intersection problems whose applicability is checked by calculating a linear combination of the dimensions involved. These reductions do not alter the Littlewood-Richardson coefficient, and…
It is well-known that the Chinese postman problem on undirected and directed graphs is polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in sharp contrast to the Chinese postman problem on mixed…
Given a convex polygon of $n$ sides, one can draw $n$ disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the…
A regular-graph design is a block design for which a pair $\{a,b\}$ of distinct points occurs in $\lambda+1$ or $\lambda$ blocks depending on whether $\{a,b\}$ is or is not an edge of a given $\delta$-regular graph. Our paper describes a…
In the directed detour problem one is given a digraph $G$ and a pair of vertices $s$ and~$t$, and the task is to decide whether there is a directed simple path from $s$ to $t$ in $G$ whose length is larger than $\mathsf{dist}_{G}(s,t)$. The…
It was shown in 1989 by Delandtsheer and Doyen that, for a $2$-design with $v$ points and block size $k$, a block-transitive group of automorphisms can be point-imprimitive (that is, leave invariant a nontrivial partition of the point set)…