Related papers: On partial geometries arising from maximal arcs

A bipartite graph $G$ is semi-algebraic in $\mathbb{R}^d$ if its vertices are represented by point sets $P,Q \subset \mathbb{R}^d$ and its edges are defined as pairs of points $(p,q) \in P\times Q$ that satisfy a Boolean combination of a…

Let $X$ be a connected component of the maximal orthogonal grassmannian of a generic $n$-dimensional quadratic form $q$ with trivial Clifford invariant. Consider the canonical epimorphism $\phi$ from the Chow ring of $X$ to the associated…

Surfaces of general type with canonical map of degree d bigger than 8 have bounded geometric genus and irregularity. In particular the irregularity is at most 2 if d>= 10. In the present paper, the existence of surfaces with d=10 and all…

We are interested in differential forms on mixed-dimensional geometries, in the sense of a domain containing sets of $d$-dimensional manifolds, structured hierarchically so that each $d$-dimensional manifold is contained in the boundary of…

We consider a problem posed by Erd\H{o}s, Herzog and Piranian on the maximum product of distances of a point set of order $n$ with a given diameter. We prove that it is sufficient to consider convex polygons and obtain results on the…

Let $\mathrm{PG}(k-1,q)$ be the $(k-1)$-dimensional projective space over the finite field $\mathbb{F}_q$. An arc in $\mathrm{PG}(k-1,q)$ is a set of points with the property that any $k$ of them span the entire space. The notion of…

In this paper, we study rare events in spherical and Gaussian random geometric graphs in high dimensions. In these models, the vertices correspond to points sampled uniformly at random on the $d$ dimensional unit sphere or correspond to $d$…

A planar orthogonal drawing $\Gamma$ of a planar graph $G$ is a geometric representation of $G$ such that the vertices are drawn as distinct points of the plane, the edges are drawn as chains of horizontal and vertical segments, and no two…

A proper orientation $D$ of an undirected graph $G$ is an orientation of $G$ such that $d_D^+(u)\not=d_D^+(v)$ for any edge $uv\in E(G)$. Denote the proper orientation number $\vec{\chi}(G)$ of an undirected graph $G$ as the minimum…

Absolute Parallelism (AP) has many interesting features: large symmetry group of equations; field irreducibility with respect to this group; vast list of consistent second order equations not restricted to Lagrangian ones. There is the…

It is well-known and easy to show that even the following version of the directed travelling salesman problem is NP-complete: Given a strongly connected complete digraph $D=(V,A)$, a cost function $w: A\rightarrow \{0,1\}$ and a natural…

The gonality sequence $(\gamma_r)_{r\geq1}$ of a finite graph / metric graph / algebraic curve comprises the minimal degrees $\gamma_r$ of linear systems of rank $r$. For the complete graph $K_d$, we show that $\gamma_r = kd - h$ if…

On smooth projective varieties of dimension $d$, $d$-tilting bundles are important in both geometry and representation theory, since they provide a bridge from the geometry of such varieties to the derived McKay correspondence and to higher…

We study a class of non-unitary so(2,d) representations (for even values of d), describing mixed-symmetry partially massless fields which constitute natural candidates for defining higher-spin singletons of higher order. It is shown that…

Let $G$ be a strongly connected digraph with $n$ vertices and $m$ arcs. For any real $\alpha\in[0,1]$, the $A_\alpha$ matrix of a digraph $G$ is defined as $$A_\alpha(G)=\alpha D(G)+(1-\alpha)A(G),$$ where $A(G)$ is the adjacency matrix of…

Given finitely many connected polygonal obstacles $O_1,\dots,O_k$ in the plane and a set $P$ of points in general position and not in any obstacle, the {\em visibility graph} of $P$ with obstacles $O_1,\dots,O_k$ is the (geometric) graph…

Any finite-dimensional commutative (associative) graded algebra with all nonzero homogeneous subspaces one-dimensional is defined by a symmetric coefficient matrix. This algebraic structure gives a basic kind of $A$-graded algebras…

Let CMSO denote the counting monadic second order logic of graphs. We give a constructive proof that for some computable function $f$, there is an algorithm $\mathfrak{A}$ that takes as input a CMSO sentence $\varphi$, a positive integer…

A d-dimensional framework is an embedding of the vertices and edges of a graph in Euclidean space. A d-dimensional framework is globally rigid if every other d-dimensional framework with the same edge lengths has the same pairwise distances…

Let $C_{s,t}$ be the complete bipartite geometric graph, with $s$ and $t$ vertices on two distinct parallel lines respectively, and all $s t$ straight-line edges drawn between them. In this paper, we show that every complete bipartite…