Ahmad Abdi

activity

20122023

T

-joins with at most two terminals

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

collaborators

8 papers

math.CO2023

From coordinate subspaces over finite fields to ideal multipartite uniform clutters

Ahmad Abdi, Dabeen Lee

Take a prime power $q$ , an integer $n \geq 2$ , and a coordinate subspace $S \subseteq GF (q)^{n}$ over the Galois field $GF (q)$ . One can associate with $S$ an $n$ -partite $n$ -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 $V$ along with an oracle which, given any set $X \subseteq V$ , decides in unit time whether or not $X$ contains a member of th…

math.CO2022

On packing dijoins in digraphs and weighted digraphs

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

Let $D = (V, A)$ be a digraph. A dicut is a cut $δ^{+} (U) \subseteq A$ for some nonempty proper vertex subset $U$ such that $δ^{-} (U) = \emptyset$ , 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 $\frac{a}{2 ^{k}}$ for some integers $a, k$ with $k \geq 0$ . A linear system $A x \leq b$ wi…

math.CO2019

Idealness of $k$ -wise intersecting families

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

A clutter is \emph{ $k$ -wise intersecting} if every $k$ members have a common element, yet no element belongs to all members. We conjecture that, for some integer $k \geq 4$ , 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…

math.CO2014★ 2 cited

Packing odd $T$ -joins with at most two terminals

Ahmad Abdi, Bertrand Guenin

Take a graph $G$ , an edge subset $Σ \subseteq E (G)$ , and a set of terminals $T \subseteq V (G)$ where $∣ T ∣$ is even. The triple $(G, Σ, T)$ is called a signed graft. A $T$ -join is odd i…

math.OC2012★ 1 cited

On the mixing set with a knapsack constraint

Ahmad Abdi, Ricardo Fukasawa

The mixing set with a knapsack constraint arises as a substructure in mixed-integer programming reformulations of chance-constrained programs with stochastic right-hand-sides over…