Related papers: Heesch Numbers of Unmarked Polyforms

An ordered graph $H$ on $n$ vertices is a graph whose vertices have been labeled bijectively with $\{1,...,n\}$. The ordered Ramsey number $r_<(H)$ is the minimum $n$ such that every two-coloring of the edges of the complete graph $K_n$…

In this paper, we introduce numerical cohomology for arithmetic surfaces, which leads to an absolute version of arithmetic Riemann-Roch formula. As an application, we derive an upper bound for the self-intersection number of relative…

Higher chromatic numbers $\chi_s$ of simplicial complexes naturally generalize the chromatic number $\chi_1$ of a graph. In any fixed dimension $d$, the $s$-chromatic number $\chi_s$ of $d$-complexes can become arbitrarily large for…

Let $G\subset SO(4)$ denote a finite subgroup containing the Heisenberg group. In these notes we classify all these groups, we find the dimension of the spaces of $G$-invariant polynomials and we give equations for the generators whenever…

The collection of reflecting hyperplanes of a finite Coxeter group is called a reflection arrangement and it appears in many subareas of combinatorics and representation theory. We focus on the problem of counting regions of reflection…

The size-Ramsey number of a graph $G$ is the minimum number of edges in a graph $H$ such that every 2-edge-coloring of $H$ yields a monochromatic copy of $G$. Size-Ramsey numbers of graphs have been studied for almost 40 years with…

Flat surfaces that correspond to meromorphic $1$-forms or to meromorphic quadratic differentials containing poles of order two and higher are surfaces of infinite area. We classify groups that appear as Veech groups of translation surfaces…

We associate to a multiple polylogarithm a holomorphic 1-form on the universal abelian cover of its domain. We relate the 1-forms to the symbol and variation matrix and show that the 1-forms naturally define a lift of the variation of mixed…

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

We prove a variation on Heawood list-coloring for graphs on surfaces, modeled on Thomassen's planar 5-list-coloring theorem. For epsilon>0 define the Heawood number to be H(epsilon)=Floor((7+Sqrt[24*epsilon+1])/2). We prove that, except for…

We construct \'etale generalized Heisenberg group covers of hyperelliptic curves over number fields. We use these to produce infinite families of quadratic extensions of cyclotomic fields that admit everywhere unramified generalized…

We produce curves with a record number of points over the finite fields with $4$, $9$, $16$ and $25$ elements, as unramified abelian covers of algebraic curves.

We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…

We compute some numerical invariants of the lines on hyperplane sections of a smooth cubic threefold over complex numbers. We also prove that for any smooth hypersurface $X\subset \mathbb P^{n+1}$ of degree $d$ over an algebraically closed…

We define twelve variants of a Reifenberg's affine approximation property, which are known to be connected with the singular sets of minimal surfaces. With this motivation we investigate the regularity of the sets possessing these. We…

We generalize the classical notion of packing a set by balls with identical radii to the case where the radii may be different. The largest number of such balls that fit inside the set without overlapping is called its {\em non-uniform…

Regular edge-colored graphs encode colored triangulations of pseudo-manifolds. Here we study families of edge-colored graphs built from a finite but arbitrary set of building blocks, which extend the notion of $p$-angulations to arbitrary…

We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…

Ptychography is a technique widely used in microscopy for achieving high-resolution imaging. This method relies on computational processing of images gathered from diffraction patterns produced by several partial illuminations of a sample.…

We consider the problem of computing the nearest matrix polynomial with a non-trivial Smith Normal Form. We show that computing the Smith form of a matrix polynomial is amenable to numeric computation as an optimization problem.…