44,216 research outputs found
Set Matching: An Enhancement of the Hales-Jewett Pairing Strategy
When solving k-in-a-Row games, the Hales-Jewett pairing strategy [4] is a
well-known strategy to prove that specific positions are (at most) a draw. It
requires two empty squares per possible winning line (group) to be marked,
i.e., with a coverage ratio of 2.0. In this paper we present a new strategy,
called Set Matching. A matching set consists of a set of nodes (the markers), a
set of possible winning lines (the groups), and a coverage set indicating how
all groups are covered after every first initial move. This strategy needs less
than two markers per group. As such it is able to prove positions in k-in-a-Row
games to be draws, which cannot be proven using the Hales-Jewett pairing
strategy. We show several efficient configurations with their matching sets.
These include Cycle Configurations, BiCycle Configurations, and PolyCycle
Configurations involving more than two cycles. Depending on configuration, the
coverage ratio can be reduced to 1.14. Many examples in the domain of solving
k-in-a-Row games are given, including the direct proof (without further
investigation) that the empty 4 x 4 board is a draw for 4-in-a-Row
Color the cycles
The cycles of length k in a complete graph on n vertices are colored in such a way that edge-disjoint cycles get distinct colors. The minimum number of colors is asymptotically determined. © 2013
Computation of protein geometry and its applications: Packing and function prediction
This chapter discusses geometric models of biomolecules and geometric
constructs, including the union of ball model, the weigthed Voronoi diagram,
the weighted Delaunay triangulation, and the alpha shapes. These geometric
constructs enable fast and analytical computaton of shapes of biomoleculres
(including features such as voids and pockets) and metric properties (such as
area and volume). The algorithms of Delaunay triangulation, computation of
voids and pockets, as well volume/area computation are also described. In
addition, applications in packing analysis of protein structures and protein
function prediction are also discussed.Comment: 32 pages, 9 figure
Erdos-Hajnal-type theorems in hypergraphs
The Erdos-Hajnal conjecture states that if a graph on n vertices is H-free,
that is, it does not contain an induced copy of a given graph H, then it must
contain either a clique or an independent set of size n^{d(H)}, where d(H) > 0
depends only on the graph H. Except for a few special cases, this conjecture
remains wide open. However, it is known that a H-free graph must contain a
complete or empty bipartite graph with parts of polynomial size. We prove an
analogue of this result for 3-uniform hypergraphs, showing that if a 3-uniform
hypergraph on n vertices is H-free, for any given H, then it must contain a
complete or empty tripartite subgraph with parts of order c(log n)^{1/2 +
d(H)}, where d(H) > 0 depends only on H. This improves on the bound of c(log
n)^{1/2}, which holds in all 3-uniform hypergraphs, and, up to the value of the
constant d(H), is best possible. We also prove that, for k > 3, no analogue of
the standard Erdos-Hajnal conjecture can hold in k-uniform hypergraphs. That
is, there are k-uniform hypergraphs H and sequences of H-free hypergraphs which
do not contain cliques or independent sets of size appreciably larger than one
would normally expect.Comment: 15 page
A discrete Laplace-Beltrami operator for simplicial surfaces
We define a discrete Laplace-Beltrami operator for simplicial surfaces. It
depends only on the intrinsic geometry of the surface and its edge weights are
positive. Our Laplace operator is similar to the well known finite-elements
Laplacian (the so called ``cotan formula'') except that it is based on the
intrinsic Delaunay triangulation of the simplicial surface. This leads to new
definitions of discrete harmonic functions, discrete mean curvature, and
discrete minimal surfaces. The definition of the discrete Laplace-Beltrami
operator depends on the existence and uniqueness of Delaunay tessellations in
piecewise flat surfaces. While the existence is known, we prove the uniqueness.
Using Rippa's Theorem we show that, as claimed, Musin's harmonic index provides
an optimality criterion for Delaunay triangulations, and this can be used to
prove that the edge flipping algorithm terminates also in the setting of
piecewise flat surfaces.Comment: 18 pages, 6 vector graphics figures. v2: Section 2 on Delaunay
triangulations of piecewise flat surfaces revised and expanded. References
added. Some minor changes, typos corrected. v3: fixed inaccuracies in
discussion of flip algorithm, corrected attributions, added references, some
minor revision to improve expositio
- …