2,912 research outputs found
On Dimer Models and Closed String Theories
We study some aspects of the recently discovered connection between dimer
models and D-brane gauge theories. We argue that dimer models are also
naturally related to closed string theories on non compact orbifolds of \BC^2
and \BC^3, via their twisted sector R charges, and show that perfect
matchings in dimer models correspond to twisted sector states in the closed
string theory. We also use this formalism to study the combinatorics of some
unstable orbifolds of \BC^2.Comment: 1 + 25 pages, LaTeX, 11 epsf figure
Faster exponential-time algorithms in graphs of bounded average degree
We first show that the Traveling Salesman Problem in an n-vertex graph with
average degree bounded by d can be solved in O*(2^{(1-\eps_d)n}) time and
exponential space for a constant \eps_d depending only on d, where the
O*-notation suppresses factors polynomial in the input size. Thus, we
generalize the recent results of Bjorklund et al. [TALG 2012] on graphs of
bounded degree.
Then, we move to the problem of counting perfect matchings in a graph. We
first present a simple algorithm for counting perfect matchings in an n-vertex
graph in O*(2^{n/2}) time and polynomial space; our algorithm matches the
complexity bounds of the algorithm of Bjorklund [SODA 2012], but relies on
inclusion-exclusion principle instead of algebraic transformations. Building
upon this result, we show that the number of perfect matchings in an n-vertex
graph with average degree bounded by d can be computed in
O*(2^{(1-\eps_{2d})n/2}) time and exponential space, where \eps_{2d} is the
constant obtained by us for the Traveling Salesman Problem in graphs of average
degree at most 2d.
Moreover we obtain a simple algorithm that counts the number of perfect
matchings in an n-vertex bipartite graph of average degree at most d in
O*(2^{(1-1/(3.55d))n/2}) time, improving and simplifying the recent result of
Izumi and Wadayama [FOCS 2012].Comment: 10 page
Counting Popular Matchings in House Allocation Problems
We study the problem of counting the number of popular matchings in a given
instance. A popular matching instance consists of agents A and houses H, where
each agent ranks a subset of houses according to their preferences. A matching
is an assignment of agents to houses. A matching M is more popular than
matching M' if the number of agents that prefer M to M' is more than the number
of people that prefer M' to M. A matching M is called popular if there exists
no matching more popular than M. McDermid and Irving gave a poly-time algorithm
for counting the number of popular matchings when the preference lists are
strictly ordered.
We first consider the case of ties in preference lists. Nasre proved that the
problem of counting the number of popular matching is #P-hard when there are
ties. We give an FPRAS for this problem.
We then consider the popular matching problem where preference lists are
strictly ordered but each house has a capacity associated with it. We give a
switching graph characterization of popular matchings in this case. Such
characterizations were studied earlier for the case of strictly ordered
preference lists (McDermid and Irving) and for preference lists with ties
(Nasre). We use our characterization to prove that counting popular matchings
in capacitated case is #P-hard
On the expected number of perfect matchings in cubic planar graphs
A well-known conjecture by Lov\'asz and Plummer from the 1970s asserted that
a bridgeless cubic graph has exponentially many perfect matchings. It was
solved in the affirmative by Esperet et al. (Adv. Math. 2011). On the other
hand, Chudnovsky and Seymour (Combinatorica 2012) proved the conjecture in the
special case of cubic planar graphs. In our work we consider random bridgeless
cubic planar graphs with the uniform distribution on graphs with vertices.
Under this model we show that the expected number of perfect matchings in
labeled bridgeless cubic planar graphs is asymptotically , where
and is an explicit algebraic number. We also
compute the expected number of perfect matchings in (non necessarily
bridgeless) cubic planar graphs and provide lower bounds for unlabeled graphs.
Our starting point is a correspondence between counting perfect matchings in
rooted cubic planar maps and the partition function of the Ising model in
rooted triangulations.Comment: 19 pages, 4 figure
Rank Maximal Matchings -- Structure and Algorithms
Let G = (A U P, E) be a bipartite graph where A denotes a set of agents, P
denotes a set of posts and ranks on the edges denote preferences of the agents
over posts. A matching M in G is rank-maximal if it matches the maximum number
of applicants to their top-rank post, subject to this, the maximum number of
applicants to their second rank post and so on.
In this paper, we develop a switching graph characterization of rank-maximal
matchings, which is a useful tool that encodes all rank-maximal matchings in an
instance. The characterization leads to simple and efficient algorithms for
several interesting problems. In particular, we give an efficient algorithm to
compute the set of rank-maximal pairs in an instance. We show that the problem
of counting the number of rank-maximal matchings is #P-Complete and also give
an FPRAS for the problem. Finally, we consider the problem of deciding whether
a rank-maximal matching is popular among all the rank-maximal matchings in a
given instance, and give an efficient algorithm for the problem
Properly ordered dimers, -charges, and an efficient inverse algorithm
The superconformal field theories that arise in AdS-CFT from
placing a stack of D3-branes at the singularity of a toric Calabi-Yau threefold
can be described succinctly by dimer models. We present an efficient algorithm
for constructing a dimer model from the geometry of the Calabi-Yau. Since not
all dimers produce consistent field theories, we perform several consistency
checks on the field theories produced by our algorithm: they have the correct
number of gauge groups, their cubic anomalies agree with the Chern-Simons
coefficients in the AdS dual, and all gauge invariant chiral operators satisfy
the unitarity bound. We also give bounds on the ratio of the central charge of
the theory to the area of the toric diagram. To prove these results, we
introduce the concept of a properly ordered dimer.Comment: 33 pages, 19 figures, some corrections and clarification
Toric AdS4/CFT3 duals and M-theory Crystals
We study the recently proposed crystal model for three dimensional
superconformal field theories arising from M2-branes probing toric Calabi-Yau
four-fold singularities. We explain the algorithms mapping a toric Calabi-Yau
to a crystal and vice versa, and show how the spectrum of BPS meson states fits
into the crystal model.Comment: 24 pages, 24 figure
- …