activity
20012021
most citedProdsimplicial-Neighborly Polytopes

12 citations · 31 across the 14 of their papers we have counts for

collaborators

16 papers

math.CO2021

Stacky fans and tropical moduli in polymake

Dominic Bunnett, Michael Joswig, Julian Pfeifle

We investigate geometric embeddings among several classes of stacky fans and algorithms, e.g., to compute their homology. Interesting cases arise from moduli spaces of tropical cur…

math.CO2020

Positive Plücker tree certificates for non-realizability

Julian Pfeifle

We introduce a new method for finding a non-realizability certificate of a simplicial sphere Sigma: we exhibit a monomial combination of classical 3-term Plücker relations that yie…

math.CO2015

Webs of stars or how to triangulate free sums of point configurations

Benjamin Assarf, Michael Joswig, Julian Pfeifle

The triangulations of point configurations which decompose as a free sum are classified in terms of the triangulations of the summands. The methods employ two new kinds of partiall…

math.CO2014★ 4 cited

A Polyhedral Proof of the Matrix Tree Theorem

Aaron Dall, Julian Pfeifle

The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regula…

math.MG2014

Polygons as sections of higher-dimensional polytopes

Arnau Padrol, Julian Pfeifle

We show that every heptagon is a section of a -polytope with vertices. This implies that every -gon with can be obtained as a section of a $(2+\lfloor\frac{n}{7…

math.MG2010★ 7 cited

Polytopality and Cartesian products of graphs

Julian Pfeifle, Vincent Pilaud, Francisco Santos

We study the question of polytopality of graphs: when is a given graph the graph of a polytope? We first review the known necessary conditions for a graph to be polytopal, and we p…