#### Filter Results:

- Full text PDF available (48)

#### Publication Year

1991

2017

- This year (2)
- Last 5 years (11)
- Last 10 years (23)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

The well-known fact that there is always one more addable than removable box for a Young diagram is generalized to arbitrary hooks. As an application, this implies immediately a simple proof of a conjecture of Regev and Vershik 3] for which inductive proofs have recently been given by Regev and Zeilberger 4] and Janson 1].

- Christine Bessenrodt
- Discrete Mathematics
- 1994

An explicit bijection is constructed between partitions of a positive integer n with exactly j even parts which are all different, and bipartitions (x1; n2) of n into distinct parts such that 1(n2)=j and max n2 <I(aI); this implies an identity due to Lebesgue. The construction is inspired by a version of Sylvester’s bijective proof of Euler’s identity using… (More)

This paper is concerned with properties of the Mullineux map, which plays a rôle in p-modular representation theory of symmetric groups. We introduce the residue symbol for a p-regular partitions, a variation of the Mullineux symbol, which makes the detection and removal of good nodes (as introduced by Kleshchev) in the partition easy to describe.… (More)

Kronecker or inner tensor products of representations of symmetric groups (and many other groups) have been studied for a long time. But even for the symmetric groups no reasonable formula for decomposing Kronecker products of two irreducible complex representations into irreducible components is available (cf. [7, 5]). An equivalent problem is to decompose… (More)

- Christine Bessenrodt, Thorsten Holm, Peter Jørgensen
- J. Comb. Theory, Ser. A
- 2014

Frieze patterns (in the sense of Conway and Coxeter) are in close connection to triangulations of polygons. Broline, Crowe and Isaacs have assigned a symmetric matrix to each polygon triangulation and computed the determinant. In this paper we consider d-angulations of polygons and generalize the combinatorial algorithm for computing the entries in the… (More)

- Christine Bessenrodt, Igor Pak
- Eur. J. Comb.
- 2004

We present a general construction of involutions on integer partitions which enable us to prove a number of modulo 2 partition congruences. Introduction The theory of partitions is a beautiful subject introduced by Euler over 250 years ago and is still under intense development [2]. Arguably, a turning point in its history was the invention of the… (More)

- Christine Bessenrodt
- Eur. J. Comb.
- 1991

In 1998, the second author raised the problem of classifying the irreducible characters of Sn of prime power degree. Zalesskii proposed the analogous problem for quasi-simple groups, and he has, in joint work with Malle, made substantial progress on this latter problem. With the exception of the alternating groups and their double covers, their work… (More)

Abstract. Considering a question of E. R. Berlekamp, Carlitz, Roselle, and Scoville gave a combinatorial interpretation of the entries of certain matrices of determinant 1 in terms of lattice paths. Here we generalize this result by refining the matrix entries to be multivariate polynomials, and by determining not only the determinant but also the Smith… (More)

We show how to extend the theory of generalized Reynolds ideals, as introduced by B.Külshammer, from symmetric algebras to arbitrary finite-dimensional algebras (in positive characteristic). This provides new invariants of the derived module categories of finite-dimensional algebras, extending recent results in [6] for symmetric algebras.