Related papers: Relationship between the second type of covering-b…
Given a set of matrices, modeled as samples of a matrix-valued function, we suggest a method to approximate the underline function using a product approximation operator. This operator extends known approximation methods by exploiting the…
Internal preneighbourhood spaces inside any finitely complete category with finite coproducts and proper factorisation structure were first introduced in my earlier paper. This paper proposes a closure operation on internal preneighbourhood…
For a small quantaloid $\mathcal{Q}$, a $\mathcal{Q}$-closure space is a small category enriched in $\mathcal{Q}$ equipped with a closure operator on its presheaf category. We investigate $\mathcal{Q}$-closure spaces systematically with…
We present an adaptation of two recent low-rank approximation technique proposed for first-order model reduction systems to the second-order systems. The resulting reduced order models are guaranteed to keep the second order structure which…
Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of direction constraints between the points is equivalent to the…
The Packing/Covering Conjecture was introduced by Bowler and Carmesin motivated by the Matroid Partition Theorem by Edmonds and Fulkerson. A packing for a family $ (M_i: i\in\Theta) $ of matroids on the common edge set $ E $ is a system $…
We study the augmented Bergman complex of a closure operator on a finite set, which interpolates between the order complex of proper flats and the independence complex of the operator. In 2020, Braden, Huh, Matherne, Proudfoot, and Wang…
It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudoline arrangements, i.e., they are not topological. In this…
We give a deterministic polynomial time $2^{O(r)}$-approximation algorithm for the number of bases of a given matroid of rank $r$ and the number of common bases of any two matroids of rank $r$. To the best of our knowledge, this is the…
We investigate the relationship between mapping cones and matrix ordered *-vector spaces (i.e., abstract operator systems). We show that to every mapping cone there is an associated operator system on the space of n-by-n complex matrices,…
In this paper we introduce an enclosure of the numerical range of a class of rational operator functions. In contrast to the numerical range the presented enclosure can be computed exactly in the infinite dimensional case as well as in the…
In this paper, we will answer one of the questions proposed by Bodur, Del~Pia, Dey, Molinaro and Pokutta in 2017. Specifically, we show that the k-aggregation closure of a covering set is a polyhedron. The proof technique is based on an…
In this work, we consider robust submodular maximization with matroid constraints. We give an efficient bi-criteria approximation algorithm that outputs a small family of feasible sets whose union has (nearly) optimal objective value. This…
The notion of computability closure has been introduced for proving the termination of the combination of higher-order rewriting and beta-reduction. It is also used for strengthening the higher-order recursive path ordering. In the present…
Given a collection S of subsets of some set U, and M a subset of U, the set cover problem is to find the smallest subcollection C of S such that M is a subset of the union of the sets in C. While the general problem is NP-hard to solve,…
This work shows several direct and recursive constructions of ordered covering arrays using projection, fusion, column augmentation, derivation, concatenation and cartesian product. Upper bounds on covering codes in NRT spaces are also…
We study a closure operator derived from the matrix endofunctor on the category of rings with unity. We investigate the invariance of various ring-theoretic properties under this operator. A key finding is the decisive nature of this…
The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…
Model-order reduction techniques allow the construction of low-dimensional surrogate models that can accelerate engineering design processes. Often, these techniques are intrusive, meaning that they require direct access to underlying…
We study the duals of a certain class of finite-dimensional operator systems, namely the class of operator systems associated to tolerance relations on finite sets or equivalently the class of operator systems that are associated with…