The rank-width is a graph parameter related in terms of fixed functions to clique-width but
more tractable. Clique-width has nice algorithmic properties, but no good “minor” relation is …

A classical problem of digital sequence design, first studied in the 1950s but still not well
understood, is to determine those binary sequences whose aperiodic autocorrelations are …

Generalizations of the bent property of a Boolean function are presented, by proposing
spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic …

We establish a connection between the algebraic geometry of the type BB permutohedral
toric variety and the combinatorics of delta‐matroids. Using this connection, we compute the …

We survey a variety of graph polynomials, giving a brief overview of techniques for defining
a graph polynomial and then for decoding the combinatorial information it contains. These …

We define rank-width of graphs to investigate clique-width. Rank-width is a complexity
measure of decomposing a graph in a kind of tree-structure, called a rank-decomposition …

We provide a unified framework in which the interlace polynomial and several related graph
polynomials are defined more generally for multimatroids and delta-matroids. Using …

We discuss the complexity of computing various graph polynomials of graphs of fixed clique-
width. We show that the chromatic polynomial, the matching polynomial and the two-variable …

We introduce a new graph polynomial in two variables. This``interlace''polynomial can be
computed in two very different ways. The first is an expansion analogous to the state space …

Delta-matroids are “type B” generalizations of matroids in the same way that maximal
orthogonal Grassmannians are generalizations of Grassmannians. A delta-matroid …