Related papers: An algorithm for counting arcs in higher-dimension…
In the following paper a version of the classical Mahler formula is found. The height and the measure are now relative to a self-map on a projective space of arbitrary dimension.
We give a formula computing the number of one-nodal rational curves that pass through an appropriate collection of constraints in a complex projective space. We combine the methods and results from three different papers.
Let $\mathbb{F}_q$ be a field with $q$ elements. In this note, we study some generalized arcs, that is, sets of $\mathbb{F}_q$-points in the projective plane $\mathbb{P}^2(\mathbb{F}_q)$ such that no six of them are on a conic. First, we…
Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.
A geometric graph is a graph whose vertices are points in general position in the plane and its edges are straight line segments joining these points. In this paper we give an $O(n^2 \log n)$ algorithm to compute the number of pairs of…
We present constructions and bounds for additive codes over a finite field in terms of their geometric counterpart, i.e., projective systems. It is known that the maximum number of $(h-1)$-spaces in PG$(2,q)$, such that no hyperplane…
Given a set of $n$ circular arcs of the same radius in the plane, we consider the problem of computing the number of intersections among the arcs. The problem was studied before and the previously best algorithm solves the problem in…
We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at least six points in S are in general…
We say that a line in $\mathbb P^{n+1}_k$ is osculating to a hypersurface $Y$ if they meet with contact order $n+1$. When $k=\mathbb C$, it is known that through a fixed point of $Y$, there are exactly $n!$ of such lines. Under some parity…
We consider the set of points in projective $n$-space that generate an extension of degree $e$ over given number field $k$, and deduce an asymptotic formula for the number of such points of absolute height at most $X$, as $X$ tends to…
The purpose of this article is to introduce projective geometry over composition algebras : the equivalent of projective spaces and Grassmannians over them are defined. It will follow from this definition that the projective spaces are in…
Let $P$ be a set of $n$ points in the plane. A crossing-free structure on $P$ is a plane graph with vertex set $P$. Examples of crossing-free structures include triangulations of $P$, spanning cycles of $P$, also known as polygonalizations…
Given a general plane curve Y of degree d, we compute the number n_d of irreducible plane conics that are 5-fold tangent to Y. This problem has been studied before by Vainsencher using classical methods, but it could not be solved there…
Let $G$ be a connected undirected graph on $n$ vertices with no loops but possibly multiedges. Given an arithmetical structure $(\textbf{r}, \textbf{d})$ on $G$, we describe a construction which associates to it a graph $G'$ on $n-1$…
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum number of edges that a thrackle of n vertices can have.…
The construction of Grassmannian codes in some projective space is of highly mathematical nature and requires strong computational power for the resulting searches. In this paper was constructed, using GAP System for Computational Discrete…
This is an expository article detailing results concerning large arcs in finite projective spaces, which attempts to cover the most relevant results on arcs, simplifying and unifying proofs of known old and more recent theorems. The article…
Computational tools in numerical algebraic geometry can be used to numerically approximate solutions to a system of polynomial equations. If the system is well-constrained (i.e., square), Newton's method is locally quadratically convergent…
In this paper we obtain an explicit formula for the number of degree d curves in two dimensional complex projective space, passing through (d(d+3)/2 -k) generic points and having a codimension k singularity, where k is at most 7. In the…
One of the main problems in the study of system of equations of the gravitational lens, is the computation of coordinates from the known position of the source. In the process of computing finds the solution of equations with two unknowns.…