Related papers: An iterative-bijective approach to generalizations…

Let $a_k(n)$ denote the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may be ``colored" with one of $k$ colors, for fixed $k$. In this note, we find some congruences for $a_k(n)$ in the spirit of…

We translate Uchimura's identity for the divisor function and whose generalizations into combinatorics of partitions, and give a combinatorial proof of them. As a by-product of their proofs, we obtain some combinatorial results.

We present a proof of Chow's theorem using two results of Errett Bishop retated to volumes and limits of analytic varieties. We think this approach suggested a long time ago in the beautiful book by Gabriel Stolzenberg, is very attractive…

In this paper we construct a GL-equivariant complex of Schur modules over a ring of positive characteristic that can be used to deduce classical alternating sum identities for Schur polynomials. This complex globalizes to a complex of…

We collect some of our favorite proofs of Brooks' Theorem, highlighting advantages and extensions of each. The proofs illustrate some of the major techniques in graph coloring, such as greedy coloring, Kempe chains, hitting sets, and the…

The Schur orthogonality relations are a cornerstone in the representation theory of groups. We utilize a generalization to weak Hopf algebras to provide a new, readily verifiable condition on the skeletal data for deciding whether a given…

In this paper, we consider ordered set partitions obtained by imposing conditions on the size of the lists, and such that the first $r$ elements are in distinct blocks, respectively. We introduce a generalization of the Lah numbers. For…

Rado's theorem about permutahedra and dominance order on partitions reveals that each Schur polynomial is M-convex, or equivalently, it has a saturated Newton polytope and this polytope is a generalized permutahedron as well. In this paper…

In this paper, we will generalize the definition of partially random or complex reals, and then show the duality of random and complex, i.e., a generalized version of Levin-Schnorr's theorem. We also study randomness from the view point of…

We obtain a presentation by generators and relations for generalized Schur algebras and their quantizations. This extends earlier results obtained in the type A case. The presentation is compatible with Lusztig's modified form of a…

Let $r$ and $k$ be positive integers with $r \mid k$. Denote by $S_{\mathrm{\mathfrak{z}}}(k;r)$ the minimum integer $n$ such that every coloring $\chi:[1,n] \rightarrow \{0,1,\dots,r-1\}$ admits a solution to $\sum_{i=1}^{k-1} x_i = x_k$…

There is a classical connection between the representation theory of the symmetric group and the general linear group called Schur-Weyl duality. Variations on this principle yield analogous connections between the symmetric group and other…

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…

Assume that there is a set of monic polynomials $P_n(z)$ satisfying the second-order difference equation $$ A(s) P_n(z(s+1)) + B(s) P_n(z(s)) + C(s) P_n(z(s-1)) = \lambda_n P_n(z(s)), n=0,1,2,..., N$$ where $z(s), A(s), B(s), C(s)$ are some…

In this work, we study the Gross-Pitaevskii hierarchy on general --rational and irrational-- rectangular tori of dimension two and three. This is a system of infinitely many linear partial differential equations which arises in the rigorous…

Andrews and El Bachraoui recently studied various two-colored integer partitions, including those related to two-colored partitions into distinct parts with constraints and overpartitions. Their work raised questions about the existence of…

We give a proof of Brooks' theorem and its list coloring extension using the algebraic method of Alon and Tarsi; this also shows that the Brooks' theorem remains valid in a more general game coloring setting.

We generalize recent results of Breuer and Kronholm, and Chern on partitions and overpartitions with bounded differences between largest and smallest parts. We prove our generalization both analytically and combinatorially.

We prove combinatorially some identities related to Euler's partition identity (the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts). They were conjectured by Beck and proved by Andrews…

Section 10.4 of the 1998 Springer-Verlag book {\em Complexity and Real Computation}, by Blum, Cucker, Shub, and Smale, contains a particularly elegant proof of the Fundamental Theorem of Algebra: The central idea of the proof naturally…