No abstract uploaded!

In these notes we collect some results about finite-dimensional representations of $U_{q}(\mathfrak {gl}(1\mid1))$ and related invariants of framed tangles, which are well-known to experts but difficult to find in the literature. In particular, we give an explicit description of the ribbon structure on the category of finite-dimensional $U_{q}(\mathfrak {gl}(1\mid1))$ -representations and we use it to construct the corresponding quantum invariant of framed tangles. We explain in detail why this invariant vanishes on closed links and how one can modify the construction to get a non-zero invariant of framed closed links. Finally we show how to obtain the Alexander polynomial by considering the vector representation of $U_{q}(\mathfrak {gl}(1\mid1))$ .

This paper studies the capacity allocation game between duopolistic airlines which could offer callable products. Previous literature has shown that callable products provide a riskless source of additional rev- enue for a monopolistic airline. We examine the impact of the introduction of callable products on the revenues and the booking limits of duopolistic airlines. The analytical results demonstrate that, when there is no spill of low-fare customers, offering callable products is a dominant strategy of both airlines and provides Pareto gains to both airlines. When customers of both fare classes spill, offering callable products is no longer a dominant strategy and may harm the revenues of the airlines. Numerical ex- amples demonstrate that whether the two airlines offer callable products and whether offering callable products is beneficial to the two airlines mainly depends on their loads and capacities. Specifically, when the difference between the loads of the airlines is large, the loads of the airlines play the most important role. When the difference between the loads of the airlines is small, the capacities of the airlines play the most important role. Moreover, numerical examples show that the booking limits of the two airlines in the case with callable products are always higher than those in the case without callable products.

We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy invariance of homologies of digraphs and the relation between the fundamental group of the digraph and its first homology group. The category of (undirected) graphs can be identified by a natural way with a full subcategory of digraphs. Thus we obtain also consistent homology and homotopy theories for graphs.

No abstract uploaded!