activity
20052026
most citedTight lower bounds on the number of faces of the Minkowski sum of convex polytopes via the Cayley trick

3 citations · 11 across the 16 of their papers we have counts for

collaborators

19 papers

math.CO2026

Interval hypergraphic polytopes (or deformed associahedra), Tamari interval posets, and weeping willows

Jose Bastidas, Félix Gélinas, Vincent Pilaud +3

For a hypergraph on , the hypergraphic polytope is the Minkowski sum of the standard simplices for all .…

cs.IT2025

List decoding of toric codes

Silouanos Brazitikos, Theodoulos Garefalakis, Eleni Tzanaki

Polynomial evaluation codes hold a prominent place in coding theory. In this work, we study the problem of list decoding for a general class of polynomial evaluation codes, also kn…

math.CO2023

Enumerating regions of Shi arrangements per Weyl Cone

Aram Dermenjian, Eleni Tzanaki

Given a Shi arrangement , it is well-known that the total number of regions is counted by the parking number of type and the total number of regions in the domin…

math.CO2022

Refined Lattice Path Enumeration and Combinatorial Reciprocity

Henri Mühle, Eleni Tzanaki

It is well known that the set of -Dyck paths with a fixed height and a fixed amount of valleys is counted by the Fuß-Narayana numbers. In this article, we consider the set of $m…

math.CO2021

Symmetric decompositions, triangulations and real-rootedness

Christos A. Athanasiadis, Eleni Tzanaki

Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Brändén and Solus…

math.CO2020

Patterns in Shi tableaux and Dyck paths

Myrto Kallipoliti, Robin Sulzgruber, Eleni Tzanaki

Shi tableaux are special binary fillings of certain Young diagrams which arise in the study of Shi hyperplane arrangements related to classical root systems. For type , the set…