Related papers: An algorithm for constructing some maximal arcs in…
We give a classification of all possible $2$-adic images of Galois representations associated to elliptic curves over $\mathbb{Q}$. To this end, we compute the 'arithmetically maximal' tower of 2-power level modular curves, develop…
In this paper it has been verified, by a computer-based proof, that the smallest size of a complete arc is 14 in PG(2,31) and in PG(2,32). Some examples of such arcs are also described.
We present the first optimal randomized algorithm for constructing the order-$k$ Voronoi diagram of $n$ points in two dimensions. The expected running time is $O(n\log n + nk)$, which improves the previous, two-decades-old result of Ramos…
We show that the maximum number of convex polygons in a triangulation of $n$ points in the plane is $O(1.5029^n)$. This improves an earlier bound of $O(1.6181^n)$ established by van Kreveld, L\"offler, and Pach (2012) and almost matches the…
We consider a non-degenerate conic in $\PG(2,q^2)$, $q$ odd, that is tangent to $\ell_\infty$ and look at its structure in the Bruck-Bose representation in $\PG(4,q)$. We determine which combinatorial properties of this set of points in…
An upward drawing of a tree is a drawing such that no parents are below their children. It is order-preserving if the edges to children appear in prescribed order around each node. Chan showed that any tree has an upward order-preserving…
Hocquard, Kim, and Pierron constructed, for every even integer $D\ge 2$, a 2-degenerate graph $G_D$ with maximum degree $D$ such that $\omega(G_D^2)=\frac52D$. We prove for (a) all 2-degenerate graphs $G$ and (b) all graphs $G$ with…
Let $G=(S, E)$ be a plane straight-line graph on a finite point set $S\subset\R^2$ in general position. The incident angles of a vertex $p \in S$ of $G$ are the angles between any two edges of $G$ that appear consecutively in the circular…
In this paper, we study KM-arcs in $PG(2, q)$, the Desarguesian projective plane of order $q$. A KM-arc A of type $t$ is a natural generalisation of a hyperoval: it is a set of $q + t$ points in $PG(2, q)$ such that every line of $PG(2,q)$…
We study a quotient of the group algebra of the braid group in which the Artin generators satisfy a cubic relation. This quotient is maximal among the ones satisfying such a cubic relation. It is finite-dimensional for at least n at most 5…
We find explicit formulas for the radii and locations of the circles in all the optimally dense packings of two, three or four equal circles on any flat torus, defined to be the quotient of the Euclidean plane by the lattice generated by…
Given a graph of which the n vertices form a regular two-dimensional grid, and in which each (possibly weighted and/or directed) edge connects a vertex to one of its eight neighbours, the following can be done in O(scan(n)) I/Os, provided M…
In 1991, Edelsbrunner and Tan gave an O(n^2) algorithm for finding the MinMax Length triangulation of a set of points in the plane. In this paper we resolve one of the open problems stated in that paper, by showing that finding a MaxMin…
We prove that for every surface $\Sigma$ of Euler genus $g$, every edge-maximal embedding of a graph in $\Sigma$ is at most $O(g)$ edges short of a triangulation of $\Sigma$. This provides the first answer to an open problem of Kainen…
We present an on-line algorithm for maintaining a topological order of a directed acyclic graph as arcs are added, and detecting a cycle when one is created. Our algorithm takes O(m^{1/2}) amortized time per arc, where m is the total number…
The problem of constructing optimal factoring automata arises in the context of unification factoring for the efficient execution of logic programs. Given an ordered set of $n$ strings of length $m$, the problem is to construct a trie-like…
For a graph G=(V,E), finding a set of disjoint edges that do not share any vertices is called a matching problem, and finding the maximum matching is a fundamental problem in the theory of distributed graph algorithms. Although local…
Small complete arcs and caps in Galois spaces over finite fields $\fq$ with characteristic greater than 3 are constructed from cubic curves with an isolated double point. For $m$ a divisor of $q+1$, complete plane arcs of size approximately…
Orthogonal Cellular Automata (OCA) have been recently investigated in the literature as a new approach to construct orthogonal Latin squares for cryptographic applications such as secret sharing schemes. In this paper, we consider OCA for a…
The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…