English
Related papers

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

200 papers

In this paper, we introduce the polynomial continued fraction, a close relative of the well-known simple continued fraction expansions which are widely used in number theory and in general. While they may not possess all the intriguing…

Dynamical Systems · Mathematics 2023-12-04 Ofir David

This paper studies the restriction multiplicities of half-diagram modules for the partition algebra and their geometric interpretations. By specializing the Bowman-De Visscher-Orellana formula [BVC, Theorem 4.3] for restriction…

Representation Theory · Mathematics 2025-11-11 Pei Wang , Changjing Zhuge

Motivated by a question of R.\ Nandakumar, we show that the Euclidean plane can be dissected into mutually incongruent convex pentagons of the same area and the same perimeter.

Metric Geometry · Mathematics 2022-02-04 Dirk Frettlöh , Christian Richter

The separation of two sets (or more specific of two cones) plays an important role in different fields of mathematics such as variational analysis, convex analysis, convex geometry, optimization. In the paper, we derive some new results for…

Functional Analysis · Mathematics 2023-08-04 Christian Günther , Bahareh Khazayel , Christiane Tammer

The Euler numbers have been widely studied. A signed version of the Euler numbers of even subscript are given by the coefficients of the exponential generating function 1/(1+x^2/2!+x^4/4!+...). Leeming and MacLeod introduced a…

Number Theory · Mathematics 2025-01-15 Bruce E. Sagan

There is a natural notion of a subdivision of a lower Eulerian poset called a strong formal subdivision, which abstracts the notion of a polyhedral subdivision of a polytope, or a proper, surjective morphism of fans. We show that there is a…

Combinatorics · Mathematics 2025-11-21 Alan Stapledon

Tewodros Amdeberhan and Armin Straub initiated the study of enumerating subfamilies of the set of (s,t)-core partitions. While the enumeration of (n+1,n+2)-core partitions into distinct parts is relatively easy (in fact it equals the…

Combinatorics · Mathematics 2018-03-05 Anthony Zaleski , Doron Zeilberger

For m>n\geq 0 and 1\leq d\leq m, it is shown that the q-Euler number E_{2m}(q) is congruent to q^{m-n}E_{2n}(q) mod (1+q^d) if and only if m\equiv n mod d. The q-Sali\'e number S_{2n}(q) is shown to be divisible by…

Combinatorics · Mathematics 2011-03-25 Victor J. W. Guo , Jiang Zeng

Let $p_{\textrm{dsd}} (n)$ be the number of partitions of $n$ into distinct squarefree divisors of $n$. In this note, we find a lower bound for $p_{\textrm{dsd}} (n)$, as well as a sequence of $n$ for which $p_{\textrm{dsd}} (n)$ is…

Number Theory · Mathematics 2024-02-14 Noah Lebowitz-Lockard , Joseph Vandehey

We consider an algebraic variety and its foliation, both defined over a number field. We prove upper bounds for the geometric complexity of the intersection between a leaf of the foliation and a subvariety of complementary dimension (also…

Algebraic Geometry · Mathematics 2023-06-22 Gal Binyamini

The number of plane partitions contained in a given box was shown by MacMahon to be given by a simple product formula. By a simple bijection, this formula also enumerates lozenge tilings of hexagons of side-lengths $a,b,c,a,b,c$ (in cyclic…

Combinatorics · Mathematics 2007-05-23 Mihai Ciucu

We characterize sequences of positive integers $(a_1,a_2,\ldots,a_n)$ for which the $2\times2$ matrix $\left( \begin{array}{cc} a_n&-1 1&0 \end{array} \right) \left( \begin{array}{cc} a_{n-1}&-1 1&0 \end{array} \right) \cdots \left(…

Combinatorics · Mathematics 2018-05-23 Valentin Ovsienko

Let $S$ be a finite subset of ${\mathbb R}^2 \setminus (0,0)$. Generally, one would expect the pattern of lines $Ax + By = 1$, where $(A, B) \in S$ to contain polygons of all shapes and sizes. We show, however, that when $S$ is a…

Combinatorics · Mathematics 2023-12-21 Milena Harned , Iris Liebman

Haj\'os conjecture asserts that a simple Eulerian graph on n vertices can be decomposed into at most (n - 1)/2 cycles. The conjecture is only proved for graph classes in which every element contains vertices of degree 2 or 4. We develop new…

Combinatorics · Mathematics 2017-08-11 Elke Fuchs , Laura Gellert , Irene Heinrich

In this paper, we enumerate Newton polygons asymptotically. The number of Newton polygons is computable by a simple recurrence equation, but unexpectedly the asymptotic formula of its logarithm contains growing oscillatory terms. As the…

Number Theory · Mathematics 2020-03-26 Shushi Harashita

The paper is devoted to a comprehensive second-order study of a remarkable class of convex extended-real-valued functions that is highly important in many aspects of nonlinear and variational analysis, specifically those related to…

Optimization and Control · Mathematics 2015-07-21 Boris S. Mordukhovich , M. Ebrahim Sarabi

We consider consecutive random subdivision of polygons described as follows. Given an initial convex polygon with $d\ge 3$ edges, we choose a point at random on each edge, such that the proportions in which these points divide edges are…

Probability · Mathematics 2017-08-23 Nguyen Tuan Minh , Stanislav Volkov

Meixner (1934) proved that there exist exactly five classes of orthogonal Sheffer sequences: Hermite polynomials which are orthogonal with respect to Gaussian distribution, Charlier polynomials orthogonal with respect to Poisson…

Mathematical Physics · Physics 2025-12-04 Chadaphorn Kodsueb , Eugene Lytvynov

We consider polygon and simplex equations, of which the simplest nontrivial examples are pentagon (5-gon) and Yang--Baxter (2-simplex), respectively. We examine the general structure of (2n+1)-gon and 2n-simplex equations in direct sums of…

Mathematical Physics · Physics 2021-05-04 Aristophanes Dimakis , Igor Korepanov

We demonstrate in an elementary way how to construct a frieze pattern of width $m-3$ from a partition of a convex $m$-gon by not intersecting diagonals.

Combinatorics · Mathematics 2025-09-10 Yury Kochetkov