English
Related papers

Related papers: Reconstructing a shellable sphere from its facet-r…

200 papers

The subject of this paper are spherically symmetric thin shells made of barotropic ideal fluid and moving under the influence of their own gravitational field as well as that of a central black hole; the cosmological constant is assumed to…

General Relativity and Quantum Cosmology · Physics 2009-10-30 P. Hajicek , Berne

Graph polytopes arising from vertex-weighted graphs were first introduced by B\'ona, Ju, and Yoshida. We prove a conjecture stating that for any simple connected graph, the numerator polynomial of the Ehrhart series of its graph polytope is…

Combinatorics · Mathematics 2026-04-13 Feihu Liu

To a rational homology sphere graph manifold one can associate a weighted tree invariant called splice diagram. It was shown earlier that the splice diagram determines the universal abelian cover of the manifold. We will in this article…

Geometric Topology · Mathematics 2010-11-03 Helge Møller Pedersen

The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…

Combinatorics · Mathematics 2014-02-26 Gareth A. Jones

The antiprism triangulation provides a natural way to subdivide a simplicial complex $\Delta$, similar to barycentric subdivision, which appeared independently in combinatorial algebraic topology and computer science. It can be defined as…

Combinatorics · Mathematics 2021-09-07 Christos A. Athanasiadis , Jan-Marten Brunink , Martina Juhnke-Kubitzke

For each surface besides the sphere, projective plane, and Klein bottle, we construct a face-simple minimal quadrangulation, i.e., a simple quadrangulation on the fewest number of vertices possible, whose dual is also a simple graph. Our…

Combinatorics · Mathematics 2023-05-23 Sarah Abusaif , Warren Singh , Timothy Sun

Frucht showed that, for any finite group $G$, there exists a cubic graph such that its automorphism group is isomorphic to $G$. For groups generated by two elements we simplify his construction to a graph with fewer nodes. In the general…

Group Theory · Mathematics 2023-07-25 Reymond Akpanya , Tom Goertzen

We show that minimally 3-rigid block-and-hole graphs, with one block or one hole, are characterised as those which are constructible from $K_3$ by vertex splitting, and also, as those having associated looped face graphs which are…

Combinatorics · Mathematics 2023-09-14 Bryan Gin-ge Chen , James Cruickshank , Derek Kitson

In this note we show that every discrete polymatroid is $M$-shellable. This gives, in a partial case, a positive answer to a conjecture of Chari and improves a recent result of Schweig where he proved that the $h$-vector of a lattice path…

Combinatorics · Mathematics 2010-12-07 Majid Alizadeh , Afshin Goodarzi , Siamak Yassemi

The connectivity of graphs of simplicial and polytopal complexes is a classical subject going back at least to Steinitz, and the topic has since been studied by many authors, including Balinski, Barnette, Athanasiadis and Bjorner. In this…

Combinatorics · Mathematics 2014-11-12 Karim A. Adiprasito , Afshin Goodarzi , Matteo Varbaro

Let $G=(V,E)$ be a graph. If $G$ is a K\"onig graph or $G$ is a graph without 3-cycles and 5-cycle, we prove that the following conditions are equivalent: $\Delta_{G}$ is pure shellable, $R/I_{\Delta}$ is Cohen-Macaulay, $G$ is unmixed…

Combinatorics · Mathematics 2015-05-04 Iván Dario Castrillón , Roberto Cruz , Enrique Reyes

The independence complex of a chordal graph is known to be shellable due to a result of Van Tuyl and Villarreal. This is equivalent to the fact that cover ideal of a chordal graph has linear quotients. We use this result to obtain recursive…

Commutative Algebra · Mathematics 2020-03-03 Nursel Erey

In this paper, we investigate a relation between finite graphs, simplicial flag complexes and right-angled Coxeter groups, and we provide a class of reconstructible finite graphs. We show that if $\Gamma$ is a finite graph which is the…

Combinatorics · Mathematics 2015-03-17 Tetsuya Hosaka

In geometric, algebraic, and topological combinatorics, the unimodality of combinatorial generating polynomials is frequently studied. Unimodality follows when the polynomial is (real) stable, a property often deduced via the theory of…

Combinatorics · Mathematics 2020-06-26 Max Hlavacek , Liam Solus

In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…

General Mathematics · Mathematics 2007-05-23 Aleksandr Golubchik

A simplicial polytope is combinatorially rigid if its combinatorial structure is determined by its graded Betti numbers which are important invariant coming from combinatorial commutative algebra. We find a necessary condition to be…

Combinatorics · Mathematics 2011-08-30 Suyoung Choi , Jang Soo Kim

The generating functions of the Severi degrees for sufficiently ample line bundles on algebraic surfaces are multiplicative in the topological invariants of the surface and the line bundle. Recently new proofs of this fact were given for…

Algebraic Geometry · Mathematics 2015-11-10 Lothar Göttsche , Benjamin Kikwai

Refining a basic result of Alexander, we show that two flag simplicial complexes are piecewise linearly homeomorphic if and only if they can be connected by a sequence of flag complexes, each obtained from the previous one by either an edge…

Combinatorics · Mathematics 2014-08-08 Frank H. Lutz , Eran Nevo

Let $K[HK_{\Theta}]$ denote the Hecke-Kiselman algebra of a finite oriented graph $\Theta$ over an algebraically closed field $K$. All irreducible representations, and the corresponding maximal ideals of $K[HK_{\Theta}]$, are characterized…

Representation Theory · Mathematics 2021-04-16 Magdalena Wiertel

The Harary reconstruction conjecture states that any graph with more than four edges can be uniquely reconstructed from its set of maximal edge-deleted subgraphs. In 1977, M\"uller verified the conjecture for graphs with $n$ vertices and $n…

Combinatorics · Mathematics 2024-11-06 Anthony E. Pizzimenti , Umarkhon Rakhimov
‹ Prev 1 3 4 5 6 7 10 Next ›