Cluster algebras of type A2(1)A_2^{(1)}

In this paper we study cluster algebras \myAA of type $A_2^{(1)}$. We solve the recurrence relations among the cluster variables (which form a T--system of type $A_2^{(1)}$). We solve the recurrence relations among the coefficients of \myAA (which form a Y--system of type $A_2^{(1)}$). In \myAA there is a natural notion of positivity. We find linear bases \BB of \myAA such that positive linear combinations of elements of \BB coincide with the cone of positive elements. We call these bases \emph{atomic bases} of \myAA. These are the analogue of the "canonical bases" found by Sherman and Zelevinsky in type $A_{1}^{(1)}$. Every atomic basis consists of cluster monomials together with extra elements. We provide explicit expressions for the elements of such bases in every cluster. We prove that the elements of \BB are parameterized by \ZZ^3 via their $\mathbf{g}$--vectors in every cluster. We prove that the denominator vector map in every acyclic seed of \myAA restricts to a bijection between \BB and \ZZ^3. In particular this gives an explicit algorithm to determine the "virtual" canonical decomposition of every element of the root lattice of type $A_2^{(1)}$. We find explicit recurrence relations to express every element of \myAA as linear combinations of elements of \BB.Comment: Latex, 40 pages; Published online in Algebras and Representation Theory, springer, 201

Parameterized Complexity of Maximum Edge Colorable Subgraph

A graph $H$ is {\em $p$-edge colorable} if there is a coloring $\psi: E(H) \rightarrow \{1,2,\dots,p\}$, such that for distinct $uv, vw \in E(H)$, we have $\psi(uv) \neq \psi(vw)$. The {\sc Maximum Edge-Colorable Subgraph} problem takes as input a graph $G$ and integers $l$ and $p$, and the objective is to find a subgraph $H$ of $G$ and a $p$-edge-coloring of $H$, such that $|E(H)| \geq l$. We study the above problem from the viewpoint of Parameterized Complexity. We obtain \FPT\ algorithms when parameterized by: $(1)$ the vertex cover number of $G$, by using {\sc Integer Linear Programming}, and $(2)$ $l$, a randomized algorithm via a reduction to \textsc{Rainbow Matching}, and a deterministic algorithm by using color coding, and divide and color. With respect to the parameters $p+k$, where $k$ is one of the following: $(1)$ the solution size, $l$, $(2)$ the vertex cover number of $G$, and $(3)$ l - {\mm}(G), where {\mm}(G) is the size of a maximum matching in $G$; we show that the (decision version of the) problem admits a kernel with $\mathcal{O}(k \cdot p)$ vertices. Furthermore, we show that there is no kernel of size $\mathcal{O}(k^{1-\epsilon} \cdot f(p))$, for any $\epsilon > 0$ and computable function $f$, unless \NP \subseteq \CONPpoly

On Arnold's 14 `exceptional' N=2 superconformal gauge theories

We study the four-dimensional superconformal N=2 gauge theories engineered by the Type IIB superstring on Arnold's 14 exceptional unimodal singularities (a.k.a. Arnold's strange duality list), thus extending the methods of 1006.3435 to singularities which are not the direct sum of minimal ones. In particular, we compute their BPS spectra in several `strongly coupled' chambers. From the TBA side, we construct ten new periodic Y-systems, providing additional evidence for the existence of a periodic Y-system for each isolated quasi-homogeneous singularity with $\hat c<2$ (more generally, for each N=2 superconformal theory with a finite BPS chamber whose chiral primaries have dimensions of the form N/l).Comment: 73 pages, 7 figure