Related papers: Heesch Numbers of Unmarked Polyforms
We calculate the dimension of the locus of elliptic surfaces over P^1 with a section and a given Picard number, in the corresponding moduli space.
This paper concerns the lattice counting problem for the mapping class group of a surface $S$ acting on Teichm\"uller space with the Teichm\"uller metric. In that problem the goal is to count the number of mapping classes that send a given…
We study the maximum number $ex(n,e,H)$ of copies of a graph $H$ in graphs with given number of vertices and edges. We show that for any fixed graph $H$, $ex(n,e,H)$ is asymptotically realized by the quasi-clique provided that the edge…
This work studies skew polycyclic codes over finite chain rings defined by central trinomials. For this class of codes, we investigate Hamming equivalence in the non-commutative (skew) setting. We introduce an equivalence relation on the…
The slice decomposition is a bijective method for enumerating planar maps (graphs embedded in the sphere) with control over face degrees. In this paper, we extend the slice decomposition to the richer setting of hypermaps, naturally…
We present a unified numerical method to determine the shapes of multiple Hele-Shaw bubbles in steady motion, and in the absence of surface tension, in three planar domains: free space, the upper half-plane, and an infinite channel. Our…
We exhibit a smooth complex rational affine surface with uncountably many nonisomorphic real forms.
Given a set $S \subseteq \mathbb{R}^d$, a hollow polytope has vertices in $S$ but contains no other point of $S$ in its interior. We prove upper and lower bounds on the maximum number of vertices of hollow polytopes whose facets are…
These are the notes for the talk "Hodge numbers of a hypothetical complex structure on $S^6$" given by the author at the MAM1 "(Non)-existence of complex structures on $S^6$" held in Marburg in March 2017. They are based on [A. Gray, A…
Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance…
The enumeration of Hamiltonian cycles on 2n*2n grids of nodes is a longstanding problem in combinatorics. Previous work has concentrated on counting all cycles. The current work enumerates nonisomorphic cycles -- that is, the number of…
If $G$ is a graph and $\mathcal{H}$ is a set of subgraphs of $G$, we say that an edge-coloring of $G$ is $\mathcal{H}$-polychromatic if every graph from $\mathcal{H}$ gets all colors present in $G$ on its edges. The…
In this paper we obtain an explicit formula for the number of hypersurfaces in a compact complex manifold X (passing through the right number of points), that has a simple node, a cusp or a tacnode. The hypersurfaces belong to a linear…
The hat guessing number is a graph invariant based on a hat guessing game introduced by Winkler. Using a new vertex decomposition argument involving an edge density theorem of Erd\H{o}s for hypergraphs, we show that the hat guessing number…
In [BN] the authors construct a special complex of degree 20 over M, which for an open three dimensional set parametrizes smooth complex surfaces of degree four invariant which are Heisenberg invariant and each member of the family contains…
Let $P(n)$ be the set of all posets with $n$ elements. Let $P^{(j)}(n)$, $1\leq j\leq 2^n,$ be the number of all posets with $n$ elements possessing exactly $j$ antichains. We have determined the numbers $P^{(j)}(7),$ $1\leq j\leq 128$, and…
We study infinite superelliptic curves as translation surfaces and explore their Veech groups. These objects are branched covering of the complex plane with branching over infinitely many points. We provide a criterion for isomorphism…
We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number $k \ge 0$ of hamiltonian cycles, which is especially efficient for small $k$. Our main findings, combining applications of this algorithm…
We completely solve the symplectic packing problem with equally sized balls for any rational, ruled, symplectic 4-manifolds. We give explicit formulae for the packing numbers, the generalized Gromov widths, the stability numbers, and the…
The main purpose of this paper is to report on the state of the art of computing integer hulls and their facets as well as counting lattice points in convex polytopes. Using the polymake system we explore various algorithms and…