Euler Characteristics of Categories and Homotopy Colimits

In a previous article, we introduced notions of finiteness obstruction, Euler characteristic, and L^2-Euler characteristic for wide classes of categories. In this sequel, we prove the compatibility of those notions with homotopy colimits of I-indexed categories where I is any small category admitting a finite I-CW-model for its I-classifying space. Special cases of our Homotopy Colimit Formula include formulas for products, homotopy pushouts, homotopy orbits, and transport groupoids. We also apply our formulas to Haefliger complexes of groups, which extend Bass--Serre graphs of groups to higher dimensions. In particular, we obtain necessary conditions for developability of a finite complex of groups from an action of a finite group on a finite category without loops.Comment: 44 pages. This final version will appear in Documenta Mathematica. Remark 8.23 has been improved, discussion of Grothendieck construction has been slightly expanded at the beginning of Section 3, and a few other minor improvements have been incoporate

Tropical Geometry and the Motivic Nearby Fiber

We construct motivic invariants of a subvariety of an algebraic torus from its tropicalization and initial degenerations. More specifically, we introduce an invariant of a compactification of such a variety called the "tropical motivic nearby fiber." This invariant specializes in the schon case to the Hodge-Deligne polynomial of the limit mixed Hodge structure of a corresponding degeneration. We give purely combinatorial expressions for this Hodge-Deligne polynomial in the cases of schon hypersurfaces and smooth tropical varieties. We also deduce a formula for the Euler characteristic of a general fiber of the degeneration.Comment: 27 pages. Compositio Mathematica, to appea

Finite Boolean Algebras for Solid Geometry using Julia's Sparse Arrays

The goal of this paper is to introduce a new method in computer-aided geometry of solid modeling. We put forth a novel algebraic technique to evaluate any variadic expression between polyhedral d-solids (d = 2, 3) with regularized operators of union, intersection, and difference, i.e., any CSG tree. The result is obtained in three steps: first, by computing an independent set of generators for the d-space partition induced by the input; then, by reducing the solid expression to an equivalent logical formula between Boolean terms made by zeros and ones; and, finally, by evaluating this expression using bitwise operators. This method is implemented in Julia using sparse arrays. The computational evaluation of every possible solid expression, usually denoted as CSG (Constructive Solid Geometry), is reduced to an equivalent logical expression of a finite set algebra over the cells of a space partition, and solved by native bitwise operators.Comment: revised version submitted to Computer-Aided Geometric Desig