Related papers: Some Sufficient Conditions for Finding a Nesting o…
The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…
Given a poset $P$ we say a family $\mathcal{F}\subseteq P$ is centered if it is obtained by `taking sets as close to the middle layer as possible'. A poset $P$ is said to have the centeredness property if for any $M$, among all families of…
A subset $S$ of a group $(G,+)$ is $t$-weakly sequenceable if there is an ordering $(y_1, \ldots, y_k)$ of its elements such that the partial sums~$s_0, s_1, \ldots, s_k$, given by $s_0 = 0$ and $s_i = \sum_{j=1}^i y_j$ for $1 \leq i \leq…
Recently, Kitaev and Remmel [Classifying descents according to parity, Annals of Combinatorics, to appear 2007] refined the well-known permutation statistic ``descent'' by fixing parity of one of the descent's numbers. Results in that paper…
Rank-2 and rank-3 tensors are almost all identifiable with only few exceptions. We classify them all together with the dimensions and the structures of all the sets evincing the rank.
The main theorem provides a characterisation of the finite rank operators lying in a norm closed Lie ideal of a continuous nest algebra. These operators are charaterised as those finite rank operators in the nest algebra satisfying a…
A CP-semigroup is aligned if its set of trivially maximal subordinates is totally ordered by subordination. We prove that aligned spatial E_0-semigroups are prime: they have no non-trivial tensor product decompositions up to cocycle…
We study preorders on (equivalence classes of) maximal chains in the general context of polygonal lattices endowed with suitably nice edge labellings. We show that, given a quotient of polygonal lattices, such edge labellings descend to the…
The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. The chain polynomials of the partition lattices and their standard type $B$ analogues are shown to have only real roots.…
For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…
The tensor rank (also known as generalized Schmidt rank) of multipartite pure states plays an important role in the study of entanglement classifications and transformations. We employ powerful tools from the theory of homogeneous…
The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order…
We obtain a higher dimensional analogue of a classical theorem which states that a polygonally cellulated $2$-sphere in $\mathbb{R}^3$, such that each vertex has even degree, is $2$-face-colourable. In order to formulate our result, we…
It is proved that the reduced group C*-algebra C*_{red}(G) has stable rank one (i.e. its group of invertible elements is a dense subset) if G is a discrete group arising as a free product G_1*G_2 where |G_1|>=2 and |G_2|>=3. This follows…
We study a certain poset on the free monoid on a countable alphabet. This poset is determined by the fact that its total extensions are precisely the standard term orders. We also investigate the poset classifying degree-compatible standard…
The $P$-partition generating function of a (naturally labeled) poset $P$ is a quasisymmetric function enumerating order-preserving maps from $P$ to $\mathbb{Z}^+$. Using the Hopf algebra of posets, we give necessary conditions for two…
Let $A$ be a separable, unital, simple C*-algebra with stable rank one. We show that every strictly positive, lower semicontinuous, affine function on the simplex of normalized quasitraces of $A$ is realized as the rank of an operator in…
Set $[n]=\{1, 2, \ldots , n\}$. The hypergrid $[t]^n$ is the collection of functions $f: \ [n]\rightarrow [t]$. We equip it with the natural partial order by letting $f\leq g$ whenever $f(x)\leq g(x)$ holds for all $x\in [n]$. Given a poset…
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…