Related papers: Order structure on the algebra of permutations and…
This is the first contribution of a sequence of papers introducing the notions of $s$-weak order and $s$-permutahedra, certain discrete objects that are indexed by a sequence of non-negative integers $s$. In this first paper, we concentrate…
Let $\mathbf D$ be the set of isomorphism types of finite double partially ordered sets, that is sets endowed with two partial orders. On $\BZ\mathbf D$ we define a product and a coproduct, together with an internal product, that is,…
We explore lattice structures on integer binary relations (i.e. binary relations on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$) and on integer posets (i.e. partial orders on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$).…
Let k be a local field and let A be the two-by-two matrix algebra over k. In our previous work we developed a theory that allows the computation of the set of maximal orders in A containing a given suborder. This set is given as a sub-tree…
Given a Hopf algebra $H$ and a projection $H\to A$ to a Hopf subalgebra, we construct a Hopf algebra $r(H)$, called the partial dualization of $H$, with a projection to the Hopf algebra dual to $A$. This construction provides powerful…
We first review our previous work arxiv:1503.02993 [math-ph] where we considered a model for topological recursion based on the Hopf Algebra of planar binary trees of Loday and Ronco and showed that extending this Hopf Algebra by…
The structure of Terwilliger algebras of wreath products by thin schemes or one-class schemes was studied in [A. Hanaki, K. Kim, Y. Maekawa, Terwilliger algebras of direct and wreath products of association schemes, J. Algebra 343 (2011)…
We introduce the notion of partial representation of a weak Hopf algebra. We present the universal algebra $H_{par}^w$, which factorizes these partial representations by algebra morphisms. Also, it is shown that $\Hp$ is isomorphic to a…
A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…
To a finite group G one can associate a tower of wreath products S_n[G]. It is well known that the graded direct sum of the Grothendieck groups of the categories of finite dimensional complex representations of these groups can be given the…
In this survey, we first review some known results on the representation theory of algebras with triangular decomposition, including the classification of the simple modules. We then discuss a recipe to construct Hopf algebras with…
In this paper we consider arbitrary intervals in the left weak order on the symmetric group $S_n$. We show that the Lehmer codes of permutations in an interval form a distributive lattice under the product order. Furthermore, the…
A non-commutative, planar, Hopf algebra of rooted trees was proposed in L. Foissy, Bull. Sci. Math. 126 (2002) 193-239. In this paper we propose such a non-commutative Hopf algebra for graphs. In order to define a non-commutative product we…
An internal coproduct is described, which is compatible with Hoffman's quasi-shuffle product. Hoffman's quasi-shuffle Hopf algebra, with deconcatenation coproduct, is a comodule-Hopf algebra over the bialgebra thus defined. The relation…
By changing to an orthogonal basis, we give a short proof that the subfactor of the graded algebra of a planar algebra reproduces the planar algebra.
We report some observations concerning two well-known approaches to construction of quantum groups. Thus, starting from a bialgebra of inhomogeneous type and imposing quadratic, cubic or quartic commutation relations on a subset of its…
In this manuscript we show that two partial orders defined on the set of standard Young tableaux of shape $\alpha$ are equivalent. In fact, we give two proofs for the equivalence of the box order and the dominance order for {tableaux}. Both…
Recent advances in stochastic PDEs, Hopf algebras of typed trees and integral equations have inspired the study of algebraic structures with replicating operations. To understand their algebraic and combinatorial nature, we first use rooted…
For any set S, the free magmatic algebra spanned by card(S) binary products is the vector space spanned by the set of all planar rooted binary trees with the internal nodes colored by the elements of S, graded by the number of leaves of a…
A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which…