Related papers: Ovals and Hyperovals in Desarguesian Nets
In this paper we study some Erdos type problems in discrete geometry. Our main result is that we show that there is a planar point set of n points such that no four are collinear but no matter how we choose a subset of size $n^{5/6+o(1)} $…
Orthogonal polynomials on quadratic curves in the plane are studied. These include orthogonal polynomials on ellipses, parabolas, hyperbolas, and two lines. For an integral with respect to an appropriate weight function defined on any…
Geodesic nets on Riemannian manifolds form a natural class of stationary objects generalizing geodesics. Yet almost nothing is known about their classification or general properties even when the ambient Riemannian manifold is the Euclidean…
For an arbitrary identity L=R between compositions of maps L and R on tensors of vector spaces V, a general construction of a 2-cocycle condition is given. These 2-cocycles correspond to those obtained in deformation theories of algebras.…
Given a set $R$, a hypergraph is $R$-uniform if the size of every hyperedge belongs to $R$. A hypergraph $\mathcal{H}$ is called \textit{covering} if every vertex pair is contained in some hyperedge in $\mathcal{H}$. In this note, we show…
In this note we complete the calculation of the number of $GL(\mathbb R^n)$-orbits on $\Lambda^k(\mathbb R^n)^*$, by treating the cases $(n,k)= (7,4)$ and $(8,5)$ not covered in the literature. We also calculate the number of of…
We prove the well-known Brown-Erd\H{o}s-S\'os Conjecture for hypergraphs of large uniformity in the following form: any dense linear $r$-graph $G$ has $k$ edges spanning at most $(r-2)k+3$ vertices, provided the uniformity $r$ of $G$ is…
In this note, we prove several Tur\'an-type results on geometric hypergraphs. The two main theorems are 1) Every $n$-vertex geometric 3-hypergraph in 2-space with no three strongly crossing edges has at most $O(n^2)$ edges, 2) Every…
Two new classes of networks are introduced that resemble small-world properties. These networks are recursively constructed but retain a fixed, regular degree. They consist of a one-dimensional lattice backbone overlayed by a hierarchical…
A pair of planes, both projective or both affine, of the same order and on the same pointset are orthogoval if each line of one plane intersects each line of the other plane in at most two points. In this paper we prove new constructions…
Being motivated by the orthogonal maps studied in \cite{GN1}, orthogonal pairs between the projective spaces equipped with possibly degenerate Hermitian forms were introduced. In addition, orthogonal pairs are generalizations of holomorphic…
Ryser's Conjecture states that for any $r$-partite $r$-uniform hypergraph, the vertex cover number is at most $r{-}1$ times the matching number. This conjecture is only known to be true for $r\leq 3$ in general and for $r\leq 5$ if the…
We consider quadrangles of perimeter $2$ in the plane with marked directed edge. To such quadrangle $Q$ a two-dimensional plane $\Pi\in\mathbb{R}^4$ with orthonormal base is corresponded. Orthogonal plane $\Pi^\bot$ defines a plane…
We show that there is a constant $c$ such that any 3-uniform hypergraph $\mathcal H$ with $n$ vertices and at least $cn^{5/2}$ edges contains a triangulation of the real projective plane as a subgraph. This resolves a conjecture of…
For $d$ ranging from 2 to 6, we prove that the web by conics naturally defined on any smooth del Pezzo surface of degree $d$ carries an interesting functional identity whose components all are a certain antisymmetric hyperlogarithm of…
It is conjectured by Frankl and F\"uredi that the $r$-uniform hypergraph with $m$ edges formed by taking the first $m$ sets in the colex ordering of ${\mathbb N}^{(r)}$ has the largest Lagrangian of all $r$-uniform hypergraphs with $m$…
The paper is devoted to a detailed self-contained exposition of a part of the theory of affine planes leading to a construction of affine (or, equivalently, projective) planes not satisfying the Desarques axiom. It is intended to complement…
The problem of classifying linear systems of conics in projective planes dates back at least to Jordan, who classified pencils (one-dimensional systems) of conics over $\mathbb{C}$ and $\mathbb{R}$ in 1906--1907. The analogous problem for…
In this paper we study the maximum number of hyperedges which may be in an $r$-uniform hypergraph under the restriction that no pair of vertices has more than $t$ Berge paths of length $k$ between them. When $r=t=2$, this is the even-cycle…
It is shown that coassociative cones in R^7 that are r-oriented and ruled by 2-planes are equivalent to CR-holomorphic curves in the oriented Grassmanian of 2-planes in R^7. The geometry of these CR-holomorphic curves is studied and related…