On polynomial digraphs

Let Φ(x,y) be a bivariate polynomial with complex coefficients. The zeroes of Φ(x,y) are given a combinatorial structure by considering them as arcs of a directed graph G(Φ). This paper studies some relationship between the polynomial Φ(x,y) and the structure of G(Φ).     

On the Duals of Segre Varieties

The reflexivity, the (semi-)ordinariness, the dimension of dual varieties and the structure of Gauss maps are discussed for Segre varieties, where a Segre variety is the image of the product of two or more projective spaces under Segre embedding. A generalization is given to a theorem of A. Hefez and A. Thorup on Segre varieties of two projective spaces. In particular, a new proof is given to a theorem of F. Knop, G. Menzel, I. M. Gelfand, M.M. Kapranov and A. V. Zelevinsky that states a necessary and sufficient condition for Segre varieties to have codimension one duals. On the other hand, a negative answer is given to a problem raised by S. Kleiman and R. Piene as follows: For a projective variety of dimension at least two, do the Gauss map and the natural projection from the conormal variety to the dual variety have the same inseparable degree?     

On Positive and Weakly Positive Implicative BCI-Algebras

Prove that the notion of positive implicative BCI-algebras coincides with that of weakly positive implicative BCI-algebras, thus the whole results in the latter are still true in the former, in particular, one of these results answers definitely the first half of J. Meng and X.L. Xin’s open problem: Does the class of positive implicative BCI-algebras form a variety? The second half of the same problem is: What properties will the ideals of such an algebra have? Here, some further properties are obtained.     

Bruhat intervals as rooks on skew Ferrers boards

We characterise the permutations π such that the elements in the closed lower Bruhat interval [id,π] of the symmetric group correspond to non-taking rook configurations on a skew Ferrers board. It turns out that these are exactly the permutations π such that [id,π] corresponds to a flag manifold defined by inclusions, studied by Gasharov and Reiner.Our characterisation connects the Poincaré polynomials (rank-generating function) of Bruhat intervals with q-rook polynomials, and we are able to compute the Poincaré polynomial of some particularly interesting intervals in the finite Weyl groups An and Bn. The expressions involve q-Stirling numbers of the second kind, and for the group An putting q=1 yields the poly-Bernoulli numbers defined by Kaneko.     

On images of affine spaces

We prove that every non-degenerate toric variety, every homogeneous space of a connected linear algebraic group without non-constant invertible regular functions, and every variety covered by affine spaces admit a surjective morphism from an affine space.     

Disjoint Paths in Decomposable Digraphs

The k‐linkage problem is as follows: given a digraph and a collection of k terminal pairs such that all these vertices are distinct; decide whether D has a collection of vertex disjoint paths such that is from to for . A digraph is k‐linked if it has a k‐linkage for every choice of 2k distinct vertices and every choice of k pairs as above. The k‐linkage problem is NP‐complete already for [11] and there exists no function such that every ‐strong digraph has a k‐linkage for every choice of 2k distinct vertices of D [17]. Recently, Chudnovsky et al. [9] gave a polynomial algorithm for the k‐linkage problem for any fixed k in (a generalization of) semicomplete multipartite digraphs. In this article, we use their result as well as the classical polynomial algorithm for the case of acyclic digraphs by Fortune et al. [11] to develop polynomial algorithms for the k‐linkage problem in locally semicomplete digraphs and several classes of decomposable digraphs, including quasi‐transitive digraphs and directed cographs. We also prove that the necessary condition of being ‐strong is also sufficient for round‐decomposable digraphs to be k‐linked, obtaining thus a best possible bound that improves a previous one of . Finally we settle a conjecture from [3] by proving that every 5‐strong locally semicomplete digraph is 2‐linked. This bound is also best possible (already for tournaments) [1].     

Semilattice transversals of regular bands I

Every regular band can be isomorphically embedded into a regular band which has a semilattice transversal. The latter constitute the variety of regular split bands, whose subvariety lattice is isomorphic to the lattice of regular band varieties.     

Laurent polynomials and Eulerian numbers

Duistermaat and van der Kallen show that there is no nontrivial complex Laurent polynomial all of whose powers have a zero constant term. Inspired by this, Sturmfels poses two questions: Do the constant terms of a generic Laurent polynomial form a regular sequence? If so, then what is the degree of the associated zero-dimensional ideal? In this note, we prove that the Eulerian numbers provide the answer to the second question. The proof involves reinterpreting the problem in terms of toric geometry.     

A Construction of Sequentially Cohen-Macaulay Graphs

For every simple graph G,a class of multiple clique cluster-whiskered graphs Geπm is introduced,and it is shown that all such graphs are vertex decomposable;thus,the independence simplicial complex IndGeπm is sequentially Cohen-Macaulay.The properties of the graphs Geπm and Gπ constructed by Cook and Nagel are studied,including the enumeration of facets of the complex Ind Gπ and the calculation of Betti numbers of the cover ideal Ic(Geπ").We also prove that the complex △ =IndH is strongly shellable and pure for either a Boolean graph H =Bn or the full clique-whiskered graph H =Gw of G,which is obtained by adding a whisker to each vertex of G.This implies that both the facet ideal I(△) and the cover ideal Ic(H) have linear quotients.