18,658 research outputs found
Stability Conditions, Wall-crossing and weighted Gromov-Witten Invariants
We extend B. Hassett's theory of weighted stable pointed curves ([Has03]) to
weighted stable maps. The space of stability conditions is described
explicitly, and the wall-crossing phenomenon studied. This can be considered as
a non-linear analog of the theory of stability conditions in abelian and
triangulated categories.
We introduce virtual fundamental classes and thus obtain weighted
Gromov-Witten invariants. We show that by including gravitational descendants,
one obtains an \LL-algebra as introduced in [LM04] as a generalization of a
cohomological field theory.Comment: 28 pages; v2: references added and updated, addressed referee
comments; to appear in Moscow Math Journa
A LP approximation for the Tree Augmentation Problem
In the Tree Augmentation Problem (TAP) the goal is to augment a tree by a
minimum size edge set from a given edge set such that is
-edge-connected. The best approximation ratio known for TAP is . In the
more general Weighted TAP problem, should be of minimum weight. Weighted
TAP admits several -approximation algorithms w.r.t. to the standard cut
LP-relaxation, but for all of them the performance ratio of is tight even
for TAP. The problem is equivalent to the problem of covering a laminar set
family. Laminar set families play an important role in the design of
approximation algorithms for connectivity network design problems. In fact,
Weighted TAP is the simplest connectivity network design problem for which a
ratio better than is not known. Improving this "natural" ratio is a major
open problem, which may have implications on many other network design
problems. It seems that achieving this goal requires finding an LP-relaxation
with integrality gap better than , which is a long time open problem even
for TAP. In this paper we introduce such an LP-relaxation and give an algorithm
that computes a feasible solution for TAP of size at most times the
optimal LP value. This gives some hope to break the ratio for the weighted
case. Our algorithm computes some initial edge set by solving a partial system
of constraints that form the integral edge-cover polytope, and then applies
local search on -leaf subtrees to exchange some of the edges and to add
additional edges. Thus we do not need to solve the LP, and the algorithm runs
roughly in time required to find a minimum weight edge-cover in a general
graph.Comment: arXiv admin note: substantial text overlap with arXiv:1507.0279
Generating families of surface triangulations. The case of punctured surfaces with inner degree at least 4
We present two versions of a method for generating all triangulations of any
punctured surface in each of these two families: (1) triangulations with inner
vertices of degree at least 4 and boundary vertices of degree at least 3 and
(2) triangulations with all vertices of degree at least 4. The method is based
on a series of reversible operations, termed reductions, which lead to a
minimal set of triangulations in each family. Throughout the process the
triangulations remain within the corresponding family. Moreover, for the family
(1) these operations reduce to the well-known edge contractions and removals of
octahedra. The main results are proved by an exhaustive analysis of all
possible local configurations which admit a reduction.Comment: This work has been partially supported by PAI FQM-164; PAI FQM-189;
MTM 2010-2044
Framings for graph hypersurfaces
We present a method for computing the framing on the cohomology of graph
hypersurfaces defined by the Feynman differential form. This answers a question
of Bloch, Esnault and Kreimer in the affirmative for an infinite class of
graphs for which the framings are Tate motives. Applying this method to the
modular graphs of Brown and Schnetz, we find that the Feynman differential form
is not of Tate type in general. This finally disproves a folklore conjecture
stating that the periods of Feynman integrals of primitive graphs in phi^4
theory factorise through a category of mixed Tate motives
Chromatic roots and minor-closed families of graphs
Given a minor-closed class of graphs , what is the infimum of
the non-trivial roots of the chromatic polynomial of ? When
is the class of all graphs, the answer is known to be . We
answer this question exactly for three minor-closed classes of graphs.
Furthermore, we conjecture precisely when the value is larger than .Comment: 18 pages, 5 figure
- …