Related papers: Counting point configurations in projective space
Bimonotone subdivisions in two dimensions are subdivisions all of whose sides are either vertical or have nonnegative slope. They correspond to statistical estimates of probability distributions of strongly positively dependent random…
We consider the count of subgraphs with an arbitrary configuration of endpoints in the random-connection model based on a Poisson point process on ${\Bbb R}^d$. We present combinatorial expressions for the computation of the cumulants and…
In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…
Given two general rational curves of the same degree in two projective spaces, one can ask whether there exists a third rational curve of the same degree that projects to both of them. We show that, under suitable assumptions on the degree…
We solve the problem of counting elliptic curves with fixed j-invariant in projective space with tangency conditions. This is equivalent to couting rational nodal curves with condition on the node of the image. The solution is given in the…
Random geometric graphs are random graph models defined on metric spaces. Such a model is defined by first sampling points from a metric space and then connecting each pair of sampled points with probability that depends on their distance,…
In this work, we define the concept of mixed $G$-monotone mappings defined on a metric space endowed with a graph. Then we obtain sufficient conditions for the existence of coupled fixed points for such mappings when a weak contractivity…
We fix a counting function of multiplicities of algebraic points in a projective hypersurface over a number field, and take the sum over all algebraic points of bounded height and fixed degree. An upper bound for the sum with respect to…
Projective connections first appeared in Cartan's papers in the 1920's. Since then they have resurfaced periodically in, for example, integrable systems and perhaps most recently in the context of so called projectively equivariant…
We call $i$ a fixed point of a given sequence if the value of that sequence at the $i$-th position coincides with $i$. Here, we enumerate fixed points in the class of restricted growth sequences. The counting process is conducted by…
We consider the popular and classical method of alternating projections for finding a point in the intersection of two closed sets. By situating the algorithm in a metric space, equipped only with well-behaved geodesics and angles (in the…
The problem of map enumeration concerns counting connected spatial graphs, with a specified number $j$ of vertices, that can be embedded in a compact surface of genus $g$ in such a way that its complement yields a cellular decomposition of…
We recursively compute the Gromov-Witten invariants of the Hilbert scheme of two points in the plane. By studying the space of stable maps and computing virtual contributions, we use these invariants to enumerate hyperelliptic plane curves…
A compact classification of the projective lines defined over (commutative) rings (with unity) of all orders up to thirty-one is given. There are altogether sixty-five different types of them. For each type we introduce the total number of…
The idea that possible configurations of a physical system can be represented as points in a multidimensional configuration space ${\cal C}$ is explored. The notion of spacetime, without ${\cal C}$, does not exist in this theory. Spacetime…
A geometrical pattern is a set of points with all pairwise distances (or, more generally, relative distances) specified. Finding matches to such patterns has applications to spatial data in seismic, astronomical, and transportation…
An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit…
Graph compositions generalize both integer compositions and partitions of a finite set. We develop formulas, generating functions and recurrence relations for composition counting functions for several families of graphs.
We first review the definition of superprojective spaces from the functor-of-points perspective. We derive the relation between superprojective spaces and supercosets in the framework of the theory of sheaves. As an application of the…
The topic of this paper is the subtle interplay between countability and representations. In particular, we establish that the definition of countability of a certain set $X$ crucially hinges on the associated equivalence relation $=_{X}$.…