Related papers: On a problem of Perron

For any partition of a positive integer we consider the chess (or draughts) colouring of its associated Ferrers graph. Let b denote the total number of black unit squares, and w the number of white squares. In this note we characterize all…

For $ k \in \mathbb{N}$ we introduce an idempotent subalgebra, the spherical partition algebra ${\mathcal{SP} }_{k}$, of the partition algebra ${\mathcal{P} }_{k}$, that we define using an embedding associated with the trivial…

In a pair of recent papers, Andrews, Fraenkel and Sellers provide a complete characterization for the number of $m$-ary partitions modulo $m$, with and without gaps. In this paper we extend these results to the case of coloured $m$-ary…

We consider partitions of n-dimensional boxes in R^n, n>1, into a finite number of boxes with pairwise disjoint interiors. We study sets X \subseteq (0,\infty) with the Property (W_n): for every n-dimensional box P and every partition of P,…

Given an $n\times n$ array $M$ ($n\ge 7$), where each cell is colored in one of two colors, we give a necessary and sufficient condition for the existence of a partition of $M$ into $n$ diagonals, each containing at least one cell of each…

We consider the expansion of the square of a complete homogeneous function $h_\lambda$, or of an elementary symmetric function $e_\lambda$, in the basis of Schur functions. This square also decomposes into two plethysms, $s_2[h_\lambda]$…

Using Fedder's criterion, we classify all non-$F$-split del Pezzo surfaces of degree $1$. We give a necessary and sufficient criterion for the $F$-splitting of such del Pezzo surfaces in terms of their anti-canonical system.

The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…

Let $D$ be a reduced divisor in $\mathbb P^n_k$ for an algebraically closed field $k$ of positive characteristic $p > 0$. We prove that if $(\mathbb P^n_k, D)$ is Frobenius liftable modulo $p^2$, then $D$ is a toric divisor. As a corollary,…

We explore two questions about pseudo-polynomials, which are functions $f:\mathbb N \to \mathbb Z$ such that $k$ divides $f(n+k) - f(n)$ for all $n,k$. First, for certain arbitrarily sparse sets $R$, we construct pseudo-polynomials $f$ with…

In \cite{LaLuRa13}, the authors completely classified the topological structure of so called {\it fractal square} $F$ defined by $F=(F+{\mathcal D})/n$, where ${\mathcal{D}}\subsetneq\{0,1,\dots,n-1\}^2, n\ge 2$. In this paper, we further…

We give a detailed analysis of the proportion of elements in the symmetric group on $n$ points whose order divides $m$, for $n$ sufficiently large and $m \ge n$ with $m = O(n)$.

We examine the poset $P$ of 132-avoiding $n$-permutations ordered by descents. We show that this poset is the "coarsening" of the well-studied poset $Q$ of noncrossing partitions . In other words, if $x<y$ in $Q$, then $f(y)<f(x)$ in $P$,…

Parton distributions are constructed in a statistical physical picture of the nucleon. The chiral properties of QCD lead to strong relations between quarks and antiquarks distributions and the importance of the Pauli exclusion principle is…

For any positive integer $m$, let $\mathbb{Z}_{m}$ be the set of residue classes modulo $m$. For $A\subseteq \mathbb{Z}_{m}$ and $\overline{n}\in \mathbb{Z}_{m}$, let $R_{A}(\overline{n})$ denote the number of solutions of…

Let X be a smooth hypersurface of degree d in P^n over an algebraically closed field of characteristic p. We show that X must be separably rationally connected and must contain a free line if either p is at least d or if p is at least d-1…

For $p$ a prime, $G$ a finite group and $A$ a normal subset of elements of order $p$, we prove that if $A^2 = \{ab \mid a, b \in A\}$ consists of $p$-elements then $Q = \langle A \rangle$ is soluble. Further, if $O_p(G) = 1$, we show that…

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…

We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…

We consider the equal sum partition problem, motivated by distance magic graph labeling: Given $n,k \in \N$ such that $k\, | \sum_{i=1}^ni$ and a partition $p_1+\cdots+p_k=n$, when is it possible to find a partition of the set…