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

推荐订阅源

Stack Overflow Blog
Stack Overflow Blog
Y
Y Combinator Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
M
MIT News - Artificial intelligence
GbyAI
GbyAI
A
About on SuperTechFans
T
The Blog of Author Tim Ferriss
雷峰网
雷峰网
Blog — PlanetScale
Blog — PlanetScale
J
Java Code Geeks
IT之家
IT之家
Microsoft Azure Blog
Microsoft Azure Blog
V
V2EX
爱范儿
爱范儿
N
Netflix TechBlog - Medium
U
Unit 42
博客园 - 三生石上(FineUI控件)
WordPress大学
WordPress大学
博客园 - 叶小钗
G
Google Developers Blog
Jina AI
Jina AI
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
The GitHub Blog
The GitHub Blog
腾讯CDC

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}}$
Higher algebra of $A_\infty$ and $ΩB As$-algebras in Mors...
Thibaut Mazuir · 2021-02-18 · via math.CO updates on arXiv.org

This paper introduces the notion of $n$-morphisms between two $A_\infty$-algebras, such that 0-morphisms correspond to standard $A_\infty$-morphisms and 1-morphisms correspond to $A_\infty$-homotopies between $A_\infty$-morphisms. The set of higher morphisms between two $A_\infty$-algebras then defines a simplicial set which has the property of being an algebraic $\infty$-category. The operadic structure of $n-A_\infty$-morphisms is also encoded by new families of polytopes, which we call the $n$-multiplihedra and which generalize the standard multiplihedra. These are constructed from the standard simplices and multiplihedra by lifting the Alexander-Whitney map to the level of simplices. Rich combinatorics arise in this context, as conveniently described in terms of overlapping partitions. Shifting from the $A_\infty$ to the $ΩB As$ framework, we define the analogous notion of $n$-morphisms between $ΩB As$-algebras, which are again encoded by the $n$-multiplihedra, endowed with a refined cell decomposition by stable gauged ribbon tree type. We then realize this higher algebra of $A_\infty$ and $ΩB As$-algebras in Morse theory. Given two Morse functions $f$ and $g$, we construct $n-ΩB As$-morphisms between their respective Morse cochain complexes endowed with their $ΩB As$-algebra structures, by counting perturbed Morse gradient trees associated to an admissible simplex of perturbation data. We moreover show that the simplicial set consisting of higher morphisms defined by a count of perturbed Morse gradient trees is a contractible Kan complex.