Related papers: Labelling Schubert intersections in the Grassmania…
We consider the problem of determining Gr\"obner bases of binomial ideals associated with linear error correcting codes. Computation of Gr\"obner bases of linear codes have become a topic of interest to many researchers in coding theory…
A magic labelling of a graph $G$ with magic sum $s$ is a labelling of the edges of $G$ by nonnegative integers such that for each vertex $v\in V$, the sum of labels of all edges incident to $v$ is equal to the same number $s$. Stanley gave…
In the literature, the notion of discrepancy is used in several contexts, even in the theory of graphs. Here, for a graph $G$, $\{-1, 1\}$ labels are assigned to the edges, and we consider a family $\mathcal{S}_G$ of (spanning) subgraphs of…
This paper explores the possible use of Schubert cells and Schubert varieties in finite geometry, particularly in regard to the question of whether these objects might be a source of understanding of ovoids or provide new examples. The main…
The intersection graph of a family of sets $\{S_{1},S_{2},\ldots,S_{n}\}$ is a graph whose vertex set is $\{S_{1},S_{2},\ldots,S_{n}\}$ and two distinct vertices are adjacent if the intersection of the corresponding sets is non-empty.…
By extending the notion of grid classes to include infinite grids, we establish a structural characterisation of the simple permutations in Av(4231, 35142, 42513, 351624), a pattern class which has three different connections with algebraic…
Generating trees are a useful technique in the enumeration of various combinatorial objects, particularly restricted permutations. Quite often the generating tree for the set of permutations avoiding a set of patterns requires infinitely…
Horospherical Schubert varieties are determined. It is shown that the stabilizer of an arbitrary point in a Schubert variety is a strongly solvable algebraic group. The connectedness of this stabilizer subgroup is discussed. Moreover, a new…
The Grassmannian of affine subspaces is a natural generalization of both the Euclidean space, points being zero-dimensional affine subspaces, and the usual Grassmannian, linear subspaces being special cases of affine subspaces. We show…
We describe a direct connection between the representation theory of the general linear group and classical Schubert calculus on the Grassmannian, which goes via the Chern-Weil theory of characteristic classes. We also explain why the…
This survey paper describes Springer fibers, which are used in one of the earliest examples of a geometric representation. We will compare and contrast them with Schubert varieties, another family of subvarieties of the flag variety that…
Point feature map labeling is a geometric problem, in which a set of input points must be labeled with a set of disjoint rectangles (the bounding boxes of the label texts). Typically, labeling models either use internal labels, which must…
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…
We propose a combinatorial model for the Schubert structure constants of the complete flag manifold when one of the factors is Grassmannian.
The goal of the paper is twofold: on one side it provides an order structure on the set of all maximal chains in the Bruhat poset of Schubert varieties in a Grassmann variety; on the other hand, using this order structure, it works out…
Recently, Chmutov introduced the partial duality of ribbon graphs, which can be regarded as a generalization of the classical Euler-Poincar\'e duality. The partial-dual genus polynomial $^\partial\varepsilon_G(z)$ is an enumeration of the…
In a series of papers, P. Blasiak et al. developed a wide-ranging generalization of Bell numbers (and of Stirling numbers of the second kind) that appears to be relevant to the so-called Boson normal ordering problem. They provided a…
A smooth projective variety with an action of a torus admits a cell decomposition, called the Bialynicki-Birula decomposition. Singularities of the closures of these cells are not well-known. One of the examples of such closures is a…
After a clustering solution is generated automatically, labelling these clusters becomes important to help understanding the results. In this paper, we propose to use a Mutual Information based method to label clusters of journal articles.…
We prove that certain numbers occurring in a problem of paths enumeration, studied by Niederhausen (Catlan Traffic at the Beach, The Electronic Journal of Combinatorics, 9, (2002), 1--17), are top intersection numbers in the cohomology ring…