AbstractFor n≥3, let Ωn be the set of line segments between the vertices of a convex n-gon. For j≥2, a j-crossing is a set of j line segments pairwise intersecting in the relative interior of the n-gon. For k≥1, let Δn,k be the simplicial complex of (type-A) generalized triangulations, i.e. the simplicial complex of subsets of Ωn not containing any (k+1)-crossing.The complex Δn,k has been the central object of many papers. Here we continue this work by considering the complex of type-B generalized triangulations. For this we identify line segments in Ω2n which can be transformed into each other by a 180∘-rotation of the 2n-gon. Let Fn be the set Ω2n after identification, then the complex Dn,k of type-B generalized triangulations is the simp...
AbstractWe investigate the line arrangement that results from intersecting d complete flags in Cn. W...
In this thesis, we undertake a combinatorial study of certain aspects of triangulations of cartesian...
We consider triangulations of closed surfaces S with a given set of vertices V ; every triangulation...
AbstractFor n⩾3, let Ωn be the set of line segments between vertices in a convex n-gon. For j⩾1, a j...
AbstractFor n≥3, let Ωn be the set of line segments between the vertices of a convex n-gon. For j≥2,...
AbstractFor n⩾3, let Ωn be the set of line segments between vertices in a convex n-gon. For j⩾1, a j...
Let Pn be a convex n-gon in the plane, n ⩾ 3. Consider Σn, the collection of all sets of mutually no...
Let Pn be a convex n-gon in the plane, n ⩾ 3. Consider Σn, the collection of all sets of mutually no...
This thesis explores two specific topics of discrete geometry, the multitriangulations and the polyt...
AbstractWe connect k-triangulations of a convex n-gon to the theory of Schubert polynomials. We use ...
AbstractWe connect k-triangulations of a convex n-gon to the theory of Schubert polynomials. We use ...
A $k$-triangulation of a convex polygon is a maximal set of diagonals so that no $k+1$ of them mutua...
Abstract. We exhibit a canonical connection between maximal (0, 1)-fillings of a moon polyomino avoi...
Abstract. A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them...
AbstractLet ΓnA denote the abstract simplicial complex whose elements are dissections of a convex (n...
AbstractWe investigate the line arrangement that results from intersecting d complete flags in Cn. W...
In this thesis, we undertake a combinatorial study of certain aspects of triangulations of cartesian...
We consider triangulations of closed surfaces S with a given set of vertices V ; every triangulation...
AbstractFor n⩾3, let Ωn be the set of line segments between vertices in a convex n-gon. For j⩾1, a j...
AbstractFor n≥3, let Ωn be the set of line segments between the vertices of a convex n-gon. For j≥2,...
AbstractFor n⩾3, let Ωn be the set of line segments between vertices in a convex n-gon. For j⩾1, a j...
Let Pn be a convex n-gon in the plane, n ⩾ 3. Consider Σn, the collection of all sets of mutually no...
Let Pn be a convex n-gon in the plane, n ⩾ 3. Consider Σn, the collection of all sets of mutually no...
This thesis explores two specific topics of discrete geometry, the multitriangulations and the polyt...
AbstractWe connect k-triangulations of a convex n-gon to the theory of Schubert polynomials. We use ...
AbstractWe connect k-triangulations of a convex n-gon to the theory of Schubert polynomials. We use ...
A $k$-triangulation of a convex polygon is a maximal set of diagonals so that no $k+1$ of them mutua...
Abstract. We exhibit a canonical connection between maximal (0, 1)-fillings of a moon polyomino avoi...
Abstract. A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them...
AbstractLet ΓnA denote the abstract simplicial complex whose elements are dissections of a convex (n...
AbstractWe investigate the line arrangement that results from intersecting d complete flags in Cn. W...
In this thesis, we undertake a combinatorial study of certain aspects of triangulations of cartesian...
We consider triangulations of closed surfaces S with a given set of vertices V ; every triangulation...