Sciweavers

1346 search results - page 103 / 270
» On the number of rectangular partitions
Sort
View
EJC
2006
14 years 10 months ago
An iterative-bijective approach to generalizations of Schur's theorem
Abstract. We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colo...
Sylvie Corteel, Jeremy Lovejoy
JCT
2006
64views more  JCT 2006»
14 years 10 months ago
Inequalities between Littlewood-Richardson coefficients
We prove that a conjecture of Fomin, Fulton, Li, and Poon, associated to ordered pairs of partitions, holds for many infinite families of such pairs. We also show that the bounded ...
François Bergeron, Riccardo Biagioli, Merce...
PAAPP
1998
149views more  PAAPP 1998»
14 years 9 months ago
Optimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
Sumanta Guha
JCT
1998
68views more  JCT 1998»
14 years 9 months ago
Rook Theory and t-Cores
If t is a positive integer, then a partition of a non-negative integer n is a t−core if none of the hook numbers of the associated Ferrers-Young diagram is a multiple of t. These...
James Haglund, Ken Ono, Lawrence Sze
WWW
2002
ACM
15 years 10 months ago
Accelerated focused crawling through online relevance feedback
The organization of HTML into a tag tree structure, which is rendered by browsers as roughly rectangular regions with embedded text and HREF links, greatly helps surfers locate an...
Soumen Chakrabarti, Kunal Punera, Mallela Subraman...