Related papers: On certain unimodal sequences and strict partition…

Let $d, r \in \N$, $\|\cdot\|$ any norm on $\R^d$ and $B$ denote the unit ball with respect to this norm. We show that any sequence $v_1,v_2,...$ of vectors in $B$ can be partitioned into $r$ subsequences $V_1, ..., V_r$ in a balanced…

Recently, Schneider and Schneider defined a new class of partitions called sequentially congruent partitions, in which each part is congruent to the next part modulo its index, and they proved two partition bijections involving these…

In this paper we study generating functions resembling the rank of strongly unimodal sequences. We give combinatorial interpretations, identities in terms of mock modular forms, asymptotics, and a parity result. Our functions imitate a…

We develop the connection of Berg partitions with special substitution tilings of two tiles. We obtain a new proof that the number of Berg partitions with a fixed connectivity matrix is equal to half of the sum of its entries, \cite{S-W}.…

This article is an extensive study of partitions with fixed number of odd and even-indexed odd parts. We use these partitions to generalize recent results of C. Savage and A. Sills. Moreover, we derive explicit formulas for generating…

In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…

Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, being an unrefinable partition means that none of the parts can be written as the sum of smaller…

Main result: If a C*-algebra is simple, $\sigma$-unital, has finitely many extremal traces, and has strict comparison of positive elements by traces, then its multiplier also has strict comparison of positive elements by traces. The same…

We present an infinite family of recursive formulas that count binary integer partitions satisfying natural divisibility conditions and show that these counts are interrelated via partial sums. Moreover, we interpret the partitions we study…

Let X be a smooth complex projective curve of genus g bigger or equal to 1. If g is bigger than 1 assume further that X is either bielliptic or with general moduli. Under a natural condition on slopes, we prove that there exists a short…

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 estimation for the upper bound of B_k sequences.

We start with observing that the only connected finite dimensional algebras with finitely many isomorphism classes of indecomposable bimodules are the quotients of the path algebras of uniformly oriented $A_n$-quivers modulo the radical…

Let $G$ be an additive finite abelian group. A sequence over $G$ is called a minimal zero-sum sequence if the sum of its terms is zero and no proper subsequence has this property. Davenport's constant of $G$ is the maximum of the lengths of…

We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m.…

Given a sequence A=(a1,...,an) of real numbers, a block B of the A is either a set B={ai,...,aj} where i<=j or the empty set. The size b of a block B is the sum of its elements. We show that when 0<=ai<=1 and k is a positive integer, there…

Let $G$ be an additive abelian group. A sequence $S = g_1 \cdot \ldots \cdot g_{\ell}$ of terms from $G$ is a plus-minus weighted zero-sum sequence if there are $\varepsilon_1, \ldots, \varepsilon_{\ell} \in \{-1, 1\}$ such that…

We fully classify completely multiplicative sequences which are given by generalised polynomial formulae, and obtain a similar result for (not necessarily completely) multiplicative sequences under the additional restriction that the…

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

We prove a number of limiting distributions for statistics for unimodal sequences of positive integers by adapting a probabilistic framework for integer partitions introduced by Fristedt. The difficulty in applying the direct analogue of…

Partitions without sequences of consecutive integers as parts have been studied recently by many authors, including Andrews, Holroyd, Liggett, and Romik, among others. Their results include a description of combinatorial properties,…