3.2k citations
- Centre National de la Recherche ScientifiqueFR238 papers
- Helmholtz-Zentrum Berlin für Materialien und EnergieDE229 papers
- Technische Universität BerlinDE205 papers
- Deutsches Zentrum für Luft- und Raumfahrt e. V. (DLR)DE122 papers
- University of CambridgeGB113 papers
- Humboldt-Universität zu BerlinDE110 papers
- ETH ZurichCH105 papers
- Zuse Institute BerlinDE105 papers
- University of GenevaCH95 papers
- Sorbonne UniversitéFR94 papers
- Leiden UniversityNL91 papers
- Princeton UniversityUS90 papers
12 papers · 2 filters
Laplacian ideals, arrangements, and resolutions
Anton Dochtermann, Raman Sanyal
The Laplacian matrix of a graph G describes the combinatorial dynamics of the Abelian Sandpile Model and the more general Riemann-Roch theory of G. The lattice ideal associated to…
Many projectively unique polytopes
Karim A. Adiprasito, Günter M. Ziegler
We construct an infinite family of 4-polytopes whose realization spaces have dimension smaller or equal to 96. This in particular settles a problem going back to Legendre and Stein…
How many colors guarantee a rainbow matching?
Roman Glebov, Benny Sudakov, Tibor Szabó
Given a coloring of the edges of a multi-hypergraph, a rainbow t-matching is a collection of t disjoint edges, each having a different color. In this note we study the problem of f…
Counting factorizations of Coxeter elements into products of reflections
Guillaume Chapuy, Christian Stump
In this paper, we count factorizations of Coxeter elements in well-generated complex reflection groups into products of reflections. We obtain a simple product formula for the expo…
Biased Games On Random Boards
Asaf Ferber, Roman Glebov, Michael Krivelevich +1
In this paper we analyze biased Maker-Breaker games and Avoider-Enforcer games, both played on the edge set of a random board $G\sim \gnp$. In Maker-Breaker games there are two pla…
The biased odd cycle game
Asaf Ferber, Roman Glebov, Michael Krivelevich +4
In this paper we consider biased Maker-Breaker games played on the edge set of a given graph . We prove that for every and large enough , there exists a constant fo…