Related papers: More Shattering News
We introduce a lifting of West's stack-sorting map $s$ to partition diagrams, which are combinatorial objects indexing bases of partition algebras. Our lifting $\mathscr{S}$ of $s$ is such that $\mathscr{S}$ behaves in the same way as $s$…
We investigate a variant of the chip-firing process on the infinite path graph: rather than treating the chips as indistinguishable, we label them with positive integers. To fire an unstable vertex, i.e. a vertex with more than one chip, we…
Entangled linear orders were first introduced by Abraham and Shelah. Todor\v{c}evi\'c showed that these linear orders exist under $\mathsf{CH}$. We prove the following results: (1) If $\mathsf{CH}$ holds, then, for every $n > 0$, there is…
Let $A$ be a multiset with elements in an abelian group. Let $FS(A)$ be the multiset containing the $2^{|A|}$ sums of all subsets of $A$. We study the reconstruction problem ``Given $FS(A)$, is it possible to identify $A$?'', and we give a…
L\'evai and Pyber proposed the following as a conjecture: Let $G$ be a profinite group such that the set of solutions of the equation $x^n=1$ has positive Haar measure. Then $G$ has an open subgroup $H$ and an element $t$ such that all…
Decomposable ordered structures were introduced in \cite{OnSt} to develop a general framework to study `finite-dimensional' totally ordered structures. This paper continues this work to include decomposable structures on which a ordered…
We apply operad theory to enumerative combinatorics in order to count the number of shuffles between series-parallel posets and chains. We work with three types of shuffles, two of them noncommutative, for example a left deck-divider…
We introduce the notion of a tight cofinitary group, which captures forcing indestructibility of maximal cofinitary groups for a long list of partial orders, including Cohen, Sacks, Miller, Miller partition forcing and Shelah's poset for…
Some filter relative notions of size, $\left( \mathcal{F},\mathcal{G}\right) $-syndeticity and piecewise $\mathcal{F} $-syndeticity, were defined and applied with clarity and focus by Shuungula, Zelenyuk and Zelenyuk in their paper ``The…
We consider the Burnside ring $A(\mathcal{F})$ of $\mathcal{F}$-stable $S$-sets for a saturated fusion system $\mathcal{F}$ defined on a $p$-group $S$. It is shown by S. P. Reeh that the monoid of $\mathcal{F}$-stable sets is a free…
Bj\"orner and Wachs introduced CL-shellability as a technique for studying the topological structure of order complexes of partially ordered sets (posets). They also introduced the notion of recursive atom ordering, and they proved that a…
Let $E$ be an elliptic curve over $\mathbf{Q}$. We conjecture asymptotic estimates for the number of vanishings of $L(E,1,\chi)$ as $\chi$ varies over all primitive Dirichlet characters of orders 4 and 6, subject to a mild hypothesis on…
The Frankl or Union-Closed Sets conjecture states that for any finite union-closed family of sets $\mathcal{F}$ containing some nonempty set, there is some element $i$ in the ground set $U(\mathcal F) := \bigcup_{S \in \mathcal{F}} S$ of…
We are given a set $A$ of buyers, a set $B$ of houses, and for each buyer a preference list, i.e., an ordering of the houses. A house allocation is an injective mapping $\tau$ from $A$ to $B$, and $\tau$ is strictly better than another…
The universal scheme of clusters of sections is an adaption of Kleiman's iterated blow ups (which parametrise clusters of points) to parametrise clusters of sections. They can also be constructed iteratively, but the iterative step is not…
For a family $\mathcal{F}$ of subsets of a finite set, define $\mathcal{D}(\mathcal{F})=\{F\setminus F': F, F'\in\mathcal{F}\}$. A family $\mathcal{F}$ is called intersecting if $F\cap F'\not=\emptyset$ for all $F, F'\in\mathcal{F}$. Frankl…
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…
The main results of this paper (a) extend the finite Ramsey partition theorem, and (b) employ this extension to obtain a stronger form of the infinite Nash-Williams partition theorem, and also a new proof of Ellentuck's, and hence…
A category structure for ordered Bratteli diagrams is proposed in which isomorphism coincides with the notion of equivalence of Herman, Putnam, and Skau. It is shown that the natural one-to-one correspondence between the category of Cantor…
Hausdorff's paradoxical decomposition of a sphere with countably many points removed (the main precursor of the Banach-Tarski paradox) actually produced a partition of this set into three pieces A,B,C such that A is congruent to B (i.e.,…