Freie Universität Berlin

output

19922026

most citedHelical liquids and Majorana bound states in quantum wires

3.2k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing 2018 · math.COShow all

7 papers · 2 filters

math.CO2018★ 9 cited

Hollow polytopes of large width

Giulia Codenotti, Francisco Santos

We construct a hollow lattice polytope (resp. a hollow lattice simplex) of dimension $14$ (resp. $404$ ) and of width $15$ (resp. $408$ ). They are the first known hollow lattice pol…

math.CO2018★ 1 cited

Every Collinear Set in a Planar Graph Is Free

Vida Dujmović, Fabrizio Frati, Daniel Gonçalves +2

We show that if a planar graph $G$ has a plane straight-line drawing in which a subset $S$ of its vertices are collinear, then for any set of points, $X$ , in the plane with $|X|=|S…

math.CO2018★ 2 cited

Average Betti numbers of induced subcomplexes in triangulations of manifolds

Giulia Codenotti, Francisco Santos, Jonathan Spreer

We study a variation of Bagchi and Datta's $σ$ -vector of a simplicial complex $C$ , whose entries are defined as weighted averages of Betti numbers of induced subcomplexes of $C$ . W…

math.CO2018★ 4 cited

Ehrhart-equivalent $3$ -polytopes are equidecomposable

Jakob Erbe, Christian Haase, Francisco Santos

We show that if two lattice $3$ -polytopes $P$ and $P^{'}$ have the same Ehrhart function then they are $GL_{3} (Z)$ -equidecomposable; that is, they can be partit…

math.CO2018★ 4 cited

Short proof of two cases of Chvátal's conjecture

Jorge Olarte, Francisco Santos, Jonathan Spreer

In 1974 Chvátal conjectured that no intersecting family $F$ in a downset can be larger than the largest star. In the same year Kleitman and Magnanti proved the conjecture…

math.CO2018★ 5 cited

Colouring set families without monochromatic k-chains

Shagnik Das, Roman Glebov, Benny Sudakov +1

A coloured version of classic extremal problems dates back to Erdős and Rothschild, who in 1974 asked which $n$ -vertex graph has the maximum number of 2-edge-colourings without mon…

math.CO2018★ 3 cited

Smooth centrally symmetric polytopes in dimension 3 are IDP

Matthias Beck, Christian Haase, Akihiro Higashitani +4

In 1997 Oda conjectured that every smooth lattice polytope has the integer decomposition property. We prove Oda's conjecture for centrally symmetric $3$ -dimensional polytopes, by s…