Related papers: Existence of new inequalities for representable po…
At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid,…
We consider a class of $0$-$1$ polynomial programming termed multiple choice polynomial programming (MCPP) where the constraint requires exact one component per subset of the partition to be $1$ after all the entries are partitioned.…
In this work we study the polytope associated with a 0,1-integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining…
This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…
The problem of error correction in both coherent and noncoherent network coding is considered under an adversarial model. For coherent network coding, where knowledge of the network topology and network code is assumed at the source and…
A matroid base polytope is a polytope in which each vertex has 0,1 coordinates and each edge is parallel to a difference of two coordinate vectors. Matroid base polytopes are described combinatorially by integral submodular functions on a…
We initiate the polyhedral study of the Virtual Network Embedding (VNE) problem, which arises in modern telecommunication networks. We propose new valid inequalities for the so-called flow formulation. We then prove, through a dedicated…
Tree representations of (sets of) symmetric binary relations, or equivalently edge-colored undirected graphs, are of central interest, e.g.\ in phylogenomics. In this context symbolic ultrametrics play a crucial role. Symbolic ultrametrics…
This paper is concerned with a covering problem of Euclidean space by a particular arrangement of cones that are not necessarily full and are allowed to overlap. The problem provides an equivalent geometric reformulation of the solvability…
Designing complex engineered systems requires managing tightly coupled trade-offs between subsystem capabilities and resource requirements. Monotone co-design provides a compositional language for such problems, but its generality does not…
Many important enumerative invariants of a matroid can be obtained from its Tutte polynomial, and many more are determined by two stronger invariants, the $\mathcal{G}$-invariant and the configuration of the matroid. We show that the same…
Motivated by the notion of the inverse $Z$-polynomial introduced by Ferroni, Matherne, Stevens, and Vecchi, we study the equivariant inverse $Z$-polynomial of a matroid equipped with a finite group. We prove that the coefficients of the…
A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phylogenetics is to combine such trees into larger trees, called…
This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then…
Given a subgroup $\mathcal{H}$ of a product of finite groups $\mathcal{G} = \displaystyle\prod^n_{i=1} \Gamma_i$ and $b>1,$ we define a polymatroid $P(\mathcal{H},b).$ If all of the $\Gamma_i$ are isomorphic to $\mathbb{Z}/p\mathbb{Z},$ $p$…
The Folkman-Lawrence topological representation theorem, which states that every (loop-free) oriented matroid of rank $r$ can be represented as a pseudosphere arrangement on the $(r-1)$-dimensional sphere $S^{r-1}$, is one of the most…
We study rank-three matroids, known as point-line configurations, and their associated matroid varieties, defined as the Zariski closures of their realization spaces. Our focus is on determining finite generating sets of defining equations…
Saturating sets are combinatorial objects in projective spaces over finite fields that have been intensively investigated in the last three decades. They are related to the so-called covering problem of codes in the Hamming metric. In this…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…
This article proposes a bivariate polynomial problem for finite-order real matrices that endows a \textit{`sufficient condition'} for a map from the standard vector spaces of finite-order real matrices to the same dimensional bivariate…