惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Last Week in AI
Last Week in AI
U
Unit 42
博客园 - 【当耐特】
Y
Y Combinator Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Microsoft Security Blog
Microsoft Security Blog
Recent Announcements
Recent Announcements
P
Proofpoint News Feed
Martin Fowler
Martin Fowler
量子位
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
有赞技术团队
有赞技术团队
aimingoo的专栏
aimingoo的专栏
博客园 - 司徒正美
美团技术团队
雷峰网
雷峰网
小众软件
小众软件
G
Google Developers Blog
GbyAI
GbyAI
Jina AI
Jina AI
爱范儿
爱范儿
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
F
Fortinet All Blogs
Vercel News
Vercel News

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Semi-equivelar gems of PL $d$-manifolds
Biplab Basak, Manisha Binjola · 2022-07-05 · via math.CO updates on arXiv.org

We define the notion of $(p_0,p_1,\dots,p_d)$-type semi-equivelar gems for closed connected PL $d$-manifolds, related to the regular embedding of gems $Γ$ representing $M$ on a surface $S$ such that the face-cycles at all the vertices of $Γ$ on $S$ are of the same type. The term is inspired by semi-equivelar maps of surfaces. Given a surface $S$ having non-negative Euler characteristic, we find all regular embedding types on $S$ and then construct a genus-minimal semi-equivelar gem (if it exists) of each such type embedded on $S$. Moreover, we present constructions of the following semi-equivelar gems: (1) For each closed connected surface $S$, we construct a genus-minimal semi-equivelar gem that represents $S$. In particular, for $S=\#_n (\mathbb{S}^1 \times \mathbb{S}^1)$ (resp., $\#_n(\mathbb{RP}^2)$), the semi-equivelar gem of type $((4n+2)^3)$ (resp., $((2n+2)^3)$) is constructed. (2) For a closed connected orientable PL $d$-manifold $M$ (where $d \geq 3$) of regular genus at most $1$, we show that $M$ admits a genus-minimal semi-equivelar gem if and only if $M$ is a lens space. Moreover, if we consider semi-equivelar gems with $2$-gons then for a closed connected orientable $d$-manifold $M$ (where $d \geq 3$) with $\mathcal{G}(M)\leq 1$, $M$ admits a genus-minimal semi-equivelar gem (with bigons).