Related papers: The cyclic flats of $\mathcal{L}$-polymatroids
There is a well-known asymptotic formula, due to W. M. Schmidt (1968) for the number of full-rank integer lattices of index at most $V$ in $\mathbb{Z}^n$. This set of lattices $L$ can naturally be partitioned with respect to the factor…
This paper studies structural aspects of lattice path matroids, a class of transversal matroids that is closed under taking minors and duals. Among the basic topics treated are direct sums, duals, minors, circuits, and connected flats. One…
Locally symmetric spaces like $SL(n,\mathbb Z)\backslash SL_n(\mathbb R)/SO(n)$ contain immersed compact flat manifolds of dimension equal to the real rank. We give a lower bound for the contribution of these cycles to the homology of…
We provide evidence for five long-standing, basis-exchange conjectures for matroids by proving them for the enormous class of sparse paving matroids. We also explore the role that these matroids may play in the following problem: as a…
We introduce and study several combinatorial properties of a class of symmetric polynomials from the point of view of integrable vertex models in finite lattice. We introduce the $L$-operator related with the $U_q(sl_2)$ $R$-matrix, and…
We consider toroidal asymmetric orbifolds of the heterotic string preserving all 16 supercharges, developing a general formalism to study components of the moduli space characterized by rank reduction of the gauge group. In particular we…
A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced. More precisely, after introducing this independence…
We introduce the concept of basis for a lattice. This basis plays a vital role to determine the completeness and consistency of the lattice. Weighted lattices are introduced and its complexity is formulated. Some axiomatic systems,…
We define Chern-Schwartz-MacPherson (CSM) cycles of an arbitrary matroid. These are balanced weighted fans supported on the skeleta of the corresponding Bergman fan. In the case that the matroid arises from a complex hyperplane arrangement…
We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…
Let $\mathfrak{g}$ be a hyperbolic Kac-Moody algebra of rank $2$. We give a polyhedral realization of the crystal basis for the extremal weight module of extremal weight $\lambda$, where $\lambda$ is an integral weight whose Weyl group…
In this paper we introduce discrete polymatroids satisfying the one-sided strong exchange property and show that they are sortable (as a consequence their base rings are Koszul) and that they satisfy White's conjecture. Since any pruned…
Finite matroids are combinatorial structures that express the concept of linear independence. In 1964, G.-C. Rota conjectured that the coefficients of the "characteristic polynomial" of a matroid $M$, polynomial whose coefficients enumerate…
In ring theory, the lifting idempotent property (LIP) is related to some important classes of rings: clean rings, exchange rings, local and semilocal rings, Gelfand rings,maximal rings, etc. Inspired by LIP, there were defined lifting…
We initiate the study of a class of polytopes, which we coin polypositroids, defined to be those polytopes that are simultaneously generalized permutohedra (or polymatroids) and alcoved polytopes. Whereas positroids are the matroids arising…
Euclidean lattices occupy a central position in number theory, the geometry of numbers, and modern cryptography. In the present article, the theory of Euclidean lattices is employed to investigate normed $\mathbb{Z}$-modules of finite rank.…
With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…
The reduction of covering decision systems is an important problem in data mining, and covering-based rough sets serve as an efficient technique to process the problem. Geometric lattices have been widely used in many fields, especially…
Inspired by Bruggesser-Mani's line shellings of polytopes, we introduce line shellings for the lattice of flats of a matroid: given a normal complex for a Bergman fan of a matroid induced by a building set, we show that the lexicographic…
We consider certain modules of the symmetric groups whose basis elements are called tabloids. Some of these modules are isomorphic to subspaces of the cohomology rings of subvarieties of flag varieties as modules of the symmetric groups. We…