In this work we provide local bifurcation results for equations involving the p-Laplacian in balls. We analyze the continua C n of radial solutions emanating from (l n, p , 0), {l n, p } being the radial eigenvalues of -D p . First, we show that the only nontrivial solutions close to (l n, p , 0) li
A Symmetry Theorem on a Modified Jeu De Taquin
β Scribed by Ilse Fischer
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 285 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
β¦ Synopsis
For their bijective proof of the hook-length formula for the number of standard tableaux of a fixed shape Novelli et al. define a modified jeu de taquin which transforms an arbitrary filling of the Ferrers diagram with 1, 2, . . . , n (tabloid) into a standard tableau. Their definition relies on a total order of the cells in the Ferrers diagram induced by a special standard tableau, however, this definition also makes sense for the total order induced by any other standard tableau. Given two standard tableaux P, Q of the same shape we show that the number of tabloids which result in P if we perform the modified jeu de taquin with respect to the total order induced by Q is equal to the number of tabloids which result in Q if we perform the modified jeu de taquin with respect to P. This symmetry theorem extends to skew shapes and shifted skew shapes.
π SIMILAR VOLUMES
A new approach for gray-level image coding using binary morphological operations on the image bit-planes is presented. This approach is based on a Geometric Sampling Theorem (GST), and on a modified morphological skeleton. The theorem, which is proved in this paper, states conditions for the reconst
In this paper we study some purely mathematical considerations that arise in a paper of Cooper on the foundations of thermodynamics that was published in this journal. Connections with mathematical utility theory are studied and some errors in Cooper's paper are rectified.
A min-max property of bipartite graphs is stated; it is a variation on the theorem of Kiinig 'maximum x%zhing= minimum covering'; one shows that a c&&i inequaliw holds for any graph and the equality for bipartite graphs is derived from a simple network flow model. -. ## Various extensions of the t