Related papers: The slack realization space of a matroid
The well-known problem stated by A. Meir and L. Moser consists in tiling the unit square with rectangles (details), whose side lengths equal $1/n\times 1/(n+1)$, where indices~$n$ range from 1 to infinity. Recently, Terence Tao has proved…
A number of recent results on optimization problems involving submodular functions have made use of the multilinear relaxation of the problem. These results hold typically in the value oracle model, where the objective function is…
A Euclidean oriented matroid program yields a partial ordering of the cocircuits of its cocircuit graph. We show that every linear extension of that ordering yields a topological sweep and induces a recursive atom-ordering (a shelling of…
In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…
We analyze further a recently proposed S-matrix description of transplanckian scattering in the specific case of axisymmetric collisions of extended sources, where some of the original approximations are not necessary. We confirm the claim…
Given a linear space L in affine space A^n, we study its closure L' in the product of projective lines (P^1)^n. We show that the degree, multigraded Betti numbers, defining equations, and universal Grobner basis of its defining ideal I(L')…
We consider the matrix completion problem with a deterministic pattern of observed entries. In this setting, we aim to answer the question: under what condition there will be (at least locally) unique solution to the matrix completion…
We introduce the self-projecting Grassmannian, an irreducible subvariety of the Grassmannian parametrizing linear subspaces that satisfy a generalized self-duality condition. We study its relation to classical moduli spaces, such as the…
The relation space of a hyperplane arrangement is the vector space of all linear dependencies among the defining forms of the hyperplanes in the arrangement. In this paper, we study the relationship between the relation space and the…
We study the representability problem for torsion-free arithmetic matroids. By using a new operation called "reduction" and a "signed Hermite normal form", we provide and implement an algorithm to compute all the representations, up to…
We show that if the ground set of a matroid can be partitioned into $k\ge 2$ bases, then for any given subset $S$ of the ground set, there is a partition into $k$ bases such that the sizes of the intersections of the bases with $S$ may…
Every tropical ideal in the sense of Maclagan-Rinc\'on has an associated tropical variety, a finite polyhedral complex equipped with positive integral weights on its maximal cells. This leads to the realisability question, ubiquitous in…
Polymorphism offers rich and virtually unexplored space for discovering novel functional materials. To harness this potential approaches capable of both exploring the space of polymorphs and assessing their realizability are needed. One…
We apply a theorem of Gel'fand, Goresky, MacPherson, and Serganova about matroid polytopes to study semistability of partial flags relative to a T-linearized ample line bundle of a flag space F = SL(n)/P where T is a maximal torus in SL(n)…
The intrinsic compliance and high degree of freedom (DoF) of redundant soft manipulators facilitate safe interaction and flexible task execution. However, effective kinematic control remains highly challenging, as it must handle…
One fundamental problem in the field of network coding is to determine the network coding capacity of networks under various network coding schemes. In this thesis, we address the problem with two approaches: matroidal networks and capacity…
In this paper, we propose a novel method for matrix completion under general non-uniform missing structures. By controlling an upper bound of a novel balancing error, we construct weights that can actively adjust for the non-uniformity in…
For the symplectic Grassmannian $\text{SpG}(2,2n)$ of $2$-dimensional isotropic subspaces in a $2n$-dimensional vector space over an algebraically closed field of characteristic zero endowed with a symplectic form and with the natural…
Attribute reduction is a basic issue in knowledge representation and data mining. Rough sets provide a theoretical foundation for the issue. Matroids generalized from matrices have been widely used in many fields, particularly greedy…
We study the geometry of spaces of fitrations on a Noetherian local domain. We introduce a metric $d_1$ on the space of saturated filtrations, inspired by the Darvas metric in complex geometry, such that it is a geodesic metric space. In…