No abstract uploaded!

Polyhedral combinatorics has been a topic of interest in modern day’s computational geometry. The founding of Steinitz’s Theorem in 1922 revealed consequential relations between graph theory and polyhedral combinatorics. It allows us to better investigate on the topology of convex polyhedrons. In this paper, we proposed an algorithm that generates a unique sequence of points, using the vertices of a triangulated polyhedron, pre-determined by the selection of the starting 3 vertices in the sequence. Following that, we discover an interesting relation between the sequence and the volume of the polyhedron itself, in which we presented in the form of a sufficient condition. To further investigate which polyhedrons generate sequences that satisfy the sufficient condition, we study the problem in the context of graph theory, that is, the explorer walk (corresponding to the sequence of vertices) in maximal planar graphs (skeletons of triangulated convex polyhedrons). With that, we uncovered a family of maximal planar graphs, called the explorer graphs, which exhibits volumetric properties in the polyhedrons constructed from them, in regard to the explorer walk. In this paper, we also introduce generalized methods of constructing explorer graphs of higher order from explorer graphs of lower order, demonstrating the prevalence of explorer graphs. As the edges of a maximal planar graph is of great importance in tracing an explorer walk, we investigate on the line graph of maximal planar graphs, and re-establish a better definition of explorer graphs. Lastly, our paper covers the edge contraction of explorer graphs, which allows us to solve the volume of polyhedrons constructed from non-explorer graphs. For this, we presented a possible bound for the minimum number of edge contractions a non-explorer graph requires from an explorer graph. This will generalize the proposed method of finding volumes to any triangulated convex polyhedron.

We prove that the 2-primary $pi_{61}$ is zero. As a consequence, the Kervaire invariant element $\theta_5$ is contained in the strictly defined 4-fold Toda bracket $\langle 2, \theta_4, \theta_4, 2 \rangle$. Our result has a geometric corollary: the 61-sphere has a unique smooth structure and it is the last odd dimensional case — the only ones are $S^1, S^3, S^5$ and $S^{61}$. Our proof is a computation of homotopy groups of spheres. A major part of this paper is to prove an Adams differential $d_3(D_3) = B_3$. We prove this differential by introducing a new technique based on the algebraic and geometric Kahn-Priddy theorems. The success of this technique suggests a theoretical way to prove Adams differentials in the sphere spectrum inductively by use of differentials in truncated projective spectra.

Symmetry protected topological (SPT) states have boundary 't Hooft anomalies that obstruct an effective boundary theory realized in its own dimension with UV completion and with an on-site $G$-symmetry. In this work, yet we show that a certain anomalous non-on-site $G$ symmetry along the boundary becomes on-site when viewed as an extended $H$ symmetry, via a suitable group extension $1\to K\to H\to G\to1$. Namely, a non-perturbative global (gauge/gravitational) anomaly in $G$ becomes anomaly-free in $H$. This guides us to construct exactly soluble lattice path integral and Hamiltonian of symmetric gapped boundaries, \emph{always existent} for \emph{any} SPT state in any spacetime dimension $d \geq 2$ of \emph{any} finite symmetry group, including on-site unitary and anti-unitary time-reversal symmetries. The resulting symmetric gapped boundary can be described either by an $H$-symmetry extended boundary of bulk $d \geq 2$, or more naturally by a topological {emergent} $K$-gauge theory with a global symmetry $G$ on a 3+1D bulk or above. The excitations on such a symmetric topologically ordered boundary can carry fractional quantum numbers of the symmetry $G$, described by representations of $H$. (Apply our approach to a 1+1D boundary of 2+1D bulk, we find that a deconfined gauge boundary indeed has \emph{spontaneous symmetry breaking} with long-range order. The deconfined symmetry-breaking phase crosses over smoothly to a confined phase without a phase transition.) In contrast to known gapped boundaries/interfaces obtained via \emph{symmetry breaking} (either global symmetry breaking or Anderson-Higgs mechanism for gauge theory), our approach is based on \emph{symmetry extension}. More generally, applying our approach to SPT states, topologically ordered gauge theories and symmetry enriched topologically ordered (SET) states, leads to generic boundaries/interfaces constructed with a mixture of \emph{symmetry breaking}, \emph{symmetry extension}, and \emph{dynamical gauging}.

Let $f(n)$ be the maximum number of edges in a graph on $n$ vertices in which no two cycles have the same length. In 1975, Erdos raised the problem of determining $f(n)$ (see J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Macmillan, New York, 1976), p.247, Problem 11). Given a graph $H$, what is the maximum number of edges of a graph with $n$ vertices not containing $H$ as a subgraph? This number is denoted $ex(n,H)$, and is known as the Turan number. Erdos conjectured that there exists a positive constant $c$ such that $ex(n,C_{2k})\geq cn^{1+1/k}$(see P. Erdos, Some unsolved problems in graph theory and combinatorial analysis, Combinatorial Mathematics and its Applications (Proc. Conf., Oxford, 1969) , pp. 97--109, Academic Press, London, 1971). Haj\'{o}s conjectured that every simple even graph on $n$ vertices can be decomposed into at most $n/2$ cycles (see L. Lovasz, On covering of graphs, in: P. Erdos, G.O.H. Katona (Eds.), Theory of Graphs, Academic Press, New York, 1968, pp. 231 - 236 ). We present the problems, conjectures related to these problems and we summarize the know results.