Related papers: A quasisymmetric function for matroids
We analyze the structure of the Malvenuto-Reutenauer Hopf algebra of permutations in detail. We give explicit formulas for its antipode, prove that it is a cofree coalgebra, determine its primitive elements and its coradical filtration and…
We answer a question of Bergeron, Hohlweg, Rosas, and Zabrocki from 2006 to give a combinatorial description for the coproduct of the x-basis in the Hopf algebra of symmetric functions in noncommuting variables, NCSym, which arises in the…
The general features of the degeneracy structure of ($p=2$) parasupersymmetric quantum mechanics are employed to yield a classification scheme for the form of the parasupersymmetric Hamiltonians. The method is applied to parasupersymmetric…
The article is devoted to holomorphic and meromorphic functions of quaternion and octonion variables. New classes of quasi-conformal and quasi-meromorphic mappings are defined and investigated. Properties of such functions such as their…
Snakes are analogues of alternating permutations defined for any Coxeter group. We study these objects from the point of view of combinatorial Hopf algebras, such as noncommutative symmetric functions and their generalizations. The main…
We consider Hilbert-type functions associated with difference (not necessarily inversive) field extensions and systems of algebraic difference equations in the case when the translations are assigned some integer weights. We will show that…
Hypergraph Horn functions were introduced as a subclass of Horn functions that can be represented by a collection of circular implication rules. These functions possess distinguished structural and computational properties. In particular,…
We extend the decomposition conjecture to 2d quantum field theories with a gauged $\text{Rep}(H)$ symmetry category for $H$ a finite-dimensional semisimple Hopf algebra with $\text{Rep}(G)$ trivially-acting and $\text{Vec}(\Gamma)$ the…
We define the concept of \emph{companion automorphism} of a Hopf algebra $H$ as an automorphism $\sigma:H \rightarrow H$: $\sigma^2=S^2$ --where $S$ denotes the antipode--. A Hopf algebra is said to be \emph{almost involutive} (AI) if it…
We describe a natural geometric relationship between matroids and underlying flag matroids by relating the geometry of the greedy algorithm to monotone path polytopes. This perspective allows us to generalize the construction of underlying…
Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…
We show that the linear coefficient of the Ehrhart polynomial of a matroid base polytope evaluated at $t-1$ is equal to, up to normalization, the $\beta$-invariant of the matroid. This yields a lattice-point counting formula for the…
We introduce a natural generalization of the definition of a symmetric Hopf algebroid, internal to any symmetric monoidal category with coequalizers that commute with the monoidal product. Motivation for this is the study of Heisenberg…
An arithmetic matroid is weakly multiplicative if the multiplicity of at least one of its bases is equal to the product of the multiplicities of its elements. We show that if such an arithmetic matroid can be represented by an integer…
A condition is identified which guarantees that the coinvariants of a coaction of a Hopf algebra on an algebra form a subalgebra, even though the coaction may fail to be an algebra homomorphism. A Hilbert Theorem (finite generation of the…
We describe a method for constructing characters of combinatorial Hopf algebras by means of integrals over certain polyhedral cones. This is based on ideas from resurgence theory, in particular on the construction of well-behaved averages…
It is known that the entropy function over a set of jointly distributed random variables is a submodular set function. However, not any submodular function is of this form. In this paper, we consider a family of submodular set functions,…
We introduce a new width parameter for matroids called decomposition width and prove that every matroid property expressible in the monadic second order logic can be computed in linear time for matroids with bounded decomposition width if…
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…
We study the group of group-like elements of a weak Hopf algebra and derive an analogue of Radford's formula for the fourth power of the antipode S, which implies that the antipode has a finite order modulo a trivial automorphism. We find a…