Related papers: Integer points enumerator of hypergraphic polytope…
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…
We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…
Given a function $f$ in a finite field ${\mathbb F}_q$ of $q$ elements, we define the functional graph of $f$ as a directed graph on $q$ nodes labelled by the elements of ${\mathbb F}_q$ where there is an edge from $u$ to $v$ if and only if…
We introduce the characteristic numbers and the chromatic polynomial of a tensor. Our approach generalizes and unifies the chromatic polynomial of a graph and of a matroid, characteristic numbers of quadrics in Schubert calculus, Betti…
We define two actions of the infinite symmetric group on the set of words on positive integers, called the free and parking quasi-symmetrizing actions, whose invariants are respectively the elements of the Hopf algebras $\textbf{FQSym}^*$…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
Constellations and hypermaps generalize combinatorial maps, i.e. embedding of graphs in a surface, in terms of factorization of permutations. In this paper, we extend a result of Jackson and Visentin (1990) stating an enumerative relation…
We construct an explicit Hopf algebra isomorphism from the algebra of heap-ordered trees to that of quasi-symmetric functions, generated by formal permutations, which is a lift of the natural projection of the Connes-Kreimer algebra of…
The symmetric interaction combinators are an equally expressive variant of Lafont's interaction combinators. They are a graph-rewriting model of deterministic computation. We define two notions of observational equivalence for them,…
Given a real closed polytope $P$, we first describe the Fourier transform of its indicator function by using iterations of Stokes' theorem. We then use the ensuing Fourier transform formulations, together with the Poisson summation formula,…
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…
We introduce the partition function of edge-colored graph homomorphisms, of which the usual partition function of graph homomorphisms is a specialization, and present an efficient algorithm to approximate it in a certain domain. Corollaries…
We make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. This provides a universal method for…
Combinatorial Hopf algebras of trees exemplify the connections between operads and bialgebras. Painted trees were introduced recently as examples of how graded Hopf operads can bequeath Hopf structures upon compositions of coalgebras. We…
We show that one can enumerate the vertices of the convex hull of integer points in polytopes whose constraint matrices have bounded and nonzero subdeterminants, in time polynomial in the dimension and encoding size of the polytope. This…
The natural Hopf algebra $\mathbf{N} \cdot \mathcal{O}$ of an operad $\mathcal{O}$ is a Hopf algebra whose bases are indexed by some words on $\mathcal{O}$. We construct polynomial realizations of $\mathbf{N} \cdot \mathcal{O}$ by using…
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…
We compute higher Frobenius-Schur indicators of pq-dimensional pointed Hopf algebras in characteristic p through their associated graded Hopf algebras. These indicators are gauge invariants for the monoidal categories of representations of…
Examples by Poletsky and the author and by Zwonek show the existence nowhere extendable holomorphic functions with the property that the pluripolar hull of their graphs is much larger than the graph of the respective functions and contains…
By utilizing the idea of Colombeau's generalized function, we introduce a notion of asymptotic map between arbitrary diffeological spaces. The category consisting of diffeological spaces and asymptotic maps is enriched over the category of…