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

推荐订阅源

Jina AI
Jina AI
大猫的无限游戏
大猫的无限游戏
Microsoft Security Blog
Microsoft Security Blog
C
Check Point Blog
云风的 BLOG
云风的 BLOG
J
Java Code Geeks
阮一峰的网络日志
阮一峰的网络日志
MongoDB | Blog
MongoDB | Blog
Engineering at Meta
Engineering at Meta
H
Help Net Security
Microsoft Azure Blog
Microsoft Azure Blog
Recent Announcements
Recent Announcements
Google DeepMind News
Google DeepMind News
F
Fortinet All Blogs
宝玉的分享
宝玉的分享
H
Hackread – Cybersecurity News, Data Breaches, AI and More
腾讯CDC
A
About on SuperTechFans
酷 壳 – CoolShell
酷 壳 – CoolShell
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
S
SegmentFault 最新的问题
Vercel News
Vercel News
aimingoo的专栏
aimingoo的专栏
B
Blog RSS Feed

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}}$
Embeddings of edge-colored dual graphs of balanced 3- and...
Biplab Basak, Sourav Sarkar · 2025-03-08 · via math.CO updates on arXiv.org

This article focuses on a class of properly edge-colored graphs, which arise from topological combinatorics, and investigates their embeddings onto surfaces. Specifically, these graphs are known as the dual graphs of balanced normal pseudomanifolds. We introduce the concept of the balanced genus, which represents the smallest genus of a surface onto which the dual graph of a normal pseudomanifold can embed regularly. As a key result, we establish that for any 3-manifold $ M $ that is not a sphere, the balanced genus satisfies the lower bound $ \mathcal{G}_M \geq m+3 $, where $ m $ is the rank of its fundamental group of $M$. Furthermore, we prove that a 3-manifold $ M $ is homeomorphic to the 3-sphere if and only if its balanced genus $ \mathcal{G}_M $ is at most 3. Similarly, for 4-manifolds, we establish that if $ M $ is not homeomorphic to a sphere, then its balanced genus is bounded below by $ \mathcal{G}_M \geq 2χ(M) + 5m + 11 $. Moreover, a 4-manifold $ M $ is PL homeomorphic to the 4-sphere if and only if its balanced genus satisfies $ \mathcal{G}_M \leq 2χ(M) + 10 $. We believe that the balanced genus offers a new perspective in graph theory and combinatorics and will inspire further developments in the field in connection with algebraic combinatorics. To this end, we outline several directions for future research.