Related papers: Lines, Quadrics, and Cremona Transformations in Tw…

In a previous paper, we derived necessary and sufficient conditions for the invertibility of square submatrices of the Pascal upper triangular matrix. To do so, we established a connection with the two-point Birkhoff interpolation problem.…

Schemes defined by residual intersections have been extensively studied in the case when they are Cohen-Macaulay, but this is a very restrictive condition. In this paper we make the first study of a class of natural examples far from…

In this paper we consider the low-rank matrix completion problem with specific application to forecasting in time series analysis. Briefly, the low-rank matrix completion problem is the problem of imputing missing values of a matrix under a…

We describe the geometry of bend distortions in twist-bend nematic liquid crystals in terms of their fundamental degeneracies, which we call $\beta$ lines. These represent a new class of line-like topological defect. We use them to…

We outline some recent developments in higher dimensional Quark-Lepton (QL) symmetric models. The QL symmetric model in five dimensions is discussed, with particular emphasis on the use of split fermions. An interesting fermionic geography…

Geometric properties of Transformer weights, particularly the unembedding matrix, have been widely useful in language model interpretability research. Yet, their utility for estimating downstream performance remains unclear. In this work,…

Let X be a projective hypersurface in P_k^n of degree d <= n. In this paper we study the relation between the class [X] in K_0(Var_k) and the existence of k-rational points. Using elementary geometric methods we show, for some particular X,…

A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…

Given a plane geometric graph $G$ on $n$ vertices, we want to augment it so that given parity constraints of the vertex degrees are met. In other words, given a subset $R$ of the vertices, we are interested in a plane geometric supergraph…

We address a core problem of computer vision: Detection and description of 2D feature points for image matching. For a long time, hand-crafted designs, like the seminal SIFT algorithm, were unsurpassed in accuracy and efficiency. Recently,…

The crossing number of a graph is the least number of crossings over all drawings of the graph in the plane. Computing the crossing number of a given graph is NP-hard, but fixed-parameter tractable (FPT) with respect to the natural…

Let $X$ (resp. $Y$) be a curve of genus 1 (resp. 2) over a base field $k$ whose characteristic does not equal 2. We give criteria for the existence of a curve $Z$ over $k$ whose Jacobian is up to twist (2,2,2)-isogenous to the products of…

Critical loci for projective reconstruction from three views in four dimensional projective space are defined by an ideal generated by maximal minors of suitable $4 \times 3$ matrices, $N,$ of linear forms. Such loci are classified in this…

We prove criteria for $\mathcal{H}^k$-rectifiability of subsets of $\mathbb{R}^n$ with $C^{1,\alpha}$ maps, $0<\alpha\leq 1$, in terms of suitable approximate tangent paraboloids. We also provide a version for the case when there is not an…

This work studies circle-geometry methods through their application to a main theorem about circles tangent twice to a conic. The authors investigate the Sharygin point -- a point lying in the pencil of two non-intersecting circles -- and…

We develop a spatial branch-and-cut approach for nonconvex Quadratically Constrained Quadratic Programs with bounded complex variables (CQCQP). Linear valid inequalities are added at each node of the search tree to strengthen semidefinite…

In computer vision, finding point correspondence among images plays an important role in many applications, such as image stitching, image retrieval, visual localization, etc. Most of the research worksfocus on the matching of local feature…

In this note we provide an improved upper bound on the biplanar crossing number of the 8-dimensional hypercube. The $k$-planar crossing number of a graph $cr_k(G)$ is the number of crossings required when every edge of $G$ must be drawn in…

We study the expressibility and learnability of convex optimization solution functions and their multi-layer architectural extension. The main results are: \emph{(1)} the class of solution functions of linear programming (LP) and quadratic…

We study the problem of efficiently constructing a curve C of genus 2 over a finite field F for which either the curve C itself or its Jacobian has a prescribed number N of F-rational points. In the case of the Jacobian, we show that any…