English
Related papers

Related papers: Counting point configurations in projective space

200 papers

After 1-point compactification, the collection of all unordered configuration spaces of a manifold admits a commutative multiplication by superposition of configurations. We explain a simple (derived) presentation for this commutative…

Algebraic Topology · Mathematics 2024-05-15 Oscar Randal-Williams

The parameter space of $n$ ordered points in projective $d$-space that lie on a rational normal curve admits a natural compactification by taking the Zariski closure in $(\mathbb{P}^d)^n$. The resulting variety was used to study the…

Algebraic Geometry · Mathematics 2019-08-06 Alessio Caminata , Noah Giansiracusa , Han-Bom Moon , Luca Schaffler

This paper is devoted to the study of a newly introduced tool, projectional coderivatives and the corresponding calculus rules in finite dimensions. We show that when the restricted set has some nice properties, more specifically, is a…

Optimization and Control · Mathematics 2024-10-24 Wenfang Yao , Kaiwen Meng , Minghua Li , Xiaoqi Yang

Ribbon graphs embedded on a Riemann surface provide a useful way to describe the double line Feynman diagrams of large N computations and a variety of other QFT correlator and scattering amplitude calculations, e.g in MHV rules for…

High Energy Physics - Theory · Physics 2015-06-11 Robert de Mello Koch , Sanjaye Ramgoolam , Congkao Wen

We present constructions of countable two-dimensional subshifts of finite type (SFTs) with interesting properties. Our main focus is on properties of the topological derivatives and subpattern posets of these objects. We present a countable…

Dynamical Systems · Mathematics 2013-10-03 Ville Salo , Ilkka Törmä

These expository notes are dedicated to the study of the topology of configuration spaces of manifolds. We give detailed computations of many invariants, including the fundamental group of the configuration spaces of $\mathbb{R}^2$, the…

Algebraic Topology · Mathematics 2018-03-30 Ben Knudsen

We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…

Combinatorics · Mathematics 2026-05-11 Sasha Bell , Serte Donderwinkel , Remco van der Hofstad

In previous work, we introduced a method for modeling a configuration of objects in 2D and 3D images using a mathematical "medial/skeletal linking structure." In this paper, we show how these structures allow us to capture positional…

Computer Vision and Pattern Recognition · Computer Science 2017-06-02 James Damon , Ellen Gasparovic

Given a positive integer $n$ and a partition $(n_1,\ldots,n_r)$ of $n$, one can consider the associated $n$-dimensional multiprojective space $\mathbb{P}^{n_1}\times \cdots \times \mathbb{P}^{n_r}$. These multiprojective spaces are…

Algebraic Geometry · Mathematics 2025-07-15 Arijit Mukherjee

We consider the ring of invariants of n points on the projective line. The space (P^1)^n // PGL_2 is perhaps the first nontrivial example of a Geometry Invariant Theory quotient. The construction depends on the weighting of the n points.…

Algebraic Geometry · Mathematics 2009-06-16 Ben Howard , John Millson , Andrew Snowden , Ravi Vakil

We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…

Combinatorics · Mathematics 2025-11-12 Andrew Li , Hua Wang

This article is concerned with a geometric tool given by a pair of projector operators defined by almost product structures on finite dimensional manifolds, polarized by a distribution of constant rank and also endowed with some geometric…

Mathematical Physics · Physics 2011-10-11 Paulo Pitanga , Paulo R. Rodrigues

In this paper we study the geometry of graph spaces endowed with a special class of graph edit distances. The focus is on geometrical results useful for statistical pattern recognition. The main result is the Graph Representation Theorem.…

Computer Vision and Pattern Recognition · Computer Science 2015-06-01 Brijnesh J. Jain

This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…

Combinatorics · Mathematics 2014-10-13 Cheyne Homberger

The degree of a point configuration is defined as the maximal codimension of its interior faces. This concept is motivated from a corresponding Ehrhart-theoretic notion for lattice polytopes and is related to neighborly polytopes and the…

Combinatorics · Mathematics 2013-08-28 Benjamin Nill , Arnau Padrol

This paper gives some relating results for various concepts of convexity in metric spaces such as midpoint convexity, convex structure, uniform convexity and near-uniform convexity, Busemann curvature and its relation to convexity. Some…

Functional Analysis · Mathematics 2016-09-08 M De la Sen

Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…

Computational Geometry · Computer Science 2017-02-10 Jean Cardinal , Stefan Felsner

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

Combinatorics · Mathematics 2007-05-23 Sergey Kitaev , Tyrrell B. McAllister , T. Kyle Petersen

We consider the problem of computing the distance-dependent two-point function of general planar maps and hypermaps, i.e. the problem of counting such maps with two marked points at a prescribed distance. The maps considered here may have…

Combinatorics · Mathematics 2015-07-21 Jérémie Bouttier , Éric Fusy , Emmanuel Guitter

The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…

Combinatorics · Mathematics 2021-01-19 Jan Kurkofka , Ruben Melcher