English
Related papers

Related papers: Bialgebraic structures on boolean functions

200 papers

Using the definition of colouring of $2$-edge-coloured graphs derived from $2$-edge-coloured graph homomorphism, we extend the definition of chromatic polynomial to $2$-edge-coloured graphs. We find closed forms for the first three…

Combinatorics · Mathematics 2020-07-28 I. Beaton , D. Cox , C. Duffy , N. Zolkavich

A class of parametric functions formed by alternating compositions of multivariate polynomials and rectification style monomial maps is studied (the layer-wise exponents are treated as fixed hyperparameters and are not optimized). For this…

Optimization and Control · Mathematics 2026-02-13 Shravan Mohan

We define the Cayley graph and its growth function for multivalued groups. We prove that if we change a finite set of generators of multivalued group, or change the starting point, we get an equivalent growth function. We prove that if we…

Group Theory · Mathematics 2025-05-27 Valeriy G. Bardakov , Tatyana A. Kozlovskaya , Matvei N. Zonov

We study different algebraic structures associated to an operad and their relations: to any operad $\mathbf{P}$ is attached a bialgebra,the monoid of characters of this bialgebra, the underlying pre-Lie algebra and its enveloping algebra;…

Rings and Algebras · Mathematics 2017-02-20 Loïc Foissy

We study the (so-called bilinear) factorization problem answered by a weak wreath product (of monads and, more specifically, of algebras over a commutative ring) in the works by Street and by Caenepeel and De Groot. A bilinear factorization…

Rings and Algebras · Mathematics 2013-07-18 Gabriella Böhm , José Gómez-Torrecillas

A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are "compatible". Bialgebras are normally studied over a field or commutative ring. In this paper, we show how to…

Rings and Algebras · Mathematics 2009-10-30 James Worthington

We introduce a new matroid (graph) invariant, the arboricity polynomial. Given a matroid, the arboricity polynomial enumerates the number of covers of the ground set by disjoint independent sets. We establish the polynomiality of the…

Combinatorics · Mathematics 2025-05-09 Felix Breuer , Caroline J Klivans

Usually a name of the category is inherited from the name of objects. However more relevant for a category of objects and morphisms is an algebra of morphisms. Therefore we prefer to say a category of graphs if every morphism is a graph. In…

Logic · Mathematics 2011-03-29 Maria Ernestina Chavez Rodriguez , Zbigniew Oziewicz

Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…

Combinatorics · Mathematics 2024-09-06 Bernat Bassols-Cornudella , Francesco Viganò

We study the notion of duality in the context of graded manifolds. For graded bundles, somehow like in the case of Gelfand representation and the duality: points vs. functions, we obtain natural dual objects which belongs to a different…

Differential Geometry · Mathematics 2017-08-30 Janusz Grabowski , Michał Jóźwikowski , Mikołaj Rotkiewicz

We here give polynomial realizations of various Hopf algebras or bialgebras on Feynman graphs, graphs, posets or quasi-posets, that it to say injections of these objects into polynomial algebras generated by an alphabet. The alphabet here…

Rings and Algebras · Mathematics 2019-05-27 Loïc Foissy

Given a double vector bundle $D\to M$, we define a bigraded `Weil algebra' $\mathcal{W}(D)$, which `realizes' the algebra of smooth functions on the supermanifold $D[1,1]$. We describe in detail the relations between the Weil algebras of…

Differential Geometry · Mathematics 2024-11-28 Eckhard Meinrenken , Jeffrey Pike

We give explicit formulas for maps in a long exact sequence connecting bialgebra cohomology to Hochschild cohomology. We give a sufficient condition for the connecting homomorphism to be surjective. We apply these results to compute all…

Rings and Algebras · Mathematics 2008-05-12 Mitja Mastnak , Sarah Witherspoon

We generalize theories of graph, matroid, and ribbon-graph activities to delta-matroids. As a result, we obtain an activities based feasible-set expansion for a transition polynomial of delta-matroids defined by Brijder and Hoogeboom. This…

Combinatorics · Mathematics 2017-10-31 Ada Morse

We introduce bimonads in a 2-category $\K$ and define biwreaths as bimonads in the 2-category $\bEM(\K)$ of bimonads, in the analogous fashion as Lack and Street defined wreaths. A biwreath is then a system containing a wreath, a cowreath…

Quantum Algebra · Mathematics 2017-08-11 Bojana Femić

Many recursive functions can be defined elegantly as the unique homomorphisms, between two algebras, two coalgebras, or one each, that are induced by some universal property of a distinguished structure. Besides the well-known applications…

Logic in Computer Science · Computer Science 2015-06-25 Baltasar Trancón y Widemann , Michael Hauhs

We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study important problems concerning Boolean…

Computational Complexity · Computer Science 2025-04-01 Stepan Margaryan

We define two coproducts for cycle-free oriented graphs, thus building up two commutative con- nected graded Hopf algebras, such that one is a comodule-coalgebra on the other, thus generalizing the result obtained previously for Hopf…

Combinatorics · Mathematics 2011-07-05 Dominique Manchon

The ring of symmetric functions $\Lambda$, with natural basis given by the Schur functions, arise in many different areas of mathematics. For example, as the cohomology ring of the grassmanian, and as the representation ring of the…

Combinatorics · Mathematics 2009-09-03 Robin Langer

A {\em connectivity function} on a set $E$ is a function $\lambda:2^E\rightarrow \mathbb R$ such that $\lambda(\emptyset)=0$, that $\lambda(X)=\lambda(E-X)$ for all $X\subseteq E$, and that $\lambda(X\cap Y)+\lambda(X\cup Y)\leq…

Combinatorics · Mathematics 2020-07-10 Nathan Bowler , Susan Jowett