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

推荐订阅源

Microsoft Azure Blog
Microsoft Azure Blog
宝玉的分享
宝玉的分享
博客园 - 【当耐特】
有赞技术团队
有赞技术团队
G
Google Developers Blog
Microsoft Security Blog
Microsoft Security Blog
Apple Machine Learning Research
Apple Machine Learning Research
The Cloudflare Blog
Blog — PlanetScale
Blog — PlanetScale
博客园_首页
L
LangChain Blog
Stack Overflow Blog
Stack Overflow Blog
Last Week in AI
Last Week in AI
Y
Y Combinator Blog
罗磊的独立博客
T
Tailwind CSS Blog
博客园 - 叶小钗
T
The Blog of Author Tim Ferriss
Engineering at Meta
Engineering at Meta
博客园 - 聂微东
博客园 - Franky
B
Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
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}}$
Contractions and extractions on twisted bialgebras and co...
2023-01-23 · via math.CO updates on arXiv.org

We introduce a notion of extraction-contraction coproduct on twisted bialgebras, that is to say bialgebras in the category of linear species. If $P$ is a twisted bialgebra, a contraction-extraction coproduct sends $P[X]$ to $P[X/\sim]\otimes P[X]$ for any finite set $X$ and any equivalence relation $\sim$ on $X$, with a coassociativity constraint and compatibilities with the product and coproduct of $P$. We prove that if $P$ is a twisted bialgebra with an extraction-contraction coproduct, then $P\circ Com$ is a bialgebra in the category of coalgebraic species, that is to say species in the category of coalgebras.We then introduce a coloured version of the bosonic Fock functor. This induces a bifunctor which associates to any bialgebra $(V,\cdot,δ_V)$ and to any twisted bialgebra $P$ with an extraction-contraction coproduct a comodule-bialgebra $F_V[P]$: this object inherits a product $m$ and two coproducts $Δ$ and $δ$, such that $(F_V[P],m,Δ)$ is a bialgebra in the category of right $(F_V[P],m,δ)$-comodules.As an example, this is applied to the twisted bialgebra of graphs. The coloured Fock functors then allow to extend the construction of the double bialgebra of graphs to double bialgebras of graphs which vertices are decorated by elements of any bialgebra $V$. Other examples (on mixed graphs, hypergraphs, noncrossing partitions...) will be given in a series of forthcoming papers.