Related papers: Unrefinable Partitions into Distinct Parts and Num…

In the first part we associate a periodic sequence to a partition and study the connection the distribution of elements of uniform limit of the sequences. Then some facts of statistical independence of these limits are proved

In this paper we introduce a family of partitions of the set of natural numbers, Fibonacci-like partitions. In particular, we introduce a Fibonacci-like partition in a number of parts corresponding to the Fibonacci numbers, the standard…

This article highlights historical achievements in the partition theory of countable homogeneous relational structures, and presents recent work, current trends, and open problems. Exciting recent developments include new methods involving…

We investigate the set of partial partitions of a finite set, ordered by inclusion. With this ordering the set of partial partitions can be studied as an abstract simplicial complex. We use the theory of shellable nonpure complexes to find…

Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…

We provide a variational derivation of the limit shape of minimal difference partitions and discuss the link with exclusion statistics. Also see arXiv:0707.2312 for a related paper.

The description of the subgroup structure of a non-commutative division ring is the subject of the intensive study in the theory of division rings in particular, and of the theory of skew linear groups in general. This study is still so far…

We present a new set of inseparabilty inequalities to detect entanglement in $N$-spin states. These are based on negative partial transposition and involve collective spin-spin correlations of any two partitions of the entire system. They…

Symmetries impose structure on the Hilbert space of a quantum mechanical model. The mathematical units of this structure are the irreducible representations of symmetry groups and I consider how they function as conceptual units of…

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…

Motivated by intuitive properties of physical quantities, the notion of a non-anomalous semigroup is formulated. These are totally ordered semigroups where there are no `infinitesimally close' elements. The real numbers are then defined as…

Given a finite set of points in $\mathbb{R}^d$, Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph structured on the family of Tverberg partitions of a given…

In this paper we find exact formulas for the numbers of partitions and compositions of an element into $m$ parts over a finite field, i.e. we find the number of nonzero solutions of the equation $x_1+x_2+...+x_m=z$ over a finite field when…

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,…

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…

The pseudo-Frobenius numbers of a numerical semigroup are those gaps of the numerical semigroup that are maximal for the partial order induced by the semigroup. We present a procedure to detect if a given set of integers is the set of…

We explore graph theoretical properties of minimal prime graphs of finite solvable groups. In finite group theory studying the prime graph of a group has been an important topic for the past almost half century. Recently prime graphs of…

We present two families of numerical semigroups and show that for each family, the number of required components in an irreducible decomposition cannot be bounded by any given integer. This gives a negative answer to a question raised by…

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…

The main purpose of this paper is to investigate the zero-divisors of semigroups with zero and semirings and in particular, to discuss eversible and reversible semigroups and semirings. We also introduce a new ring-like algebraic structure…