activity
20122023
most citedOn the mixing set with a knapsack constraint

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

collaborators
Showing math.COShow all

6 papers · 1 filter

math.CO2023

From coordinate subspaces over finite fields to ideal multipartite uniform clutters

Ahmad Abdi, Dabeen Lee

Take a prime power , an integer , and a coordinate subspace over the Galois field . One can associate with an -partite -uniform cl…

math.CO2022

Testing idealness in the filter oracle model

Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin +1

A filter oracle for a clutter consists of a finite set along with an oracle which, given any set , decides in unit time whether or not contains a member of th…

math.CO2022

On packing dijoins in digraphs and weighted digraphs

Ahmad Abdi, Gérard Cornuéjols, Michael Zlatin

Let be a digraph. A dicut is a cut for some nonempty proper vertex subset such that , a dijoin is an arc subset that intersects…

math.CO2021

Total dual dyadicness and dyadic generating sets

Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin +1

A vector is \emph{dyadic} if each of its entries is a dyadic rational number, i.e. of the form for some integers with . A linear system wi…

math.CO2019

Idealness of -wise intersecting families

Ahmad Abdi, Gérard Cornuéjols, Tony Huynh +1

A clutter is \emph{-wise intersecting} if every members have a common element, yet no element belongs to all members. We conjecture that, for some integer , every $…

math.CO2019

Clean tangled clutters, simplices, and projective geometries

Ahmad Abdi, Gérard Cornuéjols, Matt Superdock

A clutter is \emph{clean} if it has no delta or the blocker of an extended odd hole minor, and it is \emph{tangled} if its covering number is two and every element appears in a min…