相关论文: Polyhedral surfaces of high genus

We construct symplectic surface bundles over surfaces with positive signatures for all but 18 possible pairs of fiber and base genera. Meanwhile, we determine the commutator lengths of a few new mapping classes.

A $\textit{regular polygon surface}$ $M$ is a surface graph $(\Sigma, \Gamma)$ together with a continuous map $\psi$ from $\Sigma$ into Euclidean 3-space which maps faces to regular Euclidean polygons. When $\Sigma$ is homeomorphic to the…

Vizing's theorem states that any $n$-vertex $m$-edge graph of maximum degree $\Delta$ can be {\em edge colored} using at most $\Delta + 1$ different colors [Diskret.~Analiz, '64]. Vizing's original proof is algorithmic and shows that such…

We call a projective surface $X$ mixed quasi-\'etale quotient if there exists a curve $C$ of genus $g(C)\geq 2$ and a finite group $G$ that acts on $C\times C$ exchanging the factors such that $X=(C\times C)/G$ and the map $C\times C…

Levels and sublevels in arrangements -- and, dually, $k$-sets and $(\leq k)$-sets -- are fundamental notions in discrete and computational geometry and natural generalizations of convex polytopes, which correspond to the $0$-level. A…

The maximum genus $\gamma_M(G)$ of a graph G is the largest genus of an orientable surface into which G has a cellular embedding. Combinatorially, it coincides with the maximum number of disjoint pairs of adjacent edges of G whose removal…

A sparse version of Mantel's Theorem is that, for sufficiently large $p$, with high probability (w.h.p.), every maximum triangle-free subgraph of $G(n,p)$ is bipartite. DeMarco and Kahn proved this for $p>K \sqrt{\log n/n}$ for some…

Using connections to random matrix theory and orthogonal polynomials, we develop a framework for obtaining explicit closed-form formulae for the number, $\mathscr{N}_{g}(2\nu,j)$, of connected $2\nu$-valent labeled graphs with $j$ vertices…

We prove a completely explicit and effective upper bound for the N\'eron--Tate height of rational points of curves of genus at least $2$ over number fields, provided that they have enough automorphisms with respect to the Mordell--Weil rank…

Graph theory on surfaces extends classical graph structures to topological surfaces, providing a theoretical foundation for characterizing the embedding properties of complex networks in constrained spaces. The study of bounding the…

Finding the common structural features of two molecules is a fundamental task in cheminformatics. Most drugs are small molecules, which can naturally be interpreted as graphs. Hence, the task is formalized as maximum common subgraph…

If the face\mbox{-}cycles at all the vertices in a map are of the same type, then the map is said to be a semi-equivelar map. Automorphism (symmetry) of a map can be thought of as a permutation of the vertices which preserves the…

Surfaces of general type with canonical map of degree d bigger than 8 have bounded geometric genus and irregularity. In particular the irregularity is at most 2 if d>= 10. In the present paper, the existence of surfaces with d=10 and all…

For a graph $G$, a vertex coloring $f$ is called nonrepetitive if for all $k\in\mathbb N$ and all $P_{2k}=\langle v_1, \cdots, v_k,v_{k+1}, \cdots, v_{2k}\rangle$ (path of $2k$ vertices) in $G$, there must be some $1\le i\le k$ such that…

Mantel's theorem is a classical result in extremal graph theory which implies that the maximum number of edges of a triangle-free graph of order $n$. In 1970, E. Nosal obtained a spectral version of Mantel's theorem which gave the maximum…

A convex geometric hypergraph or cgh consists of a family of subsets of a strictly convex set of points in the plane. There are eight pairwise nonisomorphic cgh's consisting of two disjoint triples. These were studied at length by Bra{\ss}…

We call a real algebraic hypersurface in $(\mathbb{C}^*)^n$ simplicial if it is given by a real Laurent polynomial in $n$-variables that has exactly $n+1$ monomials with non-zero coefficients and such that the convex hull in $\mathbb{R}^n$…

The solvable Farb growth of a group quantifies how well-approximated the group is by its finite solvable quotients. In this note we present a new characterization of polycyclic groups which are virtually nilpotent. That is, we show that a…

It was shown in \cite{GL} that the maximal surface area of a convex set in $\mathbb{R}^n$ with respect to a rotation invariant log-concave probability measure $\gamma$ is of order $\frac{\sqrt{n}}{\sqrt[4]{Var|X|} \sqrt{\mathbb{E}|X|}}$,…

In this paper, we construct polynomial growth harmonic maps from once-punctured Riemann surfaces of any finite genus to any even-sided, regular, ideal polygon in the hyperbolic plane. We also establish their uniqueness within a class of…