相关论文: Ovals and Hyperovals in Desarguesian Nets

We consider drawings of graphs that contain dense subgraphs. We introduce intersection-link representations for such graphs, in which each vertex $u$ is represented by a geometric object $R(u)$ and in which each edge $(u,v)$ is represented…

Let k be a field of any characteristic and R = k[x,y,z]/(f) be a graded normal hypersurface. We call (a,b,c; h) = deg(x,y,z;f) the type of R with gcd(a,b,c)=1. Then the a-invariant a(R) is given by h - (a+b+c). The classification of such R…

Motzkin and Straus established a remarkable connection between the maximum clique and the Lagrangian of a graph in 1965. This connection and its extensions were successfully employed in optimization to provide heuristics for the maximum…

We prove that the set of directions of lines intersecting three disjoint balls in $R^3$ in a given order is a strictly convex subset of $S^2$. We then generalize this result to $n$ disjoint balls in $R^d$. As a consequence, we can improve…

Each irreducible component of the first resonance variety of a hyperplane arrangement naturally determines a codimension one foliation on the ambient space. The superposition of these foliations define what we call the resonance web of the…

An {\em ordered $r$-graph} is an $r$-uniform hypergraph whose vertex set is linearly ordered. Given $2\leq k\leq r$, an ordered $r$-graph $H$ is {\em interval} $k$-{\em partite} if there exist at least $k$ disjoint intervals in the ordering…

We consider relationships between Vandermonde sets and hyperovals. Hyperovals are Vandermonde sets, but, in general, Vandermonde sets are not hyperovals. We give necessary and sufficient conditions for a Vandermonde set to be a hyperoval.…

We study rotation $r$-graphs and show that for every $r$-graph $G$ of odd regularity there is a simple rotation $r$-graph $G'$ such that $G$ can be obtained form $G'$ by a finite number of $2$-cut reductions. As a consequence, some hard…

We investigate the common underlying discrete structures for various smooth and discrete nets. The main idea is to impose the characteristic properties of the nets not only on elementary quadrilaterals but also on larger parameter…

We prove that the r-th pluricanonical maps of threefolds of general type have birationally bounded fibers if $r\geqslant 2$. Similarly, we prove that the r-th pluricanonical maps of fourfolds of general type have birationally bounded fibers…

The visibility graph Vis(X) of a discrete point set X in the plane has vertex set X and an edge xy for every two points x,y\in X whenever there is no other point in X on the line segment between x and y. We show that for every graph G,…

In the present paper we study geometric structures associated with webs of hypersurfaces. We prove that with any geodesic (n+2)-web on an n-dimensional manifold there is naturally associated a unique projective structure and, provided that…

A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…

An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…

We classify GL(2,R) orbit closures of translation surfaces of rank at least half the genus plus 1.

We prove that for every integer $r\geq 2$, an $n$-vertex $k$-uniform hypergraph $H$ containing no $r$-regular subgraphs has at most $(1+o(1)){{n-1}\choose{k-1}}$ edges if $k\geq r+1$ and $n$ is sufficiently large. Moreover, if…

A hypersurface $M$ in $\mathbb{R}^n$, $n \geq 4$, has central ovaloid property if $M$ intersects some hyperplane transversally along an ovaloid and every such ovaloid on $M$ has central symmetry. We show that a complete, connected, smooth…

High order networks are weighted hypergraphs col- lecting relationships between elements of tuples, not necessarily pairs. Valid metric distances between high order networks have been defined but they are difficult to compute when the…

A net is a special configuration of lines and points in the projective plane. There are certain restrictions on the number of its lines and points. We proved that there cannot be any (4,4) nets in $\mathbb{C}P^2$. In order to show this, we…

We study and compare the webs $\boldsymbol{\mathcal W}_{{\rm dP}_d}$ defined by the conic fibrations on a given smooth del Pezzo surface ${\rm dP}_d$ of degree $d$ for $d=4$ and $d=5$. In a previous paper, we proved that for any positive…