1.7k citations
- Centre National de la Recherche ScientifiqueFR131 papers
- Tel Aviv UniversityIL124 papers
- California Institute of TechnologyUS75 papers
- Weizmann Institute of ScienceIL67 papers
- University of California, Santa CruzUS62 papers
- University of California, BerkeleyUS60 papers
- Rutgers, The State University of New JerseyUS57 papers
- Space Telescope Science InstituteUS46 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR44 papers
- Massachusetts Institute of TechnologyUS42 papers
- Université Paris CitéFR42 papers
- Ben-Gurion University of the NegevIL38 papers
4 papers · 2 filters
Enumeration formulas for Young tableaux in a diagonal strip
Yuliy Baryshnikov, Dan Romik
We derive combinatorial identities, involving the Bernoulli and Euler numbers, for the numbers of standard Young tableaux of certain skew shapes. This generalizes the classical for…
A Differential Model for the Deformation of the Plancherel Growth Process
Eugene Strahov
In the present paper we construct and solve a differential model for the q-analog of the Plancherel growth process. The construction is based on a deformation of the Makrov-Krein c…
Graph coloring with no large monochromatic components
N. Linial, J. Matousek, O. Sheffet +1
For a graph G and an integer t we let mcc_t(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having…
Linear programming bounds for codes via a covering argument
Michael Navon, Alex Samorodnitsky
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to show…