English
Related papers

Related papers: Rational Polygons: Odd Compression Ratio and Odd P…

200 papers

Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…

Combinatorics · Mathematics 2019-09-27 Norman Do , Jian He , Daniel V. Mathews

The article is devoted to the question whether the orbit space of a compact linear group is a topological manifold and a homological manifold. In the paper, the case of a simple three-dimensional group is considered. An upper bound is…

Algebraic Geometry · Mathematics 2022-05-05 O. G. Styrt

In this work, we will explore some polygons that individually are capable of filling the plane in an aperiodic way. These polygons were recently discovered by some researchers and constitute a great discovery for Mathematics. We will…

General Mathematics · Mathematics 2023-11-28 Astor Santos Neto , Sandra Maria Barbosa , Alcebiades Dal Col

We confirm two conjectures of Lassak on the area of reduced spherical polygons. The area of every reduced spherical non-regular $n$-gon is less than that of the regular spherical $n$-gon of the same thickness. Moreover, the area of every…

Metric Geometry · Mathematics 2020-09-29 Cen Liu , Yanxun Chang , Zhanjun Su

For a multiplicative cohomology theory E, complex orientations are in bijective correspondence with multiplicative natural transformations to E from complex bordism cohomology MU. If E is represented by a spectrum with a highly structured…

Algebraic Topology · Mathematics 2017-08-09 Michael J. Hopkins , Tyler Lawson

Let $P$ be a set of $n$ points in the plane. A crossing-free structure on $P$ is a plane graph with vertex set $P$. Examples of crossing-free structures include triangulations of $P$, spanning cycles of $P$, also known as polygonalizations…

Computational Geometry · Computer Science 2013-12-18 Victor Alvarez , Karl Bringmann , Radu Curticapean , Saurabh Ray

We bound the number of permutations with a fixed number $r$ of $321 \ominus p_0$ patterns by a constant times the number of permutations which avoid $321 \ominus p_0$. We use this new upper bound to show that the ordinary generating…

Combinatorics · Mathematics 2025-10-29 Michael Waite

We discuss the problem of finding an analogue of the concept of a topological space in supergeometry, motivated by a search for a procedure to compactify a supermanifold along odd coordinates. In particular, we examine the topologies…

General Topology · Mathematics 2007-05-23 Ugo Bruzzo , Vladimir Pestov

We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequence of simple folds? There are several models of simple folds;…

We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…

Computational Geometry · Computer Science 2007-05-23 Rina Panigrahy

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

Combinatorics · Mathematics 2025-09-30 Marién Abreu , Martin Funk , Vedran Krčadinac , Domenico Labbate

In this paper we construct indecomposable vector bundles associated to monads on Cartesian products of odd dimension projective spaces. Specifically we establish the existence of monads on…

Algebraic Geometry · Mathematics 2025-04-15 Damian Maingi

Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its…

Combinatorics · Mathematics 2007-05-23 Jeremy J. Carroll

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

Number Theory · Mathematics 2012-10-03 Ayah Almousa , Melanie Matchett Wood

Let X be a non-singular projective hypersurface of degree 4, which is defined over the rational numbers. Assume that X has dimension 39 or more, and that X contains a real point and p-adic points for every prime p. Then X is shown to…

Number Theory · Mathematics 2008-01-08 T. D. Browning , D. R. Heath-Brown

When the boundary of a familiar object is shown by a series of isolated dots, humans can often recognize the object with ease. This ability can be sustained with addition of distracting dots around the object. However, such capability has…

Computer Vision and Pattern Recognition · Computer Science 2015-03-04 Toshiro Kubota

Let $\mathrm{pod}_{-3}(n)$ denote the number of partition triples of $n$ where the odd parts in each partition are distinct. We find many arithmetic properties of $\mathrm{pod}_{-3}(n)$ involving the following infinite family of…

Number Theory · Mathematics 2015-07-13 Liuquan Wang

We study the problem of when a periodic square matrix of order $n$ over an arbitrary field $\mathbb{F}$ is decomposable into the sum of a square-zero matrix and a torsion matrix, and show that this decomposition can always be obtained for…

Rings and Algebras · Mathematics 2026-04-20 Peter Danchev , Esther García , Miguel Gómez Lozano

A system of sets forms an {\em $m$-fold covering} of a set $X$ if every point of $X$ belongs to at least $m$ of its members. A $1$-fold covering is called a {\em covering}. The problem of splitting multiple coverings into several coverings…

Metric Geometry · Mathematics 2015-05-27 János Pach , Dömötör Pálvölgyi

It is shown that every orthogonal terrain, i.e., an orthogonal (right-angled) polyhedron based on a rectangle that meets every vertical line in a segment, has a grid unfolding: its surface may be unfolded to a single non-overlapping piece…

Computational Geometry · Computer Science 2007-07-12 Joseph O'Rourke