Zobrazeno 1 - 10
of 134
pro vyhledávání: '"Abdi, Ahmad"'
Let $D=(V,A)$ be a digraph. For an integer $k\geq 1$, a $k$-arc-connected flip is an arc subset of $D$ such that after reversing the arcs in it the digraph becomes (strongly) $k$-arc-connected. The first main result of this paper introduces a suffici
Externí odkaz:
http://arxiv.org/abs/2310.19472
A rational number is dyadic if it has a finite binary representation $p/2^k$, where $p$ is an integer and $k$ is a nonnegative integer. Dyadic rationals are important for numerical computations because they have an exact representation in floating-po
Externí odkaz:
http://arxiv.org/abs/2309.04601
Autor:
Abdi, Ahmad, Lee, Dabeen
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 clutter $\mathcal{C}$, where every part has size $q$ and there is a bije
Externí odkaz:
http://arxiv.org/abs/2306.03613
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 the clutter. Let $\mathfrak{A}_{2n}$ be an algorithm that, given any clu
Externí odkaz:
http://arxiv.org/abs/2202.07299
Let $D=(V,A)$ be a digraph. A dicut is a cut $\delta^+(U)\subseteq A$ for some nonempty proper vertex subset $U$ such that $\delta^-(U)=\emptyset$, a dijoin is an arc subset that intersects every dicut at least once, and more generally a $k$-dijoin i
Externí odkaz:
http://arxiv.org/abs/2202.00392
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 $Ax\leq b$ with integral data is \emph{totally dual dyadic} if whenever $\min\{b^\t
Externí odkaz:
http://arxiv.org/abs/2111.05749
Autor:
Abdi, Ahmad1 (AUTHOR), Cornuéjols, Gérard2 (AUTHOR) gc0v@andrew.cmu.edu, Guenin, Bertrand3 (AUTHOR), Tunçel, Levent3 (AUTHOR)
Publikováno v:
Mathematical Programming. Jul2024, Vol. 206 Issue 1/2, p125-143. 19p.
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 $k$-wise intersecting clutter is non-ideal. As evidence for our conject
Externí odkaz:
http://arxiv.org/abs/1912.00614
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 minimum cover. Clean tangled clutters have been instrumental in progress
Externí odkaz:
http://arxiv.org/abs/1908.10629
Publikováno v:
In Journal of Combinatorial Theory, Series B May 2022 154:60-92