Related papers: A new view of hypercube genus

The double torus provides a relativistic model for a closed 2D cosmos with topology of genus 2 and constant negative curvature. Its unfolding into an octagon extends to an octagonal tessellation of its universal covering, the hyperbolic…

This paper views the honeycomb conjecture and the Kepler problem essentially as extreme value problems and solves them by partitioning 2-space and 3-space into building blocks and determining those blocks that have the universal extreme…

This work arose from efforts to generalise the usual cubical boundary by using different 'weights' for opposite faces, but still to obtain a chain complex, and this method was found to generalise. We describe a variant of the classical…

Let $Q_n = \{0, 1\}^n$ be a hypercube graph. The initial segment $I_k \subseteq Q_n$ is the subset consisting of the first $k$ vertices of $Q_n$ in the binary order. A pair of integers $(a, b) \in \mathbb{Z}_{>0}^2$ is said to be fit if,…

Since its formulation, Tur\'an's hypergraph problems have been among the most challenging open problems in extremal combinatorics. One of them is the following: given a $3$-uniform hypergraph $\mathcal{F}$ on $n$ vertices in which any five…

We show that for each $k\geq 4$ and $n>r\geq k+1$, every $n$-vertex $r$-uniform hypergraph with no Berge cycle of length at least $k$ has at most $\frac{(k-1)(n-1)}{r}$ edges. The bound is exact, and we describe the extremal hypergraphs.…

We study minimum degree conditions for which a graph with given odd girth has a simple structure. For example, the classical work of Andr\'asfai, Erd\H os, and S\'os implies that every $n$-vertex graph with odd girth $2k+1$ and minimum…

We exploit three classical characterizations of smooth genus two curves to study their tropical and analytic counterparts. First, we provide a combinatorial rule to determine the dual graph of each algebraic curve and the metric structure…

We develop some tools, of an algebraic and combinatorial nature, which enable us to obtain a detailed description of certain quadratic subgroups of the (outer) reduced Weyl group of the Cuntz algebra ${\mathcal O}_n$. In particular, for…

In this note, we prove several Tur\'an-type results on geometric hypergraphs. The two main theorems are 1) Every $n$-vertex geometric 3-hypergraph in 2-space with no three strongly crossing edges has at most $O(n^2)$ edges, 2) Every…

We give a new proof of the theorem of Birman-Powell that the Torelli subgroup of the mapping class group of a closed orientable surface of genus at least 3 is generated by simple homeomorphisms known as bounding pair maps. The key…

We prove that every cyclically 4-edge-connected cubic graph that can be embedded in the torus, with the exceptional graph class called "Petersen-like", is 3-edge-colorable. This means every (non-trivial) toroidal snark can be obtained from…

The Tur\'an hypergraph problem asks to find the maximum number of $r$-edges in a $r$-uniform hypergraph on $n$ vertices that does not contain a clique of size $a$. When $r=2$, i.e., for graphs, the answer is well-known and can be found in…

Let $G$ be a plane elementary bipartite graph whose infinite face is forcing. We provide a bijection between the set of maximal hypercubes of its resonance graph and the set of maximal resonant sets of $G$, which generalizes a main result…

Luo and Tan gave a new identity for hyperbolic surfaces with/without geodesic boundary in terms of dilogarithms of the lengths of simple closed geodesics on embedded three-holed spheres or one-holed tori. However, the identity was trivial…

A number of years ago, Kumar Murty pointed out to me that the computation of the fundamental group of a Hilbert modular surface ([7],IV,${\S}$6), and the computation of the congruence subgroup kernel of SL(2) ([6]) were surprisingly…

Loebl, Koml\'os and S\'os conjectured that every $n$-vertex graph $G$ with at least $n/2$ vertices of degree at least $k$ contains each tree $T$ of order $k+1$ as a subgraph. We give a sketch of a proof of the approximate version of this…

In this paper, a complete classification of finite simple cubic vertex-transitive graphs of girth $6$ is obtained. It is proved that every such graph, with the exception of the Desargues graph on $20$ vertices, is either a skeleton of a…

A Hamiltonian embedding is an embedding of a graph $G$ such that the boundary of each face is a Hamiltonian cycle of $G$. It is shown that the hypercube graph $Q_n$ admits such an embedding on an orientable surface when $n$ is a power of 2.…

We study random 2-dimensional complexes in the Linial - Meshulam model and find torsion in their fundamental groups at various regimes. We find a simple algorithmically testable criterion for a subcomplex of a random 2-complex to be…