Related papers: Classification of Incidence Scrolls (II)
For any finite poset P we introduce a homogeneous space as a quotient of the general linear group with the incidence group of P. When P is a chain this quotient is a flag variety; for the trivial poset our construction gives a variety…
We investigate the projective normality of smooth, linearly normal surfaces of degree 9. All non projectively normal surfaces which are not scrolls over a curve are classified. Results on the projective normality of surface scrolls are also…
Motivated by automated junction recognition in tracking data, we study a problem of placing a square or disc of fixed size in an arrangement of lines or line segments in the plane. We let distances among the intersection points of the lines…
Incidence theorems concern configurations of points, lines, and, more generally, higher-dimensional subspaces in projective space. Broadly speaking, such theorems fall into two classes: those that hold over an arbitrary division ring, such…
We consider two incidence problems for integral curves of vector fields. The first is an analogue of the Euclidean joints problem, in which lines are replaced by integral curves of smooth vector fields taken from some finite-dimensional…
The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. The polytope of degree partitions (respectively, degree sequences) is the convex hull of all degree partitions (respectively, degree…
In their thought-provoking paper [1], Belkin et al. illustrate and discuss the shape of risk curves in the context of modern high-complexity learners. Given a fixed training sample size $n$, such curves show the risk of a learner as a…
The famous Szemer\'{e}di-Trotter theorem states that any arrangement of $n$ points and $n$ lines in the plane determines $O(n^{4/3})$ incidences, and this bound is tight. In this paper, we prove the following Tur\'an-type result for…
Three-dimensional convex bodies can be classified in terms of the number and stability types of critical points on which they can balance at rest on a horizontal plane. For typical bodies these are nondegenerate maxima, minima, and…
A partial linear space is a point--line incidence structure such that each line is incident with at least two points and each pair of points is incident with at most one line. It is said to be proper if there exists at least one…
The first degree-based entropy of a graph is the Shannon entropy of its degree sequence normalized by the degree sum. In this paper, we characterize the connected graphs with given order $n$ and size $m$ that minimize the first degree-based…
A cyclic base ordering of a connected graph $G$, is a cyclic ordering of $E(G)$ such that every cyclically consecutive $|V(G)|-1$ edges form a spanning tree. In this project, we study cyclic base ordering of various families of graphs,…
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard. We study the complexity of this problem in classes…
This paper is motivated from a fundamental curiosity on what defines a category of object shapes. For example, we may have the common knowledge that a plane has wings, and a chair has legs. Given the large shape variations among different…
Let $G=(V,E)$ be a graph. A set of vertices $A$ is an incidence generator for $G$ if for any two distinct edges $e,f\in E(G)$ there exists a vertex from $A$ which is an endpoint of either $e$ or $f$. The smallest cardinality of an incidence…
We prove an incidence theorem for points and curves in the complex plane. Given a set of $m$ points in ${\mathbb R}^2$ and a set of $n$ curves with $k$ degrees of freedom, Pach and Sharir proved that the number of point-curve incidences is…
An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in…
We study a wide spectrum of incidence problems involving points and curves or points and surfaces in $\mathbb R^3$. The current (and in fact the only viable) approach to such problems, pioneered by Guth and Katz [2010,2015], requires a…
We consider the structure of the point-line incidence matrix of the projective space $\mathrm{PG}(3,q)$ connected with orbits of points and lines under the stabilizer group of the twisted cubic. Structures of submatrices with incidences…
The cycle space of a graph corresponds to the kernel of an incidence matrix. We investigate an analogous subspace for digraphs. In the case of digraphs of graphs, where every edge is replaced by two oppositely directed arcs, we give a…