Related papers: A geometric approach to Mathon maximal arcs
In this work we are interested in the general problem of the determination of the normed division algebras. Our fundamental results are obtained in the particular subclass of those 8-dimensional quadratic flexible real division algebras. We…
The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the Hausdorff distance and have not been studied yet in the literature. Parametric polynomial curves of low…
Construction of optimal deformations is one of the long standing problems of computational mathematics. We consider the problem of computing quasi-isometric deformations with minimal possible quasi-isometry constant (global estimate for…
We introduce the notion of extended admissible dissections of a marked surface, building upon the notion of an admissible dissection of a marked surface by Amiot--Plamondon--Schroll. For each extended admissible dissection we construct a…
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this note we give examples of class two 1-planar graphs with maximum degree six or seven.
The Monotone Upper Bound Problem (Klee, 1965) asks if the number M(d,n) of vertices in a monotone path along edges of a d-dimensional polytope with n facets can be as large as conceivably possible: Is M(d,n) = M_{ubt}(d,n), the maximal…
We classify nets of conics in Desarguesian projective planes over finite fields of odd order, namely, two-dimensional linear systems of conics containing a repeated line. Our proof is geometric in the sense that we solve the equivalent…
This paper provides an algorithmic generalization of Dickson's method of classifying permutation polynomials (PPs) of a given degree $d$ over finite fields. Dickson's idea is to formulate from Hermite's criterion several polynomial…
The computation of tunes and matched beam distributions are essential steps in the analysis of circular accelerators. If certain symmetries - like midplane symmetrie - are present, then it is possible to treat the betatron motion in the…
An isogeny graph is a graph whose vertices are principally polarized abelian varieties and whose edges are isogenies between these varieties. In his thesis, Kohel described the structure of isogeny graphs for elliptic curves and showed that…
We present the first algorithm to morph graphs on the torus. Given two isotopic essentially 3-connected embeddings of the same graph on the Euclidean flat torus, where the edges in both drawings are geodesics, our algorithm computes a…
This paper is the first of a 3-part series that classifies the 5-dimensional Thurston geometries. The present paper (part 1 of 3) summarizes the general classification, giving the full list, an outline of the method, and some illustrative…
While there has been considerable interest in the problem of finding elliptic curves of high rank over $\mathbb{Q}$, very few parametrized families of elliptic curves of generic rank $\geq 8$ have been published. In this paper we use…
The degree-diameter problem consists of finding the maximum number of vertices $n$ of a graph with diameter $d$ and maximum degree $\Delta$. This problem is well studied, and has been solved for plane graphs of low diameter in which every…
Maximal antipodal sets of Riemannian manifolds were introduced by the author and T. Nagano in [Un invariant g\'eom\'etrique riemannien, C. R. Acad. Sci. Paris S\'er. I Math. 295 (1982), no. 5, 389--391]. Since then maximal antipodal sets…
New algorithms are devised for finding the maxima of multidimensional point samples, one of the very first problems studied in computational geometry. The algorithms are very simple and easily coded and modified for practical needs. The…
We show that the number of perfect matching in a simple graph $G$ with an even number of vertices and degree sequence $d_1,d_2, ..., d_n$ is at most $\prod_{i=1}^n (d_i !)^{\frac{1}{2d_i}}$. This bound is sharp if and only if $G$ is a union…
In 1962, Tutte provided a formula for the number of combinatorial triangulations, that is, maximal planar graphs with a fixed triangular face and $n$ additional vertices. In this note, we study how many ways a combinatorial triangulation…
Enumeration of all combinatorial types of point configurations and polytopes is a fundamental problem in combinatorial geometry. Although many studies have been done, most of them are for 2-dimensional and non-degenerate cases. Finschi and…
We provide a framework for which one can approach showing the integer decomposition property for symmetric polytopes. We utilize this framework to prove a special case which we refer to as $2$-partition maximal polytopes in the case where…