AbstractFrom a topological space remove certain subspaces (cuts), leaving connected components (regions). We develop an enumerative theory for the regions in terms of the cuts, with the aid of a theorem on the Möbius algebra of a subset of a distributive lattice. Armed with this theory we study dissections into cellular faces and dissections in the d-sphere. For example, we generalize known enumerations for arrangements of hyperplanes to convex sets and topological arrangements, enumerations for simple arrangements and the Dehn-Sommerville equations for simple polytopes to dissections with general intersection, and enumerations for arrangements of lines and curves and for plane convex sets to dissections by curves of the 2-sphere and planar...
AbstractA formula for the maximum number of cells formed by planes that dissect a tetrahedron throug...
AbstractThis paper presents two new results of somewhat different flavors. The first result is a for...
AbstractFor natural families of polytopes determined by substructures (e.g., tours or matchings) of ...
We study arrangements of slightly skewed tropical hyperplanes, called blades by A. Ocneanu, on the v...
AbstractLet a d-simplex be dissected by hyperplanes, each cutting one edge and containing the opposi...
AbstractA topological hyperplane is a subspace of Rn (or a homeomorph of it) that is topologically e...
AbstractLet fk(F) denote the number of k-dimensional faces of a d-dimensional arrangement F of spher...
A toric arrangement is a finite set of hypersurfaces in a complex torus, each hypersurface being the...
AbstractThis paper presents a variety of formulas for the number of cells, faces, and edges, bounded...
This work.develops the foundations of topological graph theory with a unified approach using combin...
AbstractEvery arrangement H of affine hyperplanes in Rd determines a partition of Rd into open topol...
AMS Subject Classication: 05A15, 14H10, 58D29 Abstract. The problem of counting ramied covers of a R...
In this paper we show a a proof by explicit bijections of the famous Kirkman-Cayley formula for the ...
Abstract. The polytope structure of the associahedron is decomposed into two categories, types and c...
AbstractWe compute the generating function for triangulations on a cylinder, with the restriction th...
AbstractA formula for the maximum number of cells formed by planes that dissect a tetrahedron throug...
AbstractThis paper presents two new results of somewhat different flavors. The first result is a for...
AbstractFor natural families of polytopes determined by substructures (e.g., tours or matchings) of ...
We study arrangements of slightly skewed tropical hyperplanes, called blades by A. Ocneanu, on the v...
AbstractLet a d-simplex be dissected by hyperplanes, each cutting one edge and containing the opposi...
AbstractA topological hyperplane is a subspace of Rn (or a homeomorph of it) that is topologically e...
AbstractLet fk(F) denote the number of k-dimensional faces of a d-dimensional arrangement F of spher...
A toric arrangement is a finite set of hypersurfaces in a complex torus, each hypersurface being the...
AbstractThis paper presents a variety of formulas for the number of cells, faces, and edges, bounded...
This work.develops the foundations of topological graph theory with a unified approach using combin...
AbstractEvery arrangement H of affine hyperplanes in Rd determines a partition of Rd into open topol...
AMS Subject Classication: 05A15, 14H10, 58D29 Abstract. The problem of counting ramied covers of a R...
In this paper we show a a proof by explicit bijections of the famous Kirkman-Cayley formula for the ...
Abstract. The polytope structure of the associahedron is decomposed into two categories, types and c...
AbstractWe compute the generating function for triangulations on a cylinder, with the restriction th...
AbstractA formula for the maximum number of cells formed by planes that dissect a tetrahedron throug...
AbstractThis paper presents two new results of somewhat different flavors. The first result is a for...
AbstractFor natural families of polytopes determined by substructures (e.g., tours or matchings) of ...