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

推荐订阅源

T
The Blog of Author Tim Ferriss
IT之家
IT之家
Engineering at Meta
Engineering at Meta
WordPress大学
WordPress大学
博客园 - 三生石上(FineUI控件)
博客园 - 聂微东
C
Check Point Blog
T
Tailwind CSS Blog
博客园 - Franky
H
Help Net Security
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Google DeepMind News
Google DeepMind News
博客园 - 叶小钗
J
Java Code Geeks
腾讯CDC
罗磊的独立博客
爱范儿
爱范儿
阮一峰的网络日志
阮一峰的网络日志
Martin Fowler
Martin Fowler
酷 壳 – CoolShell
酷 壳 – CoolShell
I
InfoQ
B
Blog
V
Visual Studio Blog
F
Fortinet All Blogs

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}}$
Facial nested complexes and acyclonestohedra
Chiara Mantovani, Arnau Padrol, Vincent Pilaud · 2025-09-19 · via math.CO updates on arXiv.org

We study nested complexes of building sets on the Las Vergnas face lattices of oriented matroids. Such a nested complex is the face lattice of an oriented matroid, obtained by iterated stellar subdivisions of the positive tope. If the oriented matroid is realizable, the nested complex is isomorphic to the boundary complex of a polytope. We turn this into an explicit and combinatorially meaningful polytopal realization. We prove that the facial nested complex can be embedded as the acyclic subcomplex of the nested complex of a well-chosen boolean building set. In the realizable case, we show that this acyclic subcomplex can be geometrically selected as the section of a nestohedron by the evaluation space of the vector configuration, which we call acyclonestohedron. Our framework generalizes the poset associahedra recently introduced by P. Galashin, from order polytopes to any polytope. Poset associahedra are the graphical acyclonestohedra, and our approach recovers as particular cases the main results of P. Galashin and answers some of his open questions. Besides poset associahedra, our framework unifies various other existing families of nested-like polytopes, such as the simple polytope nestohedra, the hyperoctahedral nestohedra, the design graph associahedra and the permutopermutohedra, to which our palette of results can be directly applied. The core of our construction is the embedding of the facial nested complex inside a boolean nested complex. More generally, we provide conditions that guarantee an embedding between nested complexes over two lattices. For instance, any atomic nested complex has a canonical embedding inside a boolean nested complex. As another application, we embed nested complexes over lattices of faces into nested complexes over lattices of flats, recovering as a particular case, the embedding of the positive Bergman complex into the Bergman complex.