English
Related papers

Related papers: On Blocking Numbers of Surfaces

200 papers

Maxwell's rule from 1864 gives a necessary condition for a framework to be isostatic in 2D or in 3D. Given a framework with point group symmetry, group representation theory is exploited to provide further necessary conditions. This paper…

Metric Geometry · Mathematics 2008-09-27 Robert Connelly , Patrick Fowler , Simon Guest , Bernd Schulze , Walter Whiteley

A triangulation of a punctured or pinched surface is irreducible if no edge can be shrunk without producing multiple edges or changing the topological type of the surface. The finiteness of the set of (non-isomorphic) irreducible…

Combinatorics · Mathematics 2013-06-04 M. J. Chávez , S. Lawrencenko , A. Quintero , M. T. Villar

The mix of two maniplexes is the minimal maniplex that covers both. This construction has many important applications, such as finding the smallest regular cover of a maniplex. If one of the maniplexes is an abstract polytope, a natural…

Combinatorics · Mathematics 2025-06-25 Gabe Cunningham , Isabel Hubard

We obtain some restrictions on the topology of infinite volume hyperbolic manifolds. In particular, for any n and any closed negatively curved manifold M of dimension greater than 2, only finitely many hyperbolic n-manifolds are total…

Geometric Topology · Mathematics 2014-11-11 Igor Belegradek

A Meyniel obstruction is an odd cycle with at least five vertices and at most one chord. A graph is Meyniel if and only if it has no Meyniel obstruction as an induced subgraph. Here we give a O(n^2) algorithm that, for any graph, finds…

Discrete Mathematics · Computer Science 2007-11-13 Kathie Cameron , Jack Edmonds , Benjamin Lévêque , Frédéric Maffray

Given a closed polygon P having n edges, embedded in R^d, we give upper and lower bounds for the minimal number of triangles t needed to form a triangulated PL surface in R^d having P as its geometric boundary. The most interesting case is…

Geometric Topology · Mathematics 2007-05-23 Joel Hass , Jeffrey C. Lagarias

We study a polyhedron with $n$ vertices of fixed volume having minimum surface area. Completing the proof of Fejes Toth, we show that all faces of a minimum polyhedron are triangles, and further prove that a minimum polyhedron does not…

Metric Geometry · Mathematics 2020-12-21 Shigeki Akiyama

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the minimum number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We find lower bounds linear in $n$ for…

Group Theory · Mathematics 2020-12-09 Daniela Bubboloni , Cheryl E. Praeger , Pablo Spiga

Assume that there exists a smooth map between two closed manifolds $M^m\to N^k$ with only finitely many cone-like singular points, where $2\leq k\leq m\leq 2k-1$. If $(m,k)\not\in\{(2,2), (4,3), (5,3), (8,5), (16,9)\}$, then $M^m$ admits a…

Geometric Topology · Mathematics 2021-05-21 Louis Funar

A partial formula is provided to calculate the smallest number of vertices possible in a quadrangulation on the closed orientable 2-manifold of given genus. This extends the previously known partial formula due to N. Hartsfield and G.…

Combinatorics · Mathematics 2012-08-28 Serge Lawrencenko

We rule out a certain $9$-dimensional algebra over an algebraically closed field to be the basic algebra of a block of a finite group, thereby completing the classification of basic algebras of dimension at most $12$ of blocks of finite…

Representation Theory · Mathematics 2020-05-06 Markus Linckelmann , William Murphy

Given a set $P$ of $n$ points in the plane, its separability is the minimum number of lines needed to separate all its pairs of points from each other. We show that the minimum number of lines needed to separate $n$ points, picked randomly…

Computational Geometry · Computer Science 2017-06-08 Sariel Har-Peled , Mitchell Jones

In this paper we establish bounds on the number of vertices for a few classes of convex sublattice-free lattice polygons. The bounds are essential for proving the formula for the critical number of vertices of a lattice polygon that ensures…

Number Theory · Mathematics 2016-08-23 Nikolai Bliznyakov , Stanislav Kondratyev

This paper gives a uniform, self-contained and direct approach to a variety of obstruction-theoretic problems on manifolds of dimension 7 and 6. We give necessary and sufficient cohomological criteria for the existence of various…

Algebraic Topology · Mathematics 2019-09-20 Martin Cadek , Michael Crabb , Tomas Salac

In this paper, we investigate analytic and geometric properties of obstruction flatness of strongly pseudoconvex CR hypersurfaces of dimension $2n-1$. Our first two results concern local aspects. Theorem 3.2 asserts that any strongly…

Complex Variables · Mathematics 2022-12-09 Peter Ebenfelt , Ming Xiao , Hang Xu

In this paper we show how the existence of a certain stable cylinder determines (locally) the ambient manifold where it is immersed. This cylinder has to verify a {\it bifurcation phenomena}, we make this explicit in the introduction. In…

Differential Geometry · Mathematics 2011-04-19 Jose M. Espinar

In the mid eighties Goldman proved an embedded curve could be isotoped to not intersect a closed geodesic if and only if their Lie bracket (as defined in that work) vanished. Goldman asked for a topological proof and about extensions of the…

Geometric Topology · Mathematics 2016-11-16 Moira Chas , Siddhartha Gadgil

The purpose of this paper is to produce restrictions on fundamental groups of manifolds admitting good complexifications by proving the following Cheeger-Gromoll type splitting theorem: Any closed manifold $M$ admitting a good…

Geometric Topology · Mathematics 2016-12-30 Indranil Biswas , Mahan Mj , A. J. Parameswaran

The purposes of this article are threefold. First, to determine numerically when an arbitrary blowup of a smooth surface is smooth. We show the surface is smooth if and only if certain rational parameters involving log discrepancy and…

Algebraic Geometry · Mathematics 2026-05-27 Richard A. P. Birkett

Suppose that a polygon $P$ is given as an array containing the vertices in counterclockwise order. We analyze how many vertices (including the index of each of these vertices) we need to know before we can bound $P$, i.e., report a bounded…

Computational Geometry · Computer Science 2025-09-05 Mikkel Abrahamsen , Jack Stade , Shuyi Yan , Hanwen Zhang
‹ Prev 1 3 4 5 6 7 10 Next ›