Related papers: Bialgebraic structures on boolean functions

Polynomial functors are a categorical generalization of the usual notion of polynomial, which has found many applications in higher categories and type theory: those are generated by polynomials consisting a set of monomials built from sets…

In this paper, we firstly give the definition of meromorphic function element and algebroid mapping. We also construct the algebroid function family in which the arithmetic, differential operations is closed. On basis of these works, we…

The concept and the construction of modular graph functions are generalized from genus-one to higher genus surfaces. The integrand of the four-graviton superstring amplitude at genus-two provides a generating function for a special class of…

We study the space of functions computed by random-layered machines, including deep neural networks and Boolean circuits. Investigating the distribution of Boolean functions computed on the recurrent and layer-dependent architectures, we…

We study the fine-grained complexity of evaluating Boolean Conjunctive Queries and their generalization to sum-of-product problems over an arbitrary semiring. For these problems, we present a general semiring-oblivious reduction from the…

(Co)bordisms of manifolds and maps are fundamental and important objects in algebraic and differential topology of manifolds and related studies were started by Thom etc.. Cobordisms of Morse functions were introduced and have been studied…

Multiplier bimonoids (or bialgebras) in arbitrary braided monoidal categories are defined. They are shown to possess monoidal categories of comodules and modules. These facts are explained by the structures carried by their induced…

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…

It is well-known that the tensor product of two bialgebras constitutes the binary product in the category of cocommutative bialgebras and morphisms of bialgebras between them. In this paper, we extend this result to triangular bialgebras…

We study the structure of two cointeracting bialgebras on noncrossing partitions appearing in the theory of free probability. The first coproduct is given by separation of the blocks of the partitions into two parts, with respect to the…

We associate to a bimonoidal functor, i.e. a bifunctor which is monoidal in each variable, a nonabelian version of a biextension. We show that such a biextension satisfies additional triviality conditions which make it a bilinear analog of…

A new isomorphism invariant of matroids is introduced, in the form of a quasisymmetric function. This invariant (1) defines a Hopf morphism from the Hopf algebra of matroids to the quasisymmetric functions, which is surjective if one uses…

The phenomena that cause a value of a polynomial function to be a bifurcation one are yet to be described when the fibers have dimension higher than $1$. In this note, the main result is the construction of a polynomial submersion function…

Logical models have been successfully used to describe regulatory and signaling networks without requiring quantitative data. However, existing data is insufficient to adequately define a unique model, rendering the parametrization of a…

We discuss functions from edges and vertices of an undirected graph to an Abelian group. Such functions, when the sum of their values along any cycle is zero, are called balanced labelings. The set of balanced labelings forms an Abelian…

The hypergraph transversal problem has been intensively studied, from both a theoretical and a practical point of view. In particular , its incremental complexity is known to be quasi-polynomial in general and polynomial for bounded…

We compare two classes of functions arising from genus-one superstring amplitudes: modular and holomorphic graph functions. We focus on their analytic properties, we recall the known asymptotic behaviour of modular graph functions and we…

Consider the representations of an algebraic group G. In general, polynomial invariant functions may fail to separate orbits. The invariant subring may not be finitely generated, or the number and complexity of the generators may grow…

Hypergraphs provide a natural way to represent polyadic relationships in network data. For large hypergraphs, it is often difficult to visually detect structures within the data. Recently, a scalable polygon-based visualization approach was…

This paper focuses on the study of certain classes of Boolean functions that have appeared in several different contexts. Nested canalyzing functions have been studied recently in the context of Boolean network models of gene regulatory…