1 citations · 2 across the 8 of their papers we have counts for
10 papers
Benchmarks in Leipzig
Andrei Balakin, Miklós Bóna, Marie-Charlotte Brandenburg +45
Between April 1 and May 15, 2026, a group of 49 mathematicians compiled a dataset of research-level mathematics questions with known answers. Most of the work was done during the t…
How to bounce your canon permutation
Danai Deligeorgaki, Krishna Menon
We study a new class of palindromic descent polynomials. Given a Dyck path of semilength and a permutation of size , one can label the up-steps and down-steps of …
Canon Permutation Posets
Matthias Beck, Danai Deligeorgaki
A permutation of the multiset is a canon permutation if the subsequence formed by the th copy of each element of is identical for…
Colored Multiset Eulerian Polynomials
Danai Deligeorgaki, Bin Han, Liam Solus
Colored multiset Eulerian polynomials are a common generalization of MacMahon's multiset Eulerian polynomials and the colored Eulerian polynomials, both of which are known to satis…
Combinatorics of generalized parking-function polytopes
Margaret M. Bayer, Steffen Borgwardt, Teressa Chambers +8
For , a -parking function is defined to be a sequence of positive integers whose nondecreasing rearra…
Ehrhart Bounds for Panhandle and Paving Matroids Through Enumeration of Chain Forests
Danai Deligeorgaki, Daniel McGinnis, Andrés R. Vindas-Meléndez
Panhandle matroids are a specific family of lattice-path matroids corresponding to panhandle-shaped Ferrers diagrams. Their matroid polytopes are the subpolytopes carved from a hyp…
Inequalities for -vectors of Lattice Polytopes
Matthias Beck, Danai Deligeorgaki, Max Hlavacek +1
The Ehrhart polynomial of a lattice polytope counts the number of integer points in the -th integral dilate of . The -vector of , introduced by…
Combinatorial and algebraic perspectives on the marginal independence structure of Bayesian networks
Danai Deligeorgaki, Alex Markham, Pratik Misra +1
We consider the problem of estimating the marginal independence structure of a Bayesian network from observational data, learning an undirected graph we call the unconditional depe…
A Transformational Characterization of Unconditionally Equivalent Bayesian Networks
Alex Markham, Danai Deligeorgaki, Pratik Misra +1
We consider the problem of characterizing Bayesian networks up to unconditional equivalence, i.e., when directed acyclic graphs (DAGs) have the same set of unconditional -separa…
Smallest graphs with given automorphism group
Danai Deligeorgaki
For a finite group , denote by the minimum number of vertices of any graph having . In this paper, we prove that , with specified…