English
Related papers

Related papers: Polygon dissections and Euler, Fuss, Kirkman and C…

200 papers

We consider a variation of the classical Erd\H{o}s-Szekeres problems on the existence and number of convex $k$-gons and $k$-holes (empty $k$-gons) in a set of $n$ points in the plane. Allowing the $k$-gons to be non-convex, we show bounds…

For any integer $k\geq2$, we prove combinatorially the following Euler (binomial) transformation identity $$ \NC_{n+1}^{(k)}(t)=t\sum_{i=0}^n{n\choose i}\NW_{i}^{(k)}(t), $$ where $\NC_{m}^{(k)}(t)$ (resp.~$\NW_{m}^{(k)}(t)$) is the sum of…

Combinatorics · Mathematics 2019-09-17 Zhicong Lin , Dongsu Kim

A classical result from topology called Uryshon's lemma asserts the existence of a continuous separator of two disjoint closed sets in a sufficiently regular topological space. In this work we make a search for this separator constructive…

Algebraic Geometry · Mathematics 2022-07-04 Milan Korda , Jean-Bernard Lasserre , Alexey Lazarev , Victor Magron , Simone Naldi

In this paper we consider the generalized Catalan numbers F(s,n)= 1/((s-1)n+1) binom{sn}{n}. We find all $n$ such that for $p$ prime, p^q divides F(p^q,n), q>=1. As a byproduct we settle a question of Hough and the late Simion on the…

Number Theory · Mathematics 2007-05-23 Pantelimon Stanica

We study the problem of partitioning a polygon into the minimum number of subpolygons using cuts in predetermined directions such that each resulting subpolygon satisfies a given width constraint. A polygon satisfies the unit-width…

Computational Geometry · Computer Science 2025-09-15 Jaehoon Chung , Kazuo Iwama , Chung-Shou Liao , Hee-Kap Ahn

We examine the poset $P$ of 132-avoiding $n$-permutations ordered by descents. We show that this poset is the "coarsening" of the well-studied poset $Q$ of noncrossing partitions . In other words, if $x<y$ in $Q$, then $f(y)<f(x)$ in $P$,…

Combinatorics · Mathematics 2007-05-23 Miklos Bona

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

Combinatorics · Mathematics 2013-11-27 Pavel Kozhevnikov

We give a simple proof of the well-known divisibility by 2 condition for rational points on elliptic curves with rational 2-torsion. As an application of the explicit division by $2^n$ formulas obtained in Sec.2, we construct versal…

Number Theory · Mathematics 2017-02-13 Boris M. Bekker , Yuri G. Zarhin

This is a study of the construction of particular regular sub-n-gons T in regular n-gons P using a special system of chords of P. In particular, some of these sub-n-gons have areas which are integer divisors of the area of the given n-gon…

History and Overview · Mathematics 2026-03-03 James M Parks

Partitions of the set of primes are introduced based on the Chebyshev polynomials at rationals. The prime densities of all such partitions are established. Euler's Criterion for $SL(2,\mathbb Q)$ is formulated, which is the bridge between…

Number Theory · Mathematics 2020-08-04 Maciej P. Wojtkowski

A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a convex n-gon and pairs of non-crossing Dyck paths of length…

Combinatorics · Mathematics 2007-05-23 Sergi Elizalde

Let k and n be positive integers. We mainly show that $$(ln+1) | k\binom{kn+ln}{kn},$$ $$2\binom{kn}n | \binom {2n}{n}C_{2n}^{(k-1)}$$, $$\binom{kn}n | (2k-1)C_n\binom{2kn}{2n},$$ $$\binom{2n}n | (k+1)C_n^{(k-1)}\binom{2kn}{kn},$$…

Number Theory · Mathematics 2010-06-01 Zhi-Wei Sun

We show how the Fuss-Catalan numbers $ \frac{1}{p n+1}\binom{pn+1}{n}$ enter different problems of counting simple and multiple planar partitions.

Combinatorics · Mathematics 2023-11-07 Francesca Aicardi

It is well known that ascents, descents and plateaux are equidistributed over the set of classical Stirling permutations. Their common enumerative polynomials are the second-order Eulerian polynomials, which have been extensively studied by…

Combinatorics · Mathematics 2025-06-27 Shi-Mei Ma , Jun-Ying Liu , Jean Yeh , Yeong-Nan Yeh

For integers m, n $\ge$ 1, we describe a bijection sending dissections of the (mn + 2)-regular polygon into (m + 2)-sided polygons to a new basis of the quotient of the polynomial algebra in mn variables by an ideal generated by some kind…

Combinatorics · Mathematics 2016-07-11 Jean-Christophe Aval , Frédéric Chapoton

The classical Eulerian polynomials can be expanded in the basis $t^{k-1}(1+t)^{n+1-2k}$ ($1\leq k\leq\lfloor (n+1)/2\rfloor$) with positive integral coefficients. This formula implies both the symmetry and the unimodality of the Eulerian…

Combinatorics · Mathematics 2012-04-02 Guoniu Han , Frédéric Jouhet , Jiang Zeng

It is presented the simplest known disproof of the Borsuk conjecture stating that if a bounded subset of n-dimensional Euclidean space contains more than n points, then the subset can be partitioned into n+1 nonempty parts of smaller…

Combinatorics · Mathematics 2018-10-02 A. Skopenkov

Let $n\geq2$ be an integer. In this paper, we study the convexity of the so-called MacMahon's $q$-Catalan polynomials $C_n(q)=\frac1{[n+1]_q}\left[ 2n \atop n \right]_q$ as functions of $q$. Along the way, several intermediate results on…

Combinatorics · Mathematics 2023-09-06 Tewodros Amdeberhan

We construct a polygonal spiral by arranging a sequence of regular $n$-gons such that each $n$-gon shares a specified side and vertex with the $(n+1)$-gon in the construction. By offering flexibility for determining the size of each $n$-gon…

Metric Geometry · Mathematics 2024-04-16 Kyle Fridberg

We elucidate the vector space (twisted relative cohomology) that is Poincar\'e dual to the vector space of Feynman integrals (twisted cohomology) in general spacetime dimension. The pairing between these spaces - an algebraic invariant…

High Energy Physics - Theory · Physics 2022-01-05 Simon Caron-Huot , Andrzej Pokraka