Related papers: Geometric Bruhat order on (0,1)-matrices

A reciprocal linear space is the image of a linear space under coordinate-wise inversion. These fundamental varieties describe the analytic centers of hyperplane arrangements and appear as part of the defining equations of the central path…

We give another bijective proof of a result of Corteel and Nadeau. We find a generating function related to unrestricted columns of permutation tableaux. As a consequence, we obtain a sign-imbalance formula for permutation tableaux. We…

This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…

We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…

We create a framework for studying symmetric chain decompositions of families of finite posets based on the geometry of polytopes. Our framework unifies almost all known results regarding symmetric chain decompositions of the Young posets…

In theory of Coxeter groups, bigrassmannian elements are well known as elements which have precisely one left descent and precisely one right descent. In this article, we prove formulas on enumeration of bigrassmannian permutations weakly…

We describe a categorical approach to finite noncommutative geometries. Objects in the category are spectral triples, rather than unitary equivalence classes as in other approaches. This enables to treat fluctuations of the metric and…

We compute the equivariant K-theory of torus fixed points of Cherkis bow varieties of affine type A. We deduce formulas for the generating series of the Euler numbers of these varieties and observe their modularity in certain cases. We also…

We prove a common generalization of the fact that the weighted number of maximal chains in the strong Bruhat order on the symmetric group is ${n \choose 2}!$ for both the code weights and the Chevalley weights. We also define weights which…

Walks on Young's lattice of integer partitions encode many objects of algebraic and combinatorial interest. Chen et al. established connections between such walks and arc diagrams. We show that walks that start at $\varnothing$, end at a…

Let $G$ be a simple algebraic group and $P$ a parabolic subgroup of $G$ with abelian unipotent radical $P^u$, and let $B$ be a Borel subgroup of $G$ contained in P. Let $\mathfrak{p}^u$ be the Lie algebra of $P^u$ and let $L$ be a Levi…

In this paper, we have constructed the higher order k-bonacci matrices and studied some of their basic properties. We have also shown that these matrices satisfying some new and interesting relations in k-bonacci recurrence. This is the…

Matrices allow two products linked by transpose. Biring is algebra which defines on the set two correlated structures of the ring. According to each product we can extend the definition of a quasideterminant given in [1, 2] and introduce…

We study the Chow classes of arbitrary matroids in the Grassmannian. We develop a new combinatorial approach for computing them, by first focusing on snake matroids and then extending our results via valuativity to any matroid. Our main…

Deterministic recursive algorithms for the computation of matrix triangular decompositions with permutations like LU and Bruhat decomposition are presented for the case of commutative domains. This decomposition can be considered as a…

We characterize permutations whose Bruhat graphs can be drawn in the plane and those whose Bruhat graphs can be drawn in the torus. In particular, we show these properties are characterized by avoiding finitely many permutations.

This is a short note on various results about the combinatorial properties of line arrangements in terms of the Chern numbers of the corresponding log surfaces. This resembles the study of the geography of surfaces of general type. We prove…

This paper examines the structure of poset matrices by formulating a set of new construction rules for this purpose. In this direction, the technique of partial composition operation will be introduced as the basis for the construction of…

We prove a general result concerning cyclic orderings of the elements of a matroid. For each matroid $M$, weight function $\omega:E(M)\rightarrow\mathbb{N}$, and positive integer $D$, the following are equivalent. (1) For all $A\subseteq…

We consider combinatorial maps with fixed combinatorial knot numbered with augmenting numeration called normalized knot. We show that knot's normalization doesn't affect combinatorial map what concerns its generality. Knot's normalization…