Related papers: The pure condition for incidence geometries
In this paper we consider a family of projective embeddings of the geometry $\Gamma = A_{n,\{1,n\}}(F)$ of point-hyperplanes flags of the projective geometry $\Sigma = PG(n,F)$. The natural embedding $\varepsilon_{mathrm{nat}}$ is one of…
We study the integral points on $\mathbb P_ n\setminus D$, where $D$ is the branch locus of a projection from an hypersurface in $\mathbb P_{n+1}$ to a hyperplane $H\simeq\mathbb P_n$. In doing that we follow the approach proposed in a…
The necessity of renormalization arises from the infinite integrals which are caused by the discrepancy between the orders of differential and integral operators in the four dimensional QFTs. Therefore in view of the fact that finiteness…
Incidence problems between geometric objects is a key area of focus in the field of discrete geometry. Among them, the study of incidence problems over finite fields have received a considerable amount of attention in recent years. In this…
In this paper we establish an improved bound for the number of incidences between a set $P$ of $m$ points and a set $H$ of $n$ planes in $\mathbb R^3$, provided that the points lie on a two-dimensional nonlinear irreducible algebraic…
We study the inverse graphics problem of inferring a holistic representation for natural images. Given an input image, our goal is to induce a neuro-symbolic, program-like representation that jointly models camera poses, object locations,…
How much of the combinatorial structure of a pointed polyhedron is contained in its vertex-facet incidences? Not too much, in general, as we demonstrate by examples. However, one can tell from the incidence data whether the polyhedron is…
We consider an incidence problem in $\mathbb{R}^4$ which asks, for a set of $L$ lines and a set of $S$ planes in general position, what the maximum number of line-plane incidences is. A line-plane incidence is defined as a point where a…
We prove the first inverse theorem for point--sphere incidence bounds over finite fields in dimensions $d \ge 3$, showing that near-extremality forces algebraic rigidity. While sharp upper bounds have been known for over a decade, the…
We study the flat geometry of the least degenerate singularity of a singular surface in $\mathbb R^4$, the $I_{1}$ singularity parametrised by $(x,y)\mapsto(x,xy,y^{2},y^{3})$. This singularity appears generically when projecting a regular…
A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, every edge-length preserving continuous motion of the vertices preserves the distances between all pairs of non-adjacent vertices as well.…
We study incidence geometries that are thin and residually connected. These geometries generalise abstract polytopes. In this generalised setting, guided by the ideas from the polytopes theory, we introduce the concept of chirality, a…
Consider a graph G with n vertices. In this paper we study geometric conditions for an n-tuple of points in R^d to admit a tensegrity with underlying graph G. We introduce and investigate a natural stratification, depending on G, of the…
We apply an old method for constructing points-and-lines configurations in the plane to study some recent questions in incidence geometry.
We provide a condition-based analysis of two interior-point methods for unconstrained geometric programs, a class of convex programs that arise naturally in applications including matrix scaling, matrix balancing, and entropy maximization.…
Given a residually connected incidence geometry $\Gamma$ that satisfies two conditions, denoted $(B_1)$ and $(B_2)$, we construct a new geometry $H(\Gamma)$ with properties similar to those of $\Gamma$. This new geometry $H(\Gamma)$ is…
Random geometric graphs result from taking $n$ uniformly distributed points in the unit cube, $[0,1]^d$, and connecting two points if their Euclidean distance is at most $r$, for some prescribed $r$. We show that monotone properties for…
Two-view relative pose estimation and structure reconstruction is a classical problem in computer vision. The typical methods usually employ the singular value decomposition of the essential matrix to get multiple solutions of the relative…
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)…
If $X \subset \mathbb P^n$ is a reduced subscheme, we say that $X$ admits an unexpected hypersurface of degree $t$ for multiplicity $m$ if the imposition of having multiplicity $m$ at a general point $P$ fails to impose the expected number…