Related papers: A geometric approach to Mathon maximal arcs
An upper bound on degrees of elements of a minimal generating system for invariants of quivers of dimension (2,...,2) is established over a field of arbitrary characteristic and its precision is estimated. The proof is based on the…
The notion of a Manin triple of Lie algebras admits a generalization, to dg Lie algebras, in which various properties are required to hold only up to homotopy. This paper introduces two classes of examples of such homotopy Manin triples.…
In 2014 A. Degtyarev, I. Itenberg and the author gave a description, up to fiberwise equivariant deformations, of maximally inflected real trigonal curves of type~I (over a base $ B $ of an arbitrary genus) in terms of the combinatorics of…
In this paper we prove an optimal $L^2-L^{2d}$ decay estimate of the adjoint Radon transform of compactly supported data in $d$-dimensional space via a geometric method. A similar problem in dimension $3$ has be considered in the author's…
The author determines the structure of automorphism groups of smooth plane curves of degree at least four. Furthermore, he gives some upper bounds for the order of automorphism groups of smooth plane curves and classifies the cases with…
We consider the problem of decomposing the edges of a directed graph into as few paths as possible. There is a natural lower bound for the number of paths needed in an edge decomposition of a directed graph $D$ in terms of its degree…
This is the first in a series of papers on rank decompositions of the matrix multiplication tensor. In this paper we: establish general facts about rank decompositions of tensors, describe potential ways to search for new matrix…
We show that the edges of any $d$-regular graph can be almost decomposed into paths of length roughly $d$, giving an approximate solution to a problem of Kotzig from 1957. Along the way, we show that almost all of the vertices of a…
We show how the exceptional isogenies of classical groups to orthogonal groups of quadratic spaces of dimensions up to 8 over fields of characteristic different from 2 may be obtained by explicit algebraic constructions using the…
Two matrices with elements taken from the set {-1,1} are Hadamard equivalent if one can be converted into the other by a sequence of permutations of rows and columns, and negations of rows and columns. In this paper we summarize what is…
We previously extended the Marsden-Ratiu reduction theorem in Poisson geometry by means of graded geometry (see Part I of Arxiv:1009.0948) . In this note we provide the background material about graded geometry necessary for the proof.…
The degree diameter problem asks for the maximum possible number of vertices in a graph of maximum degree $\Delta$ and diameter $D$. In this paper, we focus on planar graphs of diameter $3$. Fellows, Hell and Seyffarth (1995) proved that…
We consider the bipartite version of the {\it degree/diameter problem}, namely, given natural numbers $d\ge2$ and $D\ge2$, find the maximum number $\N^b(d,D)$ of vertices in a bipartite graph of maximum degree $d$ and diameter $D$. In this…
We begin with a review of the structure of simple, simply-connected complex Lie groups and their Lie algebras, describe the Chevalley lattice and the associated split group over the integers. This gives us a hyperspecial maximal compact…
In 1910 E. Cartan constructed a canonical frame and found the most symmetric case for maximally nonholonomic rank 2 distributions in $\mathbb R^5$. We solve the analogous problem for germs of generic rank 2 distributions in ${\mathbb R}^n$…
Metric dimension is a graph parameter motivated by problems in robot navigation, drug design, and image processing. In this paper, we answer several open extremal problems on metric dimension and pattern avoidance in graphs from (Geneson,…
In this paper, an effort is made to classify which prime character degree graphs having eight vertices occur for some finite solvable group. To approach this, we compile known results and constructions from the literature which are used to…
Let $\K$ be an algebraic number field of degree $d$ and discriminant $\Delta$ over $\Q$. Let $\A$ be an associative algebra over $\K$ given by structure constants such that $\A\cong M_n(\K)$ holds for some positive integer $n$. Suppose that…
A frame approach to determining the most general solution admitting a desired symmetry group has been examined previously in Riemannian and teleparallel geometries with some success. In teleparallel geometries, one must determine the…
In $1967$, Vizing determined the maximum size of a graph with given order and radius. In $1973$, Fridman answered the same question for digraphs with given order and outradius. We investigate that question when restricting to biconnected…