Related papers: A geometric approach to Mathon maximal arcs

Gishboliner, Krivelevich, and Michaeli (2023) conjectured the following generalization of Dirac's theorem: If the minimum degree $\delta$ of an $n$-vertex oriented graph $G$ is greater or equal to $n/2$, then $G$ has a Hamilton oriented…

Mazur's Theorem states that there are precisely 15 possibilities for the torsion subgroup of an elliptic curve defined over the rational numbers. It was previously shown by Harron and Snowden that the number of isomorphism classes of…

We consider discretized two-dimensional PDE-constrained shape optimization problems, in which shapes are represented by triangular meshes. Given the connectivity, the space of admissible vertex positions was recently identified to be a…

Let Q be a Dynkin quiver of type A. The bounded derived category of the path algebra of Q has an autoequivalence given by the composition of the Auslander-Reiten translate and the square of the shift functor. We classify the maximal rigid…

(I) We prove that the (maximum) number of monotone paths in a geometric triangulation of $n$ points in the plane is $O(1.7864^n)$. This improves an earlier upper bound of $O(1.8393^n)$; the current best lower bound is $\Omega(1.7003^n)$.…

A Poisson geometry arising from maximal commutative subalgebras is studied. A spectral sequence convergent to Hochschild homology with coefficients in a bimodule is presented. It depends on the choice of a maximal commutative subalgebra…

In many physical, statistical, biological and other investigations it is desirable to approximate a system of points by objects of lower dimension and/or complexity. For this purpose, Karl Pearson invented principal component analysis in…

Given a graph $G$, the NP-hard Maximum Planar Subgraph problem (MPS) asks for a planar subgraph of $G$ with the maximum number of edges. There are several heuristic, approximative, and exact algorithms to tackle the problem, but---to the…

We generalize Knuth's construction of Case I semifields quadratic over a weak nucleus, also known as generalized Dickson semifields, by doubling of central simple algebras. We thus obtain division algebras of dimension $2s^2$ by doubling…

Let $S=(C \times D)/G$ be a surface isogenous to a higher product of unmixed type with $p_g=q=0$, $G=(\mathbb{Z}/2)^3$ or $(\mathbb{Z}/2)^4$. We construct exceptional sequences of maximal length and quasiphantom categories on $S$.

Let $E$ be an elliptic curve defined over $\mathbb{Q}$, and let $\mathbb{Q}^{ab}$ be the maximal abelian extension of $\mathbb{Q}$. In this article we classify the groups that can arise as $E(\mathbb{Q}^{ab})_{\text{tors}}$ up to…

Extending results for space curves we establish bounds for the cohomology of a non-degenerate curve in projective $n$-space. As a consequence, for any given $n$ we determine all possible pairs $(d, g)$ where $d$ is the degree and $g$ is the…

We continue to study twistor spaces on the connected sum of four complex projective planes, whose anticanonical map is of degree two over the image. In particular, we determine the defining equation of the branch divisor of the…

The Hadamard maximal determinant (maxdet) problem is to find the maximum determinant D(n) of a square {+1, -1} matrix of given order n. Such a matrix with maximum determinant is called a saturated D-optimal design. We consider some cases…

We construct an explicit isomorphism between the generalised Khovanov arc algebras of type D and the basic algebras of the anti-spherical Hecke category associated to the maximal parabolic subgroup $W (A_{n-1})$ of $W (Dn)$. This…

We propose a heuristic method that generates a graph for order/degree problem. Target graphs of our heuristics have large order (> 4000) and diameter 3. We describe the ob- servation of smaller graphs and basic structure of our heuristics.…

We classify, up to isomorphism, maximal curves covered by the Hermitian curve \mathcal H by a prime degree Galois covering. We also compute the genus of maximal curves obtained by the quotient of \mathcal H by several automorphisms groups.…

A realisation of a metric $d$ on a finite set $X$ is a weighted graph $(G,w)$ whose vertex set contains $X$ such that the shortest-path distance between elements of $X$ considered as vertices in $G$ is equal to $d$. Such a realisation…

In this paper, we show that the maximum number of points in $d\geq3$ dimensions determining exactly 2 distinct triangles is $2d$. We further show that this maximum is uniquely achieved by the vertices of the $d$-orthoplex. We build upon the…

In this paper, we introduce a fundamental substructure of maximal caps in the affine geometry $AG(4,3)$ that we call \emph{demicaps}. Demicaps provide a direct link to particular partitions of $AG(4,3)$ into 4 maximal caps plus a single…