17 research outputs found
Cluster algebras of type
In this paper we study cluster algebras \myAA of type . We solve
the recurrence relations among the cluster variables (which form a T--system of
type ). We solve the recurrence relations among the coefficients of
\myAA (which form a Y--system of type ). 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 . 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 --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 . 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 is {\em -edge colorable} if there is a coloring , such that for distinct , we have
. The {\sc Maximum Edge-Colorable Subgraph} problem
takes as input a graph and integers and , and the objective is to
find a subgraph of and a -edge-coloring of , such that . We study the above problem from the viewpoint of Parameterized
Complexity. We obtain \FPT\ algorithms when parameterized by: the vertex
cover number of , by using {\sc Integer Linear Programming}, and ,
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 , where is one of the following: the
solution size, , the vertex cover number of , and l -
{\mm}(G), where {\mm}(G) is the size of a maximum matching in ; we show
that the (decision version of the) problem admits a kernel with vertices. Furthermore, we show that there is no kernel of size
, for any and computable
function , 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 (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