Related papers: On certain unimodal sequences and strict partition…
In graph theory a partition of the vertex set of a graph is called equitable if for all pairs of cells all vertices in one cell have an equal number of neighbours in the other cell. Considering the implications for the adjacency matrix one…
We describe the central measures for the random walk on graded graphs. Using this description, we obtain the list of all finite traces on three infinite-dimensional algebras: on the Brauer algebra, on the partition algebra, and on the…
Let X be a path connected, compact metric space and let A be a unital separable simple nuclear Z-stable real rank zero C*-algebra. We classify all the unital *-embeddings (up to approximate unitary equivalence) of C(X) into A. Specifically,…
In a recent paper on a study of the Sylow 2-subgroups of the symmetric group with 2^n elements it has been show that the growth of the first (n-2) consecutive indices of a certain normalizer chain is linked to the sequence of partitions of…
In this paper we present a new formula for the number of unrestricted partitions of $n$. We do this by introducing a correspondence between the number of unrestrited partitions of $n$ and the number of non-negative solutions of systems of…
We are interested in ordering the elements of a subset A of the non-zero integers modulo n in such a way that all the partial sums are distinct. We conjecture that this can always be done and we prove various partial results about this…
We give new sufficient conditions for a sequence of polynomials to have only real zeros based on the method of interlacing zeros. As applications we derive several well-known facts, including the reality of zeros of orthogonal polynomials,…
We give a sharp refinement of a result of Alon, Ben-Shimon and Krivelevich. This gives a sufficient condition for a finite sequence of positive integers to be the vertex degree list of both parts of a bipartite graph. The condition depends…
We prove that in every variety of $G$-groups, every $G$-existentially closed element satisfies nullstellensatz for finite consistent systems of equations. This will generalize {\bf Theorem G} of \cite{BMR1}. As a result we see that every…
By analogy with the classical (Chasles-Schubert-Semple-Tyrell) spaces of complete quadrics and complete collineations, we introduce the variety of complete complexes. Its points can be seen as equivalence classes of spectral sequences of a…
A special case of an elegant result due to Anderson proves that the number of $(s,s+1)$-core partitions is finite and is given by the Catalan number $C_s$. Amdeberhan recently conjectured that the number of $(s,s+1)$-core partitions into…
We establish a fundamental theorem of orders (FTO) which allows us to express all orders uniquely as an intersection of `irreducible orders' along which the index and the conductor distributes multiplicatively. We define a subclass of…
We extend the theory of infinite-exponent partition relations to arbitrary linear order types, with a particular focus on the real number line. We give a complete classification of all consistent partition relations on the real line with…
To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in general. In this paper we present an efficient solution for the homogeneous version of this problem; i.e. where the elements in each subset add…
Let $(\mathcal{G},\nu)$ be a $t$-discrete ergodic groupoid. Consider a finite Von Neumann algebra $\mathcal{M}$ with separable predual. We prove that every uniformly bounded measurable representation $\rho:\mathcal{G} \rightarrow…
Let $\mathcal{R}$ be a commutative ring with unity, and let $P$ be a locally finite poset. The aim of the paper is to provide an explicit description of the additive biderivations of the incidence algebra $I(P, \mathcal{R})$. We demonstrate…
Motivated by Pittel's study of minimally intersecting set partitions, we investigate minimally intersecting set partitions of type B. We find a formula for the number of minimally intersecting r-tuples of $B_n$-partitions, as well as a…
The constant $C_A(n)$ is defined to be the smallest natural number $k$ such that any sequence of $k$ elements in $\mathbb Z_n$ has a subsequence of consecutive terms whose $A$-weighted sum is zero, where the weight set $A\subseteq \mathbb…
This paper presents a bijection between ascent sequences and upper triangular matrices whose non-negative entries are such that all rows and columns contain at least one non-zero entry. We show the equivalence of several natural statistics…
We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…