中文
相关论文

相关论文: Explicit enumeration of triangulations with multip…

200 篇论文

We provide a characterization of infinite frieze patterns of positive integers via triangulations of an infinite strip in the plane. In the periodic case, these triangulations may be considered as triangulations of annuli. We also give a…

组合数学 · 数学 2015-04-13 Karin Baur , Mark James Parsons , Manuela Tschabold

We present an algorithm that enumerates and classifies all edge-to-edge gluings of unit squares that correspond to convex polyhedra. We show that the number of such gluings of $n$ squares is polynomial in $n$, and the algorithm runs in time…

计算几何 · 计算机科学 2021-11-30 Stefan Langerman , Nicolas Potvin , Boris Zolotov

All edge-to-edge tilings of the sphere by congruent regular triangles and congruent rhombi are classified as: (1) a $1$-parameter family of protosets each admitting a unique $(2a^3,3a^4)$-tiling like a triangular prism; (2) a $1$-parameter…

组合数学 · 数学 2023-11-27 Qi Yuan , Erxiao Wang

A \emph{thrackle} is a graph drawn in the plane so that every pair of its edges meet exactly once, either at a common end vertex or in a proper crossing. Conway's thrackle conjecture states that the number of edges is at most the number of…

组合数学 · 数学 2023-07-10 Balázs Keszegh , Dániel Simon

In this paper a closed form expression for the number of tilings of an $n\times n$ square border with $1\times 1$ and $2\times1$ cuisenaire rods is proved using a transition matrix approach. This problem is then generalised to $m\times n$…

组合数学 · 数学 2016-11-01 M. Connolly

We enumerate the state diagrams of the twist knot shadow which consist of the disjoint union of two trivial knots. The result coincides with the maximal number of regions into which the plane is divided by a given number of circles. We then…

组合数学 · 数学 2017-12-19 Franck Ramaharo

A recursive method is given for finding generating functions which enumerate rooted hypermaps by number of vertices, edges and faces for any given number of darts. It makes use of matrix-integral expressions arising from the study of…

组合数学 · 数学 2014-11-14 Jacob P. Dyer

In studying properties of simple drawings of the complete graph in the sphere, two natural questions arose for us: can an edge have multiple segments on the boundary of the same face? and is each face the intersection of sides of 3-cycles?…

组合数学 · 数学 2020-05-15 R. Bruce Richter , Matthew Sullivan

We describe a framework that unifies the two types of polynomials introduced respectively by Bacher and Mouton and by Rutschmann and Wettstein to analyze the number of triangulations of point sets. Using this insight, we generalize the…

计算几何 · 计算机科学 2025-04-15 Hong Duc Bui

We prove that it is $\#\mathsf{P}$-complete to count the triangulations of a (non-simple) polygon.

计算几何 · 计算机科学 2020-12-07 David Eppstein

We classify all wormhole singularities, i.e. cyclic quotient surface singularities admitting at least two extremal P-resolutions, thereby solving an open problem posed by Urz\'ua. Our approach introduces a new combinatorial framework based…

代数几何 · 数学 2025-12-10 Jaime Negrete

A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to…

组合数学 · 数学 2026-05-13 Nathan Reading

We study the maximum numbers of pseudo-triangulations and pointed pseudo-triangulations that can be embedded over a specific set of points in the plane or contained in a specific triangulation. We derive the bounds $O(5.45^N)$ and $\Omega…

计算几何 · 计算机科学 2012-10-29 Moria Ben-Ner , André Schulz , Adam Sheffer

It is conjectured that every cusped hyperbolic 3-manifold has a decomposition into positive volume ideal hyperbolic tetrahedra (a "geometric" triangulation of the manifold). Under a mild homology assumption on the manifold we construct…

几何拓扑 · 数学 2014-02-26 Craig D. Hodgson , J. Hyam Rubinstein , Henry Segerman

We give a combinatorial characterization of the identities holding in the semiring of all upper triangular Boolean $n\times n$-matrices and apply the characterization to computational complexity of identity checking, finite axiomatizability…

群论 · 数学 2025-10-08 Mikhail V. Volkov

We extend Heawood's theorem on the colourability of plane triangulations to triangulations of 3-space. We prove that a triangulation of 3-space can be edge coloured with three colours if and only if all edges have even degree.

组合数学 · 数学 2023-06-22 Johannes Carmesin , Emily Nevinson , Bethany Saunders

We study the number of points in the family of plane curves defined by a trinomial \[ \mathcal{C}(\alpha,\beta)= \{(x,y)\in\mathbb{F}_q^2\,:\,\alpha x^{a_{11}}y^{a_{12}}+\beta x^{a_{21}}y^{a_{22}}=x^{a_{31}}y^{a_{32}}\} \] with fixed…

数论 · 数学 2021-02-23 Martin Avendano , Jorge Martin-Morales

We compute the number of all rhombus tilings of a hexagon with sides $a,b+1,c,a+1,b,c+1$, of which the central triangle is removed, provided $a,b,c$ have the same parity. The result is a product of four numbers, each of which counts the…

组合数学 · 数学 2007-05-23 Soichi Okada , Christian Krattenthaler

We classify edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^4b$ and with rational angles in degree: they are a one-parameter family of symmetric $a^4b$-pentagonal subdivisions of the tetrahedron with…

组合数学 · 数学 2025-07-10 Jinjin Liang , Yixi Liao , Wenchuan Hu , Erxiao Wang

We describe the cone of Betti tables of all finitely generated graded modules over the homogeneous coordinate ring of three non-collinear points in the projective plane. We also describe the cone of Betti tables of all finite length…

交换代数 · 数学 2016-11-21 Iulia Gheorghita , Steven V Sam