6 citations · 12 across the 7 of their papers we have counts for
7 papers
Recognition of algebraic matroids is undecidable
Tobias Boege, Geva Yashfe
We prove that the recognition problem for algebraic matroids is undecidable. Explicitly, this means that there is no algorithm that takes as input a finite set and a function $…
On the recognition problem for limits of entropy functions
Geva Yashfe
We prove that there is no algorithm to decide whether a given integer vector is in the closure of the entropic cone . Equivalently, there is no decision proce…
On graphs, homology bases, and triangulated homology spheres
Karim Adiprasito, Marc Lackenby, Juan Souto +1
We describe a construction that takes as input a graph and a basis for its first homology, and returns a triangulation of a 3-dimensional homology sphere. This makes precise an ide…
On entropic and almost multilinear representability of matroids
Lukas Kühne, Geva Yashfe
This article studies two notions of generalized matroid representations motivated by algorithmic information theory and cryptographic secret sharing. The first (entropic representa…
Von Staudt Constructions for Skew-Linear and Multilinear Matroids
Lukas Kühne, Rudi Pendavingh, Geva Yashfe
This paper compares skew-linear and multilinear matroid representations. These are matroids that are representable over division rings and (roughly speaking) invertible matrices, r…
The Partition Complex: an invitation to combinatorial commutative algebra
Karim Adiprasito, Geva Yashfe
We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that i…
Representability of Matroids by c-Arrangements is Undecidable
Lukas Kühne, Geva Yashfe
For a natural number , a -arrangement is an arrangement of dimension subspaces satisfying the following condition: the sum of any subset of the subspaces has dimension a…