activity
20132022
most citedLevelness of Order Polytopes

4 citations · 7 across the 5 of their papers we have counts for

collaborators

8 papers

math.CO2022

Perfectly Matchable Set Polynomials and -polynomials for Stable Set Polytopes of Complements of Graphs

Robert Davis, Florian Kohl

A subset of vertices of a graph is called a perfectly matchable set of if the subgraph induced by contains a perfect matching. The perfectly matchable set polynomia…

math.CO2019

Unconditional reflexive polytopes

Florian Kohl, McCabe Olsen, Raman Sanyal

A convex body is unconditional if it is symmetric with respect to reflections in all coordinate hyperplanes. In this paper, we investigate unconditional lattice polytopes with resp…

math.CO2019

Birkhoff polytopes of different type and the orthant-lattice property

Florian Kohl, McCabe Olsen

The Birkhoff polytope, defined to be the convex hull of permutation matrices, is a well studied polytope in the context of the Ehrhart theory. This polytope is known to…

math.CO2018★ 4 cited

Levelness of Order Polytopes

Christian Haase, Florian Kohl, Akiyoshi Tsuchiya

Since their introduction by Stanley~\cite{StanleyOrderPoly} order polytopes have been intriguing mathematicians as their geometry can be used to examine (algebraic) properties of f…

math.CO2017★ 1 cited

Level algebras and -lecture hall polytopes

Florian Kohl, McCabe Olsen

Given a family of lattice polytopes, a common endeavor in Ehrhart theory is the classification of those polytopes in the family that are Gorenstein, or more generally level. In thi…

math.CO2017

Transfer-Matrix Methods meet Ehrhart Theory

Alexander Engström, Florian Kohl

Transfer-Matrix Methods originated in physics where they were used to count the number of allowed particle states on a structure whose width is a parameter. Typically, the numb…

math.CO2016★ 2 cited

Semigroups --- A Computational Approach

Florian Kohl, Yanxi Li, Johannes Rauh +1

The question whether there exists an integral solution to the system of linear equations with non-negative constraints, $A\x = \b, \, \x \ge 0$, where and ${…

math.NT2013

Rademacher-Carlitz Polynomials

Matthias Beck, Florian Kohl

We introduce and study the \emph{Rademacher-Carlitz polynomial} \[ \RC(u, v, s, t, a, b) := \sum_{k = \lceil s \rceil}^{\lceil s \rceil + b - 1} u^{\fl{\frac{ka + t}{b}}} v^k \] wh…