Related papers: On partial well-order for monotone grid classes of…
We consider two orthogonal points of view on finite permutations, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or seen as bijections (corresponding to the algebraic point of…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
For a relational Horn theory $\mathbb{T}$, we provide useful sufficient conditions for the exponentiability of objects and morphisms in the category $\mathbb{T}\text{-}\mathsf{Mod}$ of $\mathbb{T}$-models; well-known examples of such…
The majorization relation orders the degree sequences of simple graphs into posets called dominance orders. As shown by Ruch and Gutman (1979) and Merris (2002), the degree sequences of threshold and split graphs form upward-closed sets…
A transitive permutation group is said to be semiprimitive if each of its normal subgroups is either semiregular or transitive.The class of semiprimitive groups properly contains primitive groups, quasiprimitive groups and innately…
The shard intersection order is a new lattice structure on a finite Coxeter group W which encodes the geometry of the reflection arrangement and the lattice theory of the weak order. In the case where W is the symmetric group, we…
By showing the compatibility of folding almost positive roots and folding cluster categories, we prove that there is a one-to-one correspondence between seeds and tilting seeds in non-simply-laced finite cases.
We prove that for any monotone class of finite relational structures, the first-order theory of the class is NIP in the sense of stability theory if, and only if, the collection of Gaifman graphs of structures in this class is nowhere…
We prove that the basis and the generating function of a geometric grid class of permutations Geom$(M)$ are computable from the matrix $M$, as well as some variations on this result. Our main tool is monadic second-order logic on…
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…
We consider Markov chains on partially ordered sets that generalize the success-runs and remaining life chains in reliability theory. We find conditions for recurrence and transience and give simple expressions for the invariant…
Restriction categories were established to handle maps that are partially defined with respect to composition. Tensor topology realises that monoidal categories have an intrinsic notion of space, and deals with objects and maps that are…
The modular class of a regular foliation is a cohomological obstruction to the existence of a volume form transverse to the leaves which is invariant under the flow of the vector fields of the foliation. By drawing on the relationship…
We determine upper bounds for the maximum order of an element of a finite almost simple group with socle T in terms of the minimum index m(T) of a maximal subgroup of T: for T not an alternating group we prove that, with finitely many…
A mutation will affect an individual and some or all of its descendants. In this paper, we investigate ordered trees with a distinguished vertex called the mutator. We describe various mutations in ordered trees, and find the generating…
In a recent paper (2018), D. Hofmann, R. Neves and P. Nora proved that the dual of the category of compact partially ordered spaces and monotone continuous maps is a quasi-variety - not finitary, but bounded by $\aleph_1$. An open question…
The first steps towards linearisation of partial orders and equivalence relations are described. The definitions of partial orders and equivalence relations (on sets) are formulated in a way that is standard in category theory and that…
We consider a bivariate polynomial that generalizes both the length and reflection length generating functions in a finite Coxeter group. In seeking a combinatorial description of the coefficients, we are led to the study of a new Mahonian…
We introduce a game on graphs. By a theorem of Zermelo, each instance of the game on a finite graph is determined. While the general decision problem on which player has a winning strategy in a given instance of the game is unsolved, we…
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…