English
Related papers

Related papers: Exact generating function for 2-convex polygons

200 papers

Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even numerators. When numerators are odd, the numbers of partitions…

Number Theory · Mathematics 2021-01-25 Zachary Hoelscher , Eyvindur Ari Palsson

We introduce a systematic approach to express generating functions for the enumeration of maps on surfaces of high genus in terms of a single generating function relevant to planar surfaces. Central to this work is the comparison of two…

Mathematical Physics · Physics 2023-02-07 Nicholas Ercolani , Joceline Lega , Brandon Tippings

Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…

Combinatorics · Mathematics 2010-12-13 Roland Bacher , Frédéric Mouton

This paper is devoted to the general problem of projection onto a polyhedral convex cone generated by a finite set of generators.This problem is reformulated into projection onto the polytope obtained by simple truncation of the original…

Optimization and Control · Mathematics 2020-10-26 Evgeni Nurminski

In this paper we consider a restricted class of convex polyominoes that we call Z-convex polyominoes. Z-convex polyominoes are polyominoes such that any two pairs of cells can be connected by a monotone path making at most two turns (like…

Combinatorics · Mathematics 2007-05-23 Enrica Duchi , Simone Rinaldi , Gilles Schaeffer

The object of investigations are almost contact B-metric manifolds which are derived as a product of a real line and a 2-dimensional manifold equipped with a complex structure and a Norden metric. There are used two different methods for…

Differential Geometry · Mathematics 2015-06-19 Hristo Manev

We enumerate weighted graphs with a certain upper bound condition. We also compute the generating function of the numbers of these graphs, and prove that it is a rational function. In particular, we show that if the given graph is a…

Combinatorics · Mathematics 2007-05-23 Miklós Bóna , Hyeong-Kwan Ju , Ruriko Yoshida

It is shown that several of Brafman's generating functions for the Gegenbauer polynomials are algebraic functions of their arguments, if the Gegenbauer parameter differs from an integer by one-fourth or one-sixth. Two examples are given,…

Classical Analysis and ODEs · Mathematics 2018-02-02 Robert S. Maier

We study orthogonal polynomials on a fully symmetric planar domain $\Omega$ that is generated by a certain triangle in the first quadrant. For a family of weight functions on $\Omega$, we show that orthogonal polynomials that are even in…

Classical Analysis and ODEs · Mathematics 2025-09-15 Yuan Xu

Given a finite collection P of convex n-polytopes in RP^n (n>1), we consider a real projective manifold M which is obtained by gluing together the polytopes in P along their facets in such a way that the union of any two adjacent polytopes…

Geometric Topology · Mathematics 2007-05-29 Jaejeong Lee

In this paper we deal with a family of non--standard polynomials orthogonal with respect to an inner product involving differences. This type of inner product is the so--called $\Delta$--Sobolev inner product. Concretely, we consider the…

Classical Analysis and ODEs · Mathematics 2007-06-06 Juan J. Moreno-Balcazar , Teresa E. Perez , Miguel A. Pinar

The aim of this article is to show the existence, and also give an explicit construction, of infinite sets of orthogonal exponentials for certain families of convex polytopes which include simple-rational polytopes and also non simple…

Combinatorics · Mathematics 2019-09-19 Yehonatan Salman

Let $\Delta_m$ be the standard $m$-dimensional simplex of non-negative $m+1$ tuples that sum to unity and let $S$ be a nonempty subset of $\Delta_m$. A real valued function $h$ defined on a convex subset of a real vector space is $S$-almost…

Functional Analysis · Mathematics 2007-05-23 S. J. Dilworth , Ralph Howard , James W. Roberts

We consider the natural problem of counting isotopy classes of essential surfaces in 3-manifolds, focusing on closed essential surfaces in a broad class of hyperbolic 3-manifolds. Our main result is that the count of (possibly disconnected)…

Geometric Topology · Mathematics 2022-01-26 Nathan M. Dunfield , Stavros Garoufalidis , J. Hyam Rubinstein

We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…

Combinatorics · Mathematics 2015-05-08 Sven Verdoolaege , Kevin Woods

Finite convex geometries are combinatorial structures. It follows from a recent result of M.\ Richter and L.G.\ Rogers that there is an infinite set $T_{rr}$ of planar convex polygons such that $T_{rr}$ with respect to geometric convex…

Combinatorics · Mathematics 2016-08-24 Gábor Czédli , János Kincses

Quite recently, McDuff showed that the existence of a symplectic embedding of one four-dimensional ellipsoid into another can be established by comparing their corresponding sequences of ECH capacities. In this note we show that these…

Symplectic Geometry · Mathematics 2011-03-01 David Bauer

Given a rational point on a curve in a rational isogeny class, a natural question concerns the field of definition of its pre-images. The multiplication by m endomorphism is a powerful and much-used tool. The pre-images for this map are…

Number Theory · Mathematics 2008-10-02 Jonathan Reynolds

Sequences are often conveniently encoded in the form of a generating function depending on a formal variable. This note presents two observations that allow one to draw conclusions about the generated sequence from the generating function.…

Classical Analysis and ODEs · Mathematics 2025-11-17 Alex Kasman , Robert Milson

We prove that any finite polyhedral manifold in 3D can be continuously flattened into 2D while preserving intrinsic distances and avoiding crossings, answering a 19-year-old open problem, if we extend standard folding models to allow for…

Computational Geometry · Computer Science 2021-05-25 Zachary Abel , Erik D. Demaine , Martin L. Demaine , Jason S. Ku , Jayson Lynch , Jin-ichi Itoh , Chie Nara