Related papers: Ovals and Hyperovals in Desarguesian Nets

A net in $\mathbb{P}^2$ is a configuration of lines $\mathcal A$ and points $X$ satisfying certain incidence properties. Nets appear in a variety of settings, ranging from quasigroups to combinatorial design to classification of Kac-Moody…

A family of plane oriented continuous paths depending on a fixed real positive number $R$ is considered. For any point $x$ on the path, the previous points lie out of any circle of radius $R$ having at $x$ interior normal in a suitable…

We prove that every $n$-vertex graph with at least $\binom{n}{2} - (n - 4)$ edges has a fractional triangle decomposition, for $n \ge 7$. This is a key ingredient in our proof, given in a companion paper, that every $n$-vertex $2$-coloured…

A hyperoval in the projective plane $\mathbb{P}^2(\mathbb{F}_q)$ is a set of $q+2$ points no three of which are collinear. Hyperovals have been studied extensively since the 1950s with the ultimate goal of establishing a complete…

We investigate the hypergroup property for the family of orthogonal polynomials associated with the deltoid curve in the plane, related to the A 2 root system. This provides also the same property for another family of polynomials related…

We consider hypergraph visualizations that represent vertices as points in the plane and hyperedges as curves passing through the points of their incident vertices. Specifically, we consider several different variants of this problem by (a)…

The number of planar Eulerian maps with n edges is well-known to have a simple expression. But what is the number of planar Eulerian orientations with n edges? This problem appears to be difficult. To approach it, we define and count…

We prove that a d-web near a point in n-space, where n is greater than 2 and d is greater than 2n-1, is equivalent to an algebraic web, if it has maximal rank or, more generally, if it has (2d - 3n + 1) abelian relations the 1-jets of which…

We consider circular version of the famous Nelson-Hadwiger problem. It is know that 4 colors are necessary and 7 colors suffice to color the euclidean plane in such a way that points at distance one get different colors. In $r$-circular…

We show that any Fermat hypercubic is apolar to a trigonal curve, and vice versa. We show also that the Waring number of the polar hypercubic associated to a tetragonal curve of genus $g$ is at most $\lceil 3/2g - 7/2\rceil$, and for a…

We study the sets of planes in an even dimensional real vector space $V$ which are simultaneously stabilised by a pair of complex structures on $V$. We completely describe these sets of planes for pairs of orthogonal complex structures.…

An ordered hypergraph is a hypergraph $G$ whose vertex set $V(G)$ is linearly ordered. We find the Tur\'an numbers for the $r$-uniform $s$-vertex tight path $P^{(r)}_s$ (with vertices in the natural order) exactly when $r\le s < 2r$ and $n$…

We show a one-to-one correspondence between arrangements of d lines in the projective plane, and lines in P^{d-2}. We apply this correspondence to classify (3,q)-nets over the complex numbers for all q<=6. When q=6, we have twelve possible…

Higher-order network analysis uses the ideas of hypergraphs, simplicial complexes, multilinear and tensor algebra, and more, to study complex systems. These are by now well established mathematical abstractions. What's new is that the ideas…

A set $A$ of vertices in an $r$-uniform hypergraph $\mathcal H$ is covered in $\mathcal H$ if there is some vertex $u\not\in A$ such that, for every $(r-1)$-set $B\subset A$, the set $\{u\}\cup B$ is in $\mathcal H$. Erdos and Moser (1970)…

Given a real finite hyperplane arrangement A and a point p not on any of the hyperplanes, we define an arrangement vo(A,p), called the *valid order arrangement*, whose regions correspond to the different orders in which a line through p can…

Erd\H{o}s and Lov\'asz noticed that an $r$-uniform intersecting hypergraph $H$ with maximal covering number, that is $\tau(H)=r$, must have at least $\frac{8}{3}r-3$ edges. There has been no improvement on this lower bound for 45 years. We…

Creative telescoping applied to a bivariate proper hypergeometric term produces linear recurrence operators with polynomial coefficients, called telescopers. We provide bounds for the degrees of the polynomials appearing in these operators.…

It is shown how the well-known class of bihamiltonian structures in general position can be extended to a wider class. A generalization of the corresponding notion of a Veronese web for this wider class is presented (in the general position…

The new concept of multilevel network is introduced in order to embody some topological properties of complex systems with structures in the mesoscale which are not completely captured by the classical models. This new model, which…