Related papers: Pattern Recognition on Oriented Matroids: The Exis…
We generalize the (signed) Varchenko matrix of a hyperplane arrangement to complexes of oriented matroids and show that its determinant has a nice factorization. This extends previous results on hyperplane arrangements and oriented…
Matroids, particularly linear ones, have been a powerful tool in parameterized complexity for algorithms and kernelization. They have sped up or replaced dynamic programming. Delta-matroids generalize matroids by encapsulating structures…
The secretary problem became one of the most prominent online selection problems due to its numerous applications in online mechanism design. The task is to select a maximum weight subset of elements subject to given constraints, where…
We study the positive Bergman complex B+(M) of an oriented matroid M, which is a certain subcomplex of the Bergman complex B(M) of the underlying unoriented matroid. The positive Bergman complex is defined so that given a linear ideal I…
We enrich Baker and Bowler's theory of matroids over tracts with notions of vectors and covectors. In the case of oriented matroids, these $F$-vectors and $F$-covectors coincide with the usual signed vectors and signed covectors. In the…
A mixed graph is a graph with some directed edges and some undirected edges. We introduce the notion of mixed matroids as a generalization of mixed graphs. A mixed matroid can be viewed as an oriented matroid in which the signs over a fixed…
Matroid is a generalization of many fundamental objects in combinatorial mathematics , and matroid intersection problem is a classical subject in combinatorial optimization . However , only the intersection of two matroids are well…
A transduction provides us with a way of using the monadic second-order language of a structure to make statements about a derived structure. Any transduction induces a relation on the set of these structures. This article presents a…
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…
In a matroid secretary problem, one is presented with a sequence of objects of various weights in a random order, and must choose irrevocably to accept or reject each item. There is a further constraint that the set of items selected must…
In this paper we present a definition of oriented Lagrangian symplectic matroids and their representations. Classical concepts of orientation and this extension may both be thought of as stratifications of thin Schubert cells into unions of…
The non-linear transformations incurred by the rays in an optical system can be suitably described by matrices to any desired order of approximation. In systems composed of uniform refractive index elements, each individual ray refraction…
Leclerc and Zelevinsky, motivated by the study of quasi-commuting quantum flag minors, introduced the notions of strongly separated and weakly separated collections. These notions are closely related to the theory of cluster algebras, to…
Contention resolution schemes have proven to be an incredibly powerful concept which allows to tackle a broad class of problems. The framework has been initially designed to handle submodular optimization under various types of constraints,…
Despite the recent progress in genome sequencing and assembly, many of the currently available assembled genomes come in a draft form. Such draft genomes consist of a large number of genomic fragments (scaffolds), whose order and/or…
The increasing size of neural networks has led to a growing demand for methods of efficient fine-tuning. Recently, an orthogonal fine-tuning paradigm was introduced that uses orthogonal matrices for adapting the weights of a pretrained…
We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…
We extend the notion of representation of a matroid to algebraic structures that we call skew partial fields. Our definition of such representations extends Tutte's definition, using chain groups. We show how such representations behave…
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,…
The adaptive classification of the interference covariance matrix structure for radar signal processing applications is addressed in this paper. This represents a key issue because many detection architectures are synthesized assuming a…