Related papers: Bialgebraic structures on boolean functions

The generating function that records the sizes of directed circuit partitions of a connected 2-in, 2-out digraph D can be determined from the interlacement graph of D with respect to a directed Euler circuit; the same is true of the…

To a singular knot K with n double points, one can associate a chord diagram with n chords. A chord diagram can also be understood as a 4-regular graph endowed with an oriented Euler circuit. L. Traldi introduced a polynomial invariant for…

Semi-bent Boolean functions are interesting from a cryptographic standpoint, since they possess several desirable properties such as having a low and flat Walsh spectrum, which is useful to resist linear cryptanalysis. In this paper, we…

A notion of branch-width, which generalizes the one known for graphs, can be defined for matroids. We first give a proof of the polynomial time model-checking of monadic second-order formulas on representable matroids of bounded…

Contact Boolean algebras are one of the main algebraic tools in region-based theory of space. T. Ivanova provided strong motivations for the study of merely semilattices with a contact relation. Another significant motivation for…

We define a bivariate polynomial for unlabeled rooted trees and show that the polynomial of an unlabeled rooted tree $T$ is the generating function of a class of subtrees of $T$. We prove that the polynomial is a complete isomorphism…

In the present work, new classes of wavelet functions are presented in the framework of Clifford analysis. Firstly, some classes of new monogenic polynomials are provided based on 2-parameters weight functions. Such classes extend the well…

Given an input graph and weights on its vertices, the maximum co-2-plex problem is to find a subset of vertices maximizing the sum of their weights and inducing a graph of degree at most 1. In this article, we analyze polyhedral aspects of…

This survey provides a comprehensive overview of the study of the binary and Boolean rank from both a mathematical and a computational perspective, with particular emphasis on their relationship to the real rank. We review the basic…

Boolean functions have important applications in cryptography and coding theory. Two famous classes of binary codes derived from Boolean functions are the Reed-Muller codes and Kerdock codes. In the past two decades, a lot of progress on…

We present an expository overview of the monoidal structures in the category of linearly compact vector spaces. Bimonoids in this category are the natural duals of infinite-dimensional bialgebras. We classify the relations on words whose…

We propose a representation of boolean bent functions by bent rectangles, that is, by special matrices with restrictions on rows and columns. Using this representation, we exhibit new classes of bent functions, give an algorithm to…

The problem of implementing a class of functions with particular conditions by using monotonic multilayer functions is considered. A genetic algorithm is used to create monotonic functions of a certain class, and these are implemented with…

We define a counting function that is related to the binomial coefficients. An explicit formula for this function is proved. In some particular cases, simpler explicit formuls are derived. We also derive a formula for the number of…

This paper is devoted to the investigation of harmonic and biharmonic functions on vector bundles equipped with spherically symmetric metrics. We will study the biharmonicity of vertical lifts of functions as well as $r$-radial functions on…

A boolean matrix is blocky if its $1$-entries form a collection of 1-monochromatic submatrices that are disjoint in both rows and columns. Blocky matrices are precisely the set of boolean matrices with $\gamma_2$ factorization norm at most…

Bicritical rational functions -- those with precisely two critical points -- include the well-studied families of unicritical polynomials and quadratic rational functions. In this article we lay out general foundations for studying…

Compounding submodular monotone (i.e. 2-alternating) set functions on a finite set preserves this property, as shown in 2010. A natural generalization to k-alternating functions was presented in 2018, however hardly readable because of page…

We study the class of functions on the set of (generalized) Young diagrams arising as the number of embeddings of bipartite graphs. We give a criterion for checking when such a function is a polynomial function on Young diagrams (in the…

We obtain non-trivial bounds for bilinear sums of trace functions below the P\'olya-Vinogradov range assuming only that the geometric monodromy group of the underlying ell-adic sheaf satisfies certain simple structural properties, in…