Related papers: Mullineux map: $d$-balanced partitions and $d$-run…

We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph parameters with this property that we call mixed partition…

The paper is concerned with the asymptotic analysis of a family of Boltzmann (multiplicative) distributions over the set $\check{\varLambda}^{q}$ of strict integer partitions (i.e., with unequal parts) into perfect $q$-th powers. A…

We prove an identity about partitions, previously conjectured in the study of shifted Jack polynomials (math.CO/9903020). The proof given is using $\lambda$-ring techniques. It would be interesting to obtain a bijective proof.

Given a real number $\lambda > 1$, we say that $d|n$ is a $\lambda$-middle divisor of $n$ if $$ \sqrt{\frac{n}{\lambda}} < d \leq \sqrt{\lambda n}. $$ We will prove that there are integers having an arbitrarily large number of…

A Lambda (Card Lambda > aleph)-product space of {0,1} has a partition {X1,...,Xn} for any n a decomposition space of each Xi of which is self-similar.(February 16, 2015)

For a fixed integer $k$, we consider the set of noncrossing partitions, where both the block sizes and the difference between adjacent elements in a block is $1\bmod k$. We show that these $k$-indivisible noncrossing partitions can be…

It is shown that, for the block matrices belonging to $M(nd,\mathbb{C})$ with commuting and normal block entries of dimension $d$, the separability of such a block matrices is equivalent to its semi-positive definity. The separability…

Given a symmetric D*D matrix M over {0,1,*}, a list M-partition of a graph G is a partition of G's vertices into D parts associated with the rows of M. The part of each vertex is chosen from a given list so that no edge of G maps to a 0 in…

With elementary means, we prove a stronger run time guarantee for the univariate marginal distribution algorithm (UMDA) optimizing the LeadingOnes benchmark function in the desirable regime with low genetic drift. If the population size is…

We develop a combinatorial framework for the subdivision map -- introduced by Maksimau, Mathas and Tubbenhauer -- between the KLR(W) algebras of type $A^{(1)}_{e-1}$ and type $A^{(1)}_{e}$, which provides a partial categorification of the…

We develop a calculus for $S_n$-equivariant Euler characteristics of moduli spaces of stable curves and stable maps. Our approach involves an enrichment of P\'olya's cycle index polynomial of a graph to a certain algebra $\Lambda^{[2]}$ of…

Given the integral lattice $\Lambda^d$ in $d$-dimensional Euclidean space, partitions of the lattice nodes into orbits of finite-index subgroups of $Aut(\Lambda^d)$ have been computed for $d \leq 4$. These partitions can be interpreted as…

For primes $\ell$ and nonnegative integers $a$, we study the partition functions $$p_\ell(a;n):= \#\{\lambda \vdash n : \text{ord}_\ell(H(\lambda))=a\},$$ where $H(\lambda)$ denotes the product of hook lengths of a partition $\lambda$.…

Let $R$ be a discrete valuation domain with field of fractions $Q$ and maximal ideal generated by $\pi$. Let $\Lambda$ be an $R$-order such that $Q\Lambda$ is a separable $Q$-algebra. Maranda showed that there exists $k\in\mathbb{N}$ such…

We present a method for solving implicit (factored) Markov decision processes (MDPs) with very large state spaces. We introduce a property of state space partitions which we call epsilon-homogeneity. Intuitively, an epsilon-homogeneous…

Let $p$ be a prime. Suppose that integers $r$, $e$, $d$ such that $r \ge 2$, $e \ge 0$, $0 \le d \le p$ are given. Let $f(x)=s_0 x^r + s_1 x^{r-1} + \cdots + s_r$ be a generic polynomial of degree $r$ in characteristic $p$. We put…

The problem of diagonalizing a class of complicated matrices, to be called ultrametric matrices, is investigated. These matrices appear at various stages in the description of disordered systems with many equilibrium phases by the technique…

We propose an algorithm for low rank matrix completion for matrices with binary entries which obtains explicit binary factors. Our algorithm, which we call TBMC (\emph{Tiling for Binary Matrix Completion}), gives interpretable output in the…

Let $G$ be a finite group and $R$ be a commutative ring. The Mackey algebra $\mu_{R}(G)$ shares a lot of properties with the group algebra $RG$ however, there are some differences. For example, the group algebra is a symmetric algebra and…

We study the complexity of computing Kronecker coefficients $g(\lambda,\mu,\nu)$. We give explicit bounds in terms of the number of parts $\ell$ in the partitions, their largest part size $N$ and the smallest second part $M$ of the three…