725 research outputs found
String rewriting for Double Coset Systems
In this paper we show how string rewriting methods can be applied to give a
new method of computing double cosets. Previous methods for double cosets were
enumerative and thus restricted to finite examples. Our rewriting methods do
not suffer this restriction and we present some examples of infinite double
coset systems which can now easily be solved using our approach. Even when both
enumerative and rewriting techniques are present, our rewriting methods will be
competitive because they i) do not require the preliminary calculation of
cosets; and ii) as with single coset problems, there are many examples for
which rewriting is more effective than enumeration.
Automata provide the means for identifying expressions for normal forms in
infinite situations and we show how they may be constructed in this setting.
Further, related results on logged string rewriting for monoid presentations
are exploited to show how witnesses for the computations can be provided and
how information about the subgroups and the relations between them can be
extracted. Finally, we discuss how the double coset problem is a special case
of the problem of computing induced actions of categories which demonstrates
that our rewriting methods are applicable to a much wider class of problems
than just the double coset problem.Comment: accepted for publication by the Journal of Symbolic Computatio
The non-abelian Born-Infeld action at order F^6
To gain insight into the non-abelian Born-Infeld (NBI) action, we study
coinciding D-branes wrapped on tori, and turn on magnetic fields on their
worldvolume. We then compare predictions for the spectrum of open strings
stretching between these D-branes, from perturbative string theory and from the
effective NBI action. Under some plausible assumptions, we find corrections to
the Str-prescription for the NBI action at order F^6. In the process we give a
way to classify terms in the NBI action that can be written in terms of field
strengths only, in terms of permutation group theory.Comment: LaTeX, 31 pages, 30 figure
Generalizing Boolean Satisfiability III: Implementation
This is the third of three papers describing ZAP, a satisfiability engine
that substantially generalizes existing tools while retaining the performance
characteristics of modern high-performance solvers. The fundamental idea
underlying ZAP is that many problems passed to such engines contain rich
internal structure that is obscured by the Boolean representation used; our
goal has been to define a representation in which this structure is apparent
and can be exploited to improve computational performance. The first paper
surveyed existing work that (knowingly or not) exploited problem structure to
improve the performance of satisfiability engines, and the second paper showed
that this structure could be understood in terms of groups of permutations
acting on individual clauses in any particular Boolean theory. We conclude the
series by discussing the techniques needed to implement our ideas, and by
reporting on their performance on a variety of problem instances
Symmetry and inert states of spin Bose Condensates
We construct the list of all possible inert states of spin Bose condensates
for . In doing so, we also obtain their symmetry properties. These
results are applied to classify line defects of these spin condensates at zero
magnetic field.Comment: an error in Sec III C correcte
On some lattice computations related to moduli problems
We show how to solve computationally a combinatorial problem about the
possible number of roots orthogonal to a vector of given length in . We
show that the moduli space of K3 surfaces with polarisation of degree 2d is
also of general type for d=52. This case was omitted from the earlier work of
Gritsenko, Hulek and the second author. We also apply this method to some
related problems. In Appendix A, V. Gritsenko shows how to arrive at the case
d=52 and some others directly.Comment: With an appendix by V. Gritsenk
Chromatic Numbers of Simplicial Manifolds
Higher chromatic numbers of simplicial complexes naturally
generalize the chromatic number of a graph. In any fixed dimension
, the -chromatic number of -complexes can become arbitrarily
large for [6,18]. In contrast, , and only
little is known on for .
A particular class of -complexes are triangulations of -manifolds. As a
consequence of the Map Color Theorem for surfaces [29], the 2-chromatic number
of any fixed surface is finite. However, by combining results from the
literature, we will see that for surfaces becomes arbitrarily large
with growing genus. The proof for this is via Steiner triple systems and is
non-constructive. In particular, up to now, no explicit triangulations of
surfaces with high were known.
We show that orientable surfaces of genus at least 20 and non-orientable
surfaces of genus at least 26 have a 2-chromatic number of at least 4. Via a
projective Steiner triple systems, we construct an explicit triangulation of a
non-orientable surface of genus 2542 and with face vector
that has 2-chromatic number 5 or 6. We also give orientable examples with
2-chromatic numbers 5 and 6.
For 3-dimensional manifolds, an iterated moment curve construction [18] along
with embedding results [6] can be used to produce triangulations with
arbitrarily large 2-chromatic number, but of tremendous size. Via a topological
version of the geometric construction of [18], we obtain a rather small
triangulation of the 3-dimensional sphere with face vector
and 2-chromatic number 5.Comment: 22 pages, 11 figures, revised presentatio
- …