Now showing items 1-3 of 3

• #### Counting polygon dissections in the projective plane ﻿

(2008-10)
Article
Open Access
For each value of k ≥ 2, we determine the number pn of ways of dissecting a polygon in the projective plane into n subpolygons with k + 1 sides each. In particular, if k = 2 we recover a result of Edelman and Reiner (1997) ...
• #### Enumeration and limit laws of dissections on a cylinder ﻿

(2010-09-28)
Article
Open Access
We compute the generating function for triangulations on a cylinder, with the restriction that all vertices belong to its boundary and that the intersection of a pair of different faces is either empty, a vertex or an edge. ...
• #### On a question of Sárkozy and Sós for bilinear forms ﻿

(2009-02-02)
Article
Restricted access - publisher's policy
We prove that if 2 ≤ k1 ≤ k2, then there is no infinite sequence $\emph{A}$ of positive integers such that the representation function r(n)=#{(a, a'): n=$k{_1}a$ + $k{_2}a'$, a,a' ∊ $\emph{A}$} is constant for n large ...