Related papers: Deterministic stack-sorting for set partitions
Based on an idea in [4] we propose a new iterative multiplicative filtering algorithm for label assignment matrices which can be used for the supervised partitioning of data. Starting with a row-normalized matrix containing the averaged…
Skew lattices are non-commutative generalizations of lattices. The coset structure decomposition is an original approach to the study of these algebras describing the relation between its rectangular classes. In this paper we will look at…
The Laplace expansion expresses the $n \times n$ determinant $\det_n$ as a sum of $n$ products. Do shorter expansions exist? In this paper we: - Fully determine the slice rank decompositions of $\det_n$ (where each product must contain a…
We define a suffixient set for a text $T [1..n]$ to be a set $S$ of positions between 1 and $n$ such that, for any edge descending from a node $u$ to a node $v$ in the suffix tree of $T$, there is an element $s \in S$ such that $u$'s path…
For many meta-Fibonacci sequences it is possible to identify a partition of the sequence into successive intervals (sometimes called blocks) with the property that the sequence behaves "similarly" in each block. This partition provides…
We present a structural approach of some results about jumps in the behavior of the profile (alias generating function) of hereditary classes of finite structures. We consider the following notion due to N.Thi\'ery and the second author. A…
Andrews, Lewis and Lovejoy introduced the partition function $PD(n)$ as the number of partitions of $n$ with designated summands. In a recent work, Lin studied a partition function $PD_{t}(n)$ which counts the number of tagged parts over…
Szlach\'anyi's skew monoidal categories are a well-motivated variation of monoidal categories in which the unitors and associator are not required to be natural isomorphisms, but merely natural transformations in a particular direction. We…
Bojanczyk and Pilipczuk showed in their celebrated article "Definability equals recognizability for graphs of bounded treewidth" (LICS 2016) that monadic second-order logic can define tree-decompositions in graphs of bounded treewidth. This…
In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…
Divisor methods are well known to satisfy house monotonicity, which allows representative seats to be allocated sequentially. We focus on stationary divisor methods defined by a rounding cutpoint $c \in [0,1]$. For such methods with…
We use a method for determining the number of preimages of any permutation under the stack-sorting map in order to obtain recursive upper bounds for the numbers $W_t(n)$ and $W_t(n,k)$ of $t$-stack sortable permutations of length $n$ and…
A finite poset X carries a natural structure of a topological space. Fix a field k, and denote by D(X) the bounded derived category of sheaves of finite dimensional k-vector spaces over X. Two posets X and Y are said to be derived…
The notion of level posets is introduced. This class of infinite posets has the property that between every two adjacent ranks the same bipartite graph occurs. When the adjacency matrix is indecomposable, we determine the length of the…
We enumerate smooth and rationally smooth Schubert varieties in the classical finite types A, B, C, and D, extending Haiman's enumeration for type A. To do this enumeration, we introduce a notion of staircase diagrams on a graph. These…
A set partition avoids a pattern if no subdivision of that partition standardizes to the pattern. There exists a bijection between set partitions and restricted growth functions (RGFs) on which Wachs and White defined four statistics of…
In this paper, we show that for all length 3 patterns, all positive integers are fertility numbers for the consecutive-pattern-avoiding stack-sorting map $\textrm{SC}_\sigma$, which resolves conjecture 8.3 from Defant and Zheng. The paper…
A partition of the positive integers into sets $A$ and $B$ {\em avoids} a set $S\subset\N$ if no two distinct elements in the same part have a sum in $S$. If the partition is unique, $S$ is {\em uniquely avoidable.} For any irrational…
Consider a network of processors (sites) in which each site x has a finite set N(x) of neighbors. There is a transition function f that for each site x computes the next state \xi(x) from the states in N(x). But these transitions (updates)…
The stable roommates problem does not necessarily have a solution, i.e. a stable matching. We had found that, for the uniformly random instance, the expected number of solutions converges to $e^{1/2}$ as $n$, the number of members, grows,…