Related papers: A combinatorial $\mathfrak{sl}_2$-action and the S…

We show that splitting forcing does not have the weak Sacks property below any condition, answering a question of Laguzzi, Mildenberger and Stuber-Rousselle. We also show how some partition results for splitting trees hold or fail and we…

For any graded poset $P$, we define a new graded poset, $\mathcal E(P)$, whose elements are the edges in the Hasse diagram of P. For any group, $G$, acting on the boolean algebra, $B_n$, we conjecture that $\mathcal E(B_n/G)$ is Peck. We…

A recent result of Papadakis-Petrotou shows that every simplicial sphere has the weak Lefschetz property in characteristic $2$. In this paper, we give a simpler proof of this result for PL-spheres by showing that the weak Lefschetz property…

The category Rel(Set) of sets and relations can be described as a category of spans and as the Kleisli category for the powerset monad. A set-functor can be lifted to a functor on Rel(Set) iff it preserves weak pullbacks. We show that these…

The symmetric group $\mathfrak{S}_n$ acts naturally on the poset of injective words over the alphabet $\{1, 2,\dots,n\}$. The induced representation on the homology of this poset has been computed by Reiner and Webb. We generalize their…

We introduce a new combinatorial invariant, which we call crosscut poset, that is finer than the crosscut complex. We exhibit many applications of the crosscut poset which include a generalization of Bj\"orner's crosscut theorem and two…

In one of his papers on the weak order of Coxeter groups, Dyer formulates several conjectures. Among these, one affirms that the extended weak order forms a lattice, while another offers an algebraic-geometric description of the join of two…

What might a combinatorial interpretation of the Kronecker coefficients even look like? We introduce a class of combinatorial objects called bitableaux, which we believe are a natural candidate, and we formulate a purely combinatorial…

I isolate a combinatorial property of a poset $\mathbb{P}$ that I call the strong Prikry property, which implies the existence of an ultrafilter on the complete Boolean algebra $\mathbb{B}$ of $\mathbb{P}$ such that one inclusion of the…

We use the theory of skew duality to show that decomposing the tensor product of $k$ irreducible representations of the symplectic group $Sp_{2m} = Sp_{2m}(C)$ is equivalent to branching from $Sp_{2n}$ to $Sp_{2n_1}\times\cdots\times…

Polar orderings arose in recent work of Salvetti and the second author on minimal CW-complexes for complexified hyperplane arrangements. We study the combinatorics of these orderings in the classical framework of oriented matroids, and…

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

We construct a poset from a simple acyclic digraph together with a valuation on its vertices, and we compute the values of its M\"obius function. We show that the weak order on Coxeter groups of type A, B, affine A, and the flag weak order…

Two of the pillars of combinatorics are the notion of choosing an arbitrary subset of a set with $n$ elements (which can be done in $2^n$ ways), and the notion of choosing a $k$-element subset of a set with $n$ elements (which can be done…

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…

In 2017, Davis, Nelson, Petersen, and Tenner [Discrete Math. 341 (2018),3249--3270] initiated the combinatorics of pinnacles in permutations. We provide a simple and efficient recursion to compute $p_n(S)$, the number of permutations of…

For self-similar sets, there are two important separation properties: the open set condition and the weak separation condition introduced by Zerner, which may be replaced by the formally stronger finite type property of Ngai and Wang. We…

Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…

Given a power-bounded linear operator T in a Banach space and a probability F on the non-negative integers, one can form a `subordinated' operator S = \sum_k F(k) T^k. We obtain asymptotic properties of the subordinated discrete semigroup…

We introduce a new combinatorial condition that characterises the amenability for locally compact groups. Our condition is weaker than the well-known F{\o}lner's conditions, and so is potentially useful as a criteria to show the amenability…