Related papers: Combinatorial flag arrangements
We extend vector configurations to more general objects that have nicer combinatorial and topological properties, called weighted pseudosphere arrangements. These are defined as a weighted variant of arrangements of pseudospheres, as in the…
We propose a theory of combinatorially explicit Schubert polynomials which represent the Schubert classes in the Borel presentation of the cohomology ring of orthogonal flag varieties. We use these polynomials to describe the arithmetic…
The lattice of flats $\mathcal L_M$ of a matroid $M$ is combinatorially well-behaved and, when $M$ is realizable, admits a geometric model in the form of a "Schubert variety of hyperplane arrangement". In contrast, the lattice of flats of a…
The earlier work of the first and the third named authors introduced the algebra $\mathbb{A}_{q,t}$ and its polynomial representation. In this paper we construct an action of this algebra on the equivariant K-theory of certain smooth strata…
The notion of quantum matrix pairs is defined. These are pairs of matrices with non-commuting entries, which have the same pattern of internal relations, q-commute with each other under matrix multiplication, and are such that products of…
The categorified theories known as "doctrines" specify a category equipped with extra structure, analogous to how ordinary theories specify a set with extra structure. We introduce a new framework for doctrines based on double category…
The multiplicative and additive compounds of a matrix play an important role in several fields of mathematics including geometry, multi-linear algebra, combinatorics, and the analysis of nonlinear time-varying dynamical systems. There is a…
We introduce and study different compactifications of the moduli space of $n$ distinct weighted labeled points in a flag of affine spaces. We construct these spaces via the weighted and generalized Fulton-MacPherson compactifications of…
The main topic of this paper is various "hyperbolic" generalizations of the Edmonds-Rado theorem on the rank of intersection of two matroids. We prove several results in this direction and pose a few questions. We also give generalizations…
The Assmus-Mattson theorem gives a way to identify block designs arising from codes. This result was broadened to matroids and weighted designs. In this work we present a further two-fold generalisation: first from matroids to polymatroids…
Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact,…
OSCAR is an innovative new computer algebra system which combines and extends the power of its four cornerstone systems - GAP (group theory), Singular (algebra and algebraic geometry), Polymake (polyhedral geometry), and Antic (number…
The theory of quasirandomness has greatly expanded from its inaugural graph theoretical setting to several different combinatorial objects such as hypergraphs, tournaments, permutations, etc. However, these quasirandomness variants have…
Schubert varieties of hyperplane arrangements, also known as matroid Schubert varieties, play an essential role in the proof of the Dowling-Wilson conjecture and in Kazhdan-Lusztig theory for matroids. We study these varieties as…
We introduce matrix and its block to the Dung's theory of argumentation frameworks. It is showed that each argumentation framework has a matrix representation, and the common extension-based semantics of argumentation framework can be…
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.
A recent line of research has concentrated on exploring the links between analytic and combinatorial theories of submodularity, uncovering several key connections between them. In this context, Lov\'asz initiated the study of matroids from…
We introduce the concept of a higher algebroid, generalizing the notions of an algebroid and a higher tangent bundle. Our ideas are based on a description of (Lie) algebroids as vector bundle comorphisms - differential relations of a…
One generalization of ordinary matroids is symplectic matroids. While symplectic matroids were initially defined by their collections of bases, there has been no cryptomorphic definition of symplectic matroids in terms of circuits. We give…
We introduce a binary matroid M(IAS(G)) associated with a looped simple graph G. M(IAS(G)) classifies G up to local equivalence, and determines the delta-matroid and isotropic system associated with G. Moreover, a parametrized form of its…