Related papers: Discrete Polymatroids
Rough set theory is a useful tool to deal with uncertain, granular and incomplete knowledge in information systems. And it is based on equivalence relations or partitions. Matroid theory is a structure that generalizes linear independence…
We make progress towards characterizing the algebraic matroid of the determinantal variety defined by the minors of fixed size of a matrix of variables. Our main result is a novel family of base sets of the matroid, which characterizes the…
We present a systematic methodology to determine and locate analytically isolated periodic points of discrete and continuous dynamical systems with algebraic nature. We apply this method to a wide range of examples, including a…
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…
In this paper we consider monomial localizations of monomial ideals and conjecture that a monomial ideal is polymatroidal if and only if all its monomial localizations have a linear resolution. The conjecture is proved for squarefree…
Many mathematicians have been studying various degenerate versions of special polynomials and numbers in some arithmetic and combinatorial aspects. Our main focus here is a new type of degenerate poly-Euler polynomials and numbers. This…
We study multiple orthogonal polynomials exploiting their explicit determinantal representation in terms of moments. Our reasoning follows that applied to solve the Hermite-Pad\'{e} approximation and interpolation problems. We study also…
Let $M$ be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. Locked subsets characterize nontrivial facets of the…
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 determine the complete structure of the symmetry algebras associated with the N-body Calogero-Moser system and its maximally superintegrable discretization. We prove that the discretization naturally leads to a nontrivial deformation of…
We introduce Poisson double algebroids, and the equivalent concept of double Lie bialgebroid, which arise as second-order infinitesimal counterparts of Poisson double groupoids. We develop their underlying Lie theory, showing how these…
The mutually enriching relationship between graphs and matroids has motivated discoveries in both fields. In this paper, we exploit the similar relationship between embedded graphs and delta-matroids. There are well-known connections…
Using Tutte's combinatorial definition of a map we define a $\Delta$-matroid purely combinatorially and show that it is identical to Bouchet's topological definition.
This thesis is basically devoted to matroids -- fundamental structure of combinatorial optimization -- though some of our results concern simplicial complexes, or Euclidean spaces. We study old and new problems for these structures, with…
The twist polynomial of a delta-matroid was recently introduced by Yan and Jin, who proved a characterization of binary delta-matroids with twist monomials. In this paper, we extend this result to all delta-matroids by proving that any…
A hyperbolic reflection group is a discrete group generated by reflections in the faces of an $n$-dimensional hyperbolic polyhedron. This survey article is dedicated to the study of arithmetic hyperbolic reflection groups with an emphasis…
Matroids and semigraphoids are discrete structures abstracting and generalizing linear independence among vectors and conditional independence among random variables, respectively. Despite the different nature of conditional independence…
In the early 1990's, Billera and Sturmfels introduced the monotone path polytope (MPP), a special case of the general theory of fiber polytopes that associates a polytope to a pair $(P,\varphi)$ of a polytope $P$ and linear functional…
The closure of a discrete exponential family is described by a finite set of equations corresponding to the circuits of an underlying oriented matroid. These equations are similar to the equations used in algebraic statistics, although they…
Delta-matroids are "type B" generalizations of matroids in the same way that maximal orthogonal Grassmannians are generalizations of Grassmannians. A delta-matroid analogue of the Tutte polynomial of a matroid is the interlace polynomial.…