Related papers: On certain unimodal sequences and strict partition…
We compute an asymptotic estimate for odd balanced unimodal sequences for ranks congruent to $a \pmod{c}$ for $c\neq 1$ odd. We find the interesting result that the odd balanced unimodal sequences are asymptotically related to the…
We present a direct bijection between descending plane partitions with no special parts and permutation matrices. This bijection has the desirable property that the number of parts of the descending plane partition corresponds to the…
Let $G$ be a group and $G_0 \subseteq G$ be a subset. A sequence over $G_0$ means a finite sequence of terms from $G_0$, where the order of elements is disregarded and the repetition of elements is allowed. A product-one sequence is a…
The number of sequences of odd length in strict partitions (denoted as $\mathrm{sol}$), which plays a pivotal role in the first paper of this series, is investigated in different contexts, both new and old. Namely, we first note a direct…
We construct weight-preserving bijections between column strict shifted plane partitions with one row and alternating sign trapezoids with exactly one column in the left half that sums to $1$. Amongst other things, they relate the number of…
We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…
This article studies the compatibility of Koenig's notion of an exact Borel subalgebra of a quasi-hereditary or, more generally, standardly stratified algebra with taking idempotent subalgebras or quotients. As an application, we provide…
Let $G$ be a graph(directed or undirected) having $k$ number of blocks. A $\mathcal{B}$-partition of $G$ is a partition into $k$ vertex-disjoint subgraph $(\hat{B_1},\hat{B_1},\hdots,\hat{B_k})$ such that $\hat{B}_i$ is induced subgraph of…
The purpose of the article is to provide an unified way to formulate zero-sum invariants. Let $G$ be a finite additive abelian group. Let $B(G)$ denote the set consisting of all nonempty zero-sum sequences over G. For $\Omega \subset B(G$),…
In this paper, we examine the unimodality and strict unimodality of certain formal bivariate Laurent series with non-negative coefficients. We show that the sets of these formal bivariate Laurent series form commutative semirings under the…
Strict partitions are enumerated with respect to the weight, the number of parts, and the number of sequences of odd length. We write this trivariate generating function as a double sum $q$-series. Equipped with such a combinatorial set-up,…
For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.
The theory of q-analogs develops many combinatorial formulas for finite vector spaces over a finite field with q elements--all in analogy with formulas for finite sets (which are the special case of q=1). A direct-sum decomposition of a…
In recent work, M. Schneider and the first author studied a curious class of integer partitions called "sequentially congruent" partitions: the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part congruent to…
Let $G$ be a connected semi-simple algebraic group of adjoint type over an algebraically closed field, and let $\overline{G}$ be the wonderful compactification of $G$. For a fixed pair $(B, B^-)$ of opposite Borel subgroups of $G$, we look…
We present a simple bijection between permutation matrices and descending plane partitions without special parts. This bijection is already mentioned in work of P. Lalonde (without giving the details); it involves the inversion words of…
We give a possible explanation for the mystery of a missing number in the statement of a problem that asks for the non-negative integers to be partitioned into three subsets. We interpret the missing number as one of the clues that can lead…
A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new upper bound for B_3 sequences.
In this paper we prove an exact formula for the number of partitions without sequences. By work of Andrews, the corresponding generating function is a product of a modular form and a mock theta function, giving an overall weight of 0. The…
In this paper we consider permutations of sequences of partitions, obtaining a result which parallels von Neumann's theorem on permutations of dense sequences and uniformly distributed sequences of points.