Related papers: Ovals and Hyperovals in Desarguesian Nets
If S is a set of q+2 points in P^2(F_q) such that some point of S is not on any line containing two other points of S, then in suitable coordinates S has the form S_f:={(c:f(c):1) : c in F_q} U {(1:0:0),(0:1:0)} for some f(X) in F_q[X]. Let…
In this paper, we define the concepts of r-hyperideal and n-hyperideal of the multiplicative hyperring R which are two new classes of hyperideals. Several properties of them are provided.
Every GL(2,R)-orbit in hyperelliptic components of strata of abelian differentials in genus greater than two is either closed, dense, or contained in a locus of branched covers.
A weighting of the edges of a hypergraph is called vertex-coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e., every edge contains at least two vertices with different weighted degrees. In this paper…
We give a construction of r-partite r-uniform intersecting hypergraphs with cover number at least r-4 for all but finitely many r. This answers a question of Abu-Khazneh, Barat, Pokrovskiy and Szabo, and shows that a long-standing unsolved…
It is shown that every $n$-vertex graph that admits a 2-bend RAC drawing in the plane, where the edges are polylines with two bends per edge and any pair of edges can only cross at a right angle, has at most $20n-24$ edges for $n\geq 3$.…
Let $H$ be a complete $r$-uniform hypergraph such that two vertices are marked in each edge as its `boundary' vertices. A linear ordering of the vertex set of $H$ is called an {\em agreeing linear order}, provided all vertices of each edge…
A famous conjecture of Ryser states that every $r$-partite hypergraph has vertex cover number at most $r - 1$ times the matching number. In recent years, hypergraphs meeting this conjectured bound, known as $r$-Ryser hypergraphs, have been…
We prove that for any given $\varepsilon>0$ and $d\in [0,1]$, every sufficiently large $(\varepsilon, d)$-dense graph $G$ contains for each odd integer $r$ at least $(d^r-\varepsilon)|V(G)|^r$ cycles of length $r$. Here, $G$ being…
A Clifford algebra model for M"obius geometry is presented. The notion of Ribaucour pairs of orthogonal systems in arbitrary dimensions is introduced, and the structure equations for adapted frames are derived. These equations are…
We consider surjective endomorphisms f of degree > 1 on the projective n-space with n = 3, and f^{-1}-stable hypersurfaces V. We show that V is a hyperplane (i.e., deg(V) = 1) but with four possible exceptions; it is conjectured that deg(V)…
We present a proof of the Harbourne-Hirschowitz conjecture for linear systems with base points of multiplicity seven or less. This proof uses a well-known degeneration of the projective plane, as well as a combinatorial technique that…
The paper describes and classifies hexagonal circular 3-webs on unit sphere such that the polar points of the web circles lie on a twisted cubic, thus completing classification of hexagonal circular 3-webs with algebraic polar curves of…
In an earlier work, we proposed a generalization for the Apollonian packing in arbitrary dimensions and showed that the resulting object in four, five, and six dimensions have properties consistent with the Apollonian circle and sphere…
We consider two covering variants of the network design problem. We are given a set of origin/destination pairs, called O/D pairs, and each such O/D pair is covered if there exists a path in the network from the origin to the destination…
We introduce orthogonal ring patterns in the 2-sphere and in the hyperbolic plane, consisting of pairs of concentric circles, which generalize circle patterns. We show that their radii are described by a discrete integrable system. This is…
We determine all possible triples of depth, dimension, and regularity of edge ideals of weighted oriented graphs with a fixed number of vertices. Also, we compute all the possible Betti table sizes of edge ideals of weighted oriented trees…
For $r \ge 2$, an $r$-uniform hypergraph is called a friendship $r$-hypergraph if every set $R$ of $r$ vertices has a unique 'friend' - that is, there exists a unique vertex $x \notin R$ with the property that for each subset $A \subseteq…
We construct a Parseval frame with $n+1$ vectors in $\R^n$ that contains a given vector. We also provide a characterization of unit-norm frames that can be scaled to a Parseval frame.
Deep convolutional networks provide state of the art classifications and regressions results over many high-dimensional problems. We review their architecture, which scatters data with a cascade of linear filter weights and non-linearities.…