Related papers: Heesch Numbers of Unmarked Polyforms
In this paper, we study the number of compact sets needed in an infinite family of convex sets with a local intersection structure to imply a bound on its piercing number, answering a conjecture of Erd\H{o}s and Gr\"unbaum. Namely, if in an…
We use basic tools of descriptive set theory to prove that a closed set $\mathcal S$ of marked groups has $2^{\aleph_0}$ quasi-isometry classes provided every non-empty open subset of $\mathcal S$ contains at least two non-quasi-isometric…
We lift the Lefschetz number from an algebraic invariant of maps between spaces to an invariant of morphisms of data over the spaces.
Polypolyhedra are edge-transitive compounds of polyhedra. In this paper we use group theory to determine the number of distinct polypolyhedra whose symmetry group is any given finite irreducible Coxeter group. We apply this result in order…
Twisted Lefschetz numbers are extensions of the ordinary Lefschetz numbers for cohomologies with values in flat bundles. As a generalization of linearization formula for the ordinary Lefschetz number of a self-map of a nilmanifold, we show…
An ellipsoid is the image of a ball under an affine transformation. If this affine transformation is over the complex numbers, we refer to it as a complex ellipsoid. Characterizations of real ellipsoids have received much attention over the…
We investigate the set of partial partitions of a finite set, ordered by inclusion. With this ordering the set of partial partitions can be studied as an abstract simplicial complex. We use the theory of shellable nonpure complexes to find…
This paper presents analogous results of Hua [7][8] on numbers of representations of quivers over finite fields which respect nilpotent relations under certain assumptions. A closed formula which counts isomorphism classes of absolutely…
Polyominoes are a subset of polygons which can be constructed from integer-length squares fused at their edges. A system of polygons P is interlocked if no subset of the polygons in P can be removed arbitrarily far away from the rest. It is…
We present a method for computing the number of epimorphisms from a finitely-presented group G to a finite solvable group \Gamma, which generalizes a formula of G\"aschutz. Key to this approach are the degree 1 and 2 cohomology groups of G,…
The main result of this paper is the following. Given countably many multivariate polynomials with rational coefficients and maximum degree $d$, we construct a compact set $E\subset \R^n$ of Hausdorff dimension $n/d$ which does not contain…
We compute the sheaf homology of the intersection lattice of a hyperplane arrangement with coefficients in the graded exterior sheaf of the natural sheaf. This builds on the results of our previous paper, where this homology was computed…
We compute Hochschild cohomology of projective hypersurfaces starting from the Gerstenhaber-Schack complex of the (restricted) structure sheaf. We are particularly interested in the second cohomology group and its relation with…
We analyze polyhedra composed of hexagons and triangles with three faces around each vertex, and their 3-regular planar graphs of edges and vertices, which we call "trihexes". Trihexes are analogous to fullerenes, which are 3-regular planar…
We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…
We present the concept of the \emph{information efficiency of functions} as a technique to understand the interaction between information and computation. Based on these results we identify a new class of objects that we call…
We extend a recent construction concerning polychromatic colorings of hereditary hypergraph families. For every integer $h\ge 4$ we construct a $(2h-1)$-uniform hypergraph which has no polychromatic $3$-coloring, but all of whose $h$-heavy…
We provide an algorithm to determine the Heegaard genus of simple 3-manifolds with non-empty boundary. More generally, we supply an algorithm to determine (up to ambient isotopy) all the Heegaard splittings of any given genus for the…
In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…
We generalize the lemmas of Thomas Kretschmer to arbitrary number fields, and apply them with a 2-descent argument to obtain bounds for families of elliptic curves over certain imaginary quadratic number fields with class number 1. One such…