Related papers: Generalizing the Multiple Exchange Property for Ma…
In 1991, Wei introduced generalized minimum Hamming weights for linear codes and showed their monotonicity and duality. Recently, several authors extended these results to the case of generalized minimum poset weights by using different…
This article studies two notions of generalized matroid representations motivated by algorithmic information theory and cryptographic secret sharing. The first (entropic representability) involves discrete random variables, while the second…
A polynomial f is said to have the half-plane property if there is an open half-plane H, whose boundary contains the origin, such that f is non-zero whenever all the variables are in H. This paper answers several open questions regarding…
We generalize the 1/3-2/3 conjecture from partially ordered sets to antimatroids: we conjecture that any antimatroid has a pair of elements x,y such that x has probability between 1/3 and 2/3 of appearing earlier than y in a uniformly…
We introduce greedy weights of matroids, inspired by those for linear codes. We show that a Wei duality holds for two of these types of greedy weights for matroids. Moreover we show that in the cases where the matroids involved are…
In this paper we give a necessary and sufficient criterion for representability of a matroid over an algebraic closed field. This leads to an algorithm, based on an extension of Groebner Bases, in order to decide if a given matroid is…
We discuss a conjecture of Ingleton on excluded minors for base-orderability, and, extending a result he stated, we prove that infinitely many of the matroids that he identified are excluded minors for base-orderability, as well as for the…
Introduced by Ardila (J. Combin. Theory Ser. A, 2003), the Catalan matroid is obtained by defining the bases of the matroid using Dyck paths from $(0,0)$ to $(n,n)$. Further research has gone into the topic, with variants like lattice path…
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 family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-level matroids generalize series-parallel graphs, which have been already…
Let X be a closed subspace of a Banach space Y and J be the inclusion map. We say that the pair (X,Y) has the Daugavet property if for every rank one bounded linear operator T from X to Y the following equality \|J+T\|=1+\|T\| holds. A new…
We consider the class of {\em separable} $k$-hypergraphs, which can be viewed as uniform analogs of threshold Boolean functions, and the class of {\em equatable} $k$-hypergraphs. We show that every $k$-hypergraph is either separable or…
In the present paper, we introduce a multibasic extension of the Ehrhart theory. We give a multibasic extension of Ehrhart polynomials and Ehrhart series. We also show that an analogue of Ehrhart reciprocity holds for multibasic Ehrhart…
We introduce an idempotent analogue of the exterior algebra for which the theory of tropical linear spaces (and valuated matroids) can be seen in close analogy with the classical Grassmann algebra formalism for linear spaces. The top wedge…
In inference problems involving a multi-dimensional parameter $\theta$, it is often natural to consider decision rules that have a risk which is invariant under some group $G$ of permutations of $\theta$. We show that this implies that the…
This paper proposes swaps on two important new measures of generalized variance, namely the maximum eigenvalue and trace of the covariance matrix of the assets involved. We price these generalized variance swaps for Barndorff-Nielsen and…
This paper establishes necessary and sufficient conditions for a bi-amalgamation to inherit the arithmetical property, with applications on the weak global dimension and transfer of the semihereditary property. The new results compare to…
Properties of Boolean functions on the hypercube invariant with respect to linear transformations of the domain are among the most well-studied properties in the context of property testing. In this paper, we study the fundamental class of…
Rough sets are efficient for data pre-processing in data mining. As a generalization of the linear independence in vector spaces, matroids provide well-established platforms for greedy algorithms. In this paper, we apply rough sets to…
The main questions raised in this paper are to find the sufficient conditions that make multi-sublinear operators $T$ and their commutators ${T_{\prod \vec b }}$, ${T_{\sum {\vec b} }}$ to be bounded on three kinds of generalized weighted…