English
Related papers

Related papers: Counting plane arrangements via oriented matroids

200 papers

We show that the number of linear spaces on a set of $n$ points and the number of rank-3 matroids on a ground set of size $n$ are both of the form $(cn+o(n))^{n^2/6}$, where $c=e^{\sqrt 3/2-3}(1+\sqrt 3)/2$. This is the final piece of the…

Combinatorics · Mathematics 2024-05-31 Matthew Kwan , Ashwin Sah , Mehtaab Sawhney

We prove that if one colors each point of the Euclidean plane with one of five colors, then there exist two points of the same color that are either distance $1$ or distance $2$ apart.

Combinatorics · Mathematics 2019-10-01 Geoffrey Exoo , Dan Ismailescu

We first describe a reduction from the problem of lower-bounding the number of distinct distances determined by a set $S$ of $s$ points in the plane to an incidence problem between points and a certain class of helices (or parabolas) in…

Computational Geometry · Computer Science 2010-05-07 György Elekes , Micha Sharir

We introduce a natural notion of depth that applies to individual cutting planes as well as entire families. This depth has nice properties that make it easy to work with theoretically, and we argue that it is a good proxy for the practical…

Optimization and Control · Mathematics 2019-03-14 Laurent Poirrier , James Yu

Let $\mathrm{PG}(3,q)$ be the projective space of dimension three over the finite field with $q$ elements. Consider a twisted cubic in $\mathrm{PG}(3,q)$. The structure of the point-plane incidence matrix in $\mathrm{PG}(3,q)$ with respect…

Combinatorics · Mathematics 2020-03-03 Daniele Bartoli , Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…

Combinatorics · Mathematics 2016-10-03 Wenjie Fang

To any two-dimensional rational plane in four-dimensional space one can naturally attach a point in the Grassmannian Gr(2,4) and four lattices of rank two. Here, the first two lattices originate from the plane and its orthogonal complement…

Number Theory · Mathematics 2021-06-22 Menny Aka , Manfred Einsiedler , Andreas Wieser

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,…

Computational Geometry · Computer Science 2019-11-20 Alberto Paoluzzi , Vadim Shapiro , Antonio DiCarlo , Francesco Furiani , Giulio Martella , Giorgio Scorzelli

This paper is an addition to the book [54] on Compact projective planes. Such planes, if connected and finite-dimensional, have a point space of topological dimension 2, 4, 8, or 16, the classical example in the last case being the…

Geometric Topology · Mathematics 2017-06-13 Helmut R. Salzmann

A 2-uniform tiling is an edge-to-edge tiling by regular polygons having $2$ distinct transitivity classes of vertices. There are 20 distinct 2-uniform tilings (these are of $14$ different types) on the plane, and since the plane is the…

Geometric Topology · Mathematics 2021-09-02 Dipendu Maity , Debashis Bhowmik , Marbarisha M. Kharkongor

This paper proposes a new mathematical framework that can be applied to biological problems such as analysis of the structures of proteins and protein complexes. In particular, it gives a new method for encoding the three-dimensional…

Combinatorics · Mathematics 2007-05-23 Naoto Morikawa

It is an attractive hypothesis that the spatial structure of visual cortical architecture can be explained by the coordinated optimization of multiple visual cortical maps representing orientation preference (OP), ocular dominance (OD),…

Neurons and Cognition · Quantitative Biology 2015-06-03 Lars Reichl , Dominik Heide , Siegrid Löwel , Justin C. Crowley , Matthias Kaschube , Fred Wolf

An arithmetical discrete plane is said to have critical connecting thickness if its thickness is equal to the infimum of the set of values that preserve its $2$-connectedness. This infimum thickness can be computed thanks to the fully…

Discrete Mathematics · Computer Science 2014-06-27 Valérie Berthé , Damien Jamet , Timo Jolivet , Xavier Provençal

In this paper we discuss the relationship between the moving planes of a rational parametric surface and the singular points on it. Firstly, the intersection multiplicity of several planar curves is introduced. Then we derive an equivalent…

Numerical Analysis · Mathematics 2010-01-14 Falai Chen , Xuhui Wang

In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of two main parts. In the first, we address problems and…

Computational Geometry · Computer Science 2007-05-23 Alon Efrat , Piotr Indyk , Suresh Venkatasubramanian

Let $P$ be a set of $n$ points in real projective $d$-space, not all contained in a hyperplane, such that any $d$ points span a hyperplane. An ordinary hyperplane of $P$ is a hyperplane containing exactly $d$ points of $P$. We show that if…

Combinatorics · Mathematics 2020-04-24 Aaron Lin , Konrad Swanepoel

Let $n$ be the order of a (quaternary) Hadamard matrix. It is shown that the existence of a projective plane of order $n$ is equivalent to the existence of a balancedly multi-splittable (quaternary) Hadamard matrix of order $n^2$.

Combinatorics · Mathematics 2022-11-07 Hadi Kharaghani , Sho Suda

This paper explores the mathematical modelling and 3D design of a tilt-rotor quadrotor aircraft. The aircraft is a VTOL design and has capacity for one pilot. The design incorporates a part manual part automatic computerised flight control…

Systems and Control · Electrical Eng. & Systems 2024-12-17 Theodore Nye-Matthew , Xinhua Wang

Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm for computing such a line was proposed by Mukhopadhyay et…

Computational Geometry · Computer Science 2007-05-23 Olivier Devillers , Asish Mukhopadhyay

We study three covering problems in the plane. Our original motivation for these problems come from trajectory analysis. The first is to decide whether a given set of line segments can be covered by up to four unit-sized, axis-parallel…

Computational Geometry · Computer Science 2022-05-03 Joachim Gudmundsson , Mees van de Kerkhof , André van Renssen , Frank Staals , Lionov Wiratma , Sampson Wong