Related papers: The number of small covers over cubes

We prove a new lower bound for the almost 20 year old problem of determining the smallest possible size of an essential cover of the $n$-dimensional hypercube $\{\pm 1\}^n$, i.e. the smallest possible size of a collection of hyperplanes…

We show that the identity component of the group of diffeomorphisms of a closed oriented surface of positive genus admits many unbounded quasi-morphisms. As a corollary, we also deduce that this group is not uniformly perfect and its…

Let $X$ be a minimal cubic surface over a finite field $\mathbb{F}_q$. The image $\Gamma$ of the Galois group $\operatorname{Gal}(\overline{\mathbb{F}}_q / \mathbb{F}_q)$ in the group $\operatorname{Aut}(\operatorname{Pic}(\overline{X}))$…

The singular cubical homology theory for the category of quivers or digraphs can be constructed similarly to the classical singular homology theory for topological spaces. The case of digraphs and quivers differs from the topological case…

Given a drawing of a graph, its \emph{visual complexity} is defined as the number of geometrical entities in the drawing, for example, the number of segments in a straight-line drawing or the number of arcs in a circular-arc drawing (in…

The problem of classifying equivalence classes of presentations up to isomorphism of Cayley graphs is considered in this article in the case of dicyclic groups. The number of equivalence classes of presentations is uniformly bounded - it is…

We show that any $3$-connected cubic plane graph on $n$ vertices, with all faces of size at most $6$, can be made bipartite by deleting no more than $\sqrt{(p+3t)n/5}$ edges, where $p$ and $t$ are the numbers of pentagonal and triangular…

The number of topologies and non-homeomorphic topologies on a fixed finite set are now known up to $n=18$, $n=16$ but still no complete formula yet (Sloane). There are one to one correspondence among topologies, preorder and digraphs. In…

In recent work by Dani and Mainkar, a family of finite simple graphs was used to construct nilmanifolds admitting Anosov diffeomorphisms. Our main object of study is this particular set of graphs, which we call Anosov graphs. Moreover, Dani…

We examine packing of $n$ congruent spheres in a cube when $n$ is close but less than the number of spheres in a regular cubic close-packed (ccp) arrangement of $\lceil p^{3}/2\rceil$ spheres. For this family of packings, the previous…

In this paper we discuss a result similar to the polynomial version of the Alon-F\"uredi theorem. We prove that if you want to cover the vertices of the $n$-dimensional unit cube, except those of weight at most $r$ then you need an…

Let $D_{n,\gamma}$ be the complex of graphs on $n$ vertices and domination number at least $\gamma$. We prove that $D_{n,n-2}$ has the homotopy type of a finite wedge of 2-spheres. This is done by using discrete Morse theory techniques.…

We study mapping class group orbits of homotopy and isotopy classes of curves with self-intersections. We exhibit the asymptotics of the number of such orbits of curves with a bounded number of self-intersections, as the complexity of the…

We determine the number of cusps of minimal Picard modular surfaces. The proof also counts cusps of other Picard modular surfaces of arithmetic interest. Consequently, for each N > 0 there are finitely many commensurability classes of…

A connected graph of order $n$ admitting a semiregular automorphism of order $n/k$ is called a $k$-multicirculant. Highly symmetric multicirculants of small valency have been extensively studied, and several classification results exist for…

We initiate a study of the vertex clique covering numbers of Johnson graphs $J(N, k)$, the smallest numbers of cliques necessary to cover the vertices of those graphs. We prove identities for the values of these numbers when $k \leq 3$, and…

We show that every ridge unfolding of an $n$-cube is without self-overlap, yielding a valid net. The results are obtained by developing machinery that translates cube unfolding into combinatorial frameworks. Moreover, the geometry of the…

We give an asymptotic formula for the minimum number of edges contained in triangles in a graph having n vertices and e edges. Our main tool is a generalization of Zykov's symmetrization method that can be applied for several graphs…

Hadwiger's covering conjecture is that every $n$-dimensional convex body can be covered by at most $2^n$ of its smaller positive homothetic copies, with $2^n$ copies required only for affine images of $n$-cube. Convex hull of a ball and an…

We assign real numbers to finite sheeted coverings of compact CW complexes designed as finite counterparts to the Novikov-Shubin numbers. We prove an approximation theorem in the case of virtually cyclic fundamental groups employing methods…