10,192 research outputs found
Coloring triple systems with local conditions
We produce an edge-coloring of the complete 3-uniform hypergraph on n
vertices with colors such that the edges spanned by
every set of five vertices receive at least three distinct colors. This answers
the first open case of a question of Conlon-Fox-Lee-Sudakov [1] who asked
whether such a coloring exists with colors
Layers of knot region colorings and higher differentials
We inductively define layers of colorings of knot and knotted surface
diagrams using ternary quasigroups. Homological invariants from such systems of
colorings use shorter differentials and of higher degree than the standard
homology differentials, and give access to typically more complex homology
groups.Comment: 16 page
Erdos-Szekeres-type theorems for monotone paths and convex bodies
For any sequence of positive integers j_1 < j_2 < ... < j_n, the k-tuples
(j_i,j_{i + 1},...,j_{i + k-1}), i=1, 2,..., n - k+1, are said to form a
monotone path of length n. Given any integers n\ge k\ge 2 and q\ge 2, what is
the smallest integer N with the property that no matter how we color all
k-element subsets of [N]=\{1,2,..., N\} with q colors, we can always find a
monochromatic monotone path of length n? Denoting this minimum by N_k(q,n), it
follows from the seminal 1935 paper of Erd\H os and Szekeres that
N_2(q,n)=(n-1)^q+1 and N_3(2,n) = {2n -4\choose n-2} + 1. Determining the other
values of these functions appears to be a difficult task. Here we show that
2^{(n/q)^{q-1}} \leq N_3(q,n) \leq 2^{n^{q-1}\log n}, for q \geq 2 and n \geq
q+2. Using a stepping-up approach that goes back to Erdos and Hajnal, we prove
analogous bounds on N_k(q,n) for larger values of k, which are towers of height
k-1 in n^{q-1}. As a geometric application, we prove the following extension of
the Happy Ending Theorem. Every family of at least M(n)=2^{n^2 \log n} plane
convex bodies in general position, any pair of which share at most two boundary
points, has n members in convex position, that is, it has n members such that
each of them contributes a point to the boundary of the convex hull of their
union.Comment: 32 page
Induced Ramsey-type results and binary predicates for point sets
Let and be positive integers and let be a finite point set in
general position in the plane. We say that is -Ramsey if there is a
finite point set such that for every -coloring of
there is a subset of such that and have the same order type
and is monochromatic in . Ne\v{s}et\v{r}il and Valtr proved
that for every , all point sets are -Ramsey. They also
proved that for every and , there are point sets that are
not -Ramsey.
As our main result, we introduce a new family of -Ramsey point sets,
extending a result of Ne\v{s}et\v{r}il and Valtr. We then use this new result
to show that for every there is a point set such that no function
that maps ordered pairs of distinct points from to a set of size
can satisfy the following "local consistency" property: if attains
the same values on two ordered triples of points from , then these triples
have the same orientation. Intuitively, this implies that there cannot be such
a function that is defined locally and determines the orientation of point
triples.Comment: 22 pages, 3 figures, final version, minor correction
Colorings of odd or even chirality on hexagonal lattices
We define two classes of colorings that have odd or even chirality on
hexagonal lattices. This parity is an invariant in the dynamics of all loops,
and explains why standard Monte-Carlo algorithms are nonergodic. We argue that
adding the motion of "stranded" loops allows for parity changes. By
implementing this algorithm, we show that the even and odd classes have the
same entropy. In general, they do not have the same number of states, except
for the special geometry of long strips, where a Z symmetry between even
and odd states occurs in the thermodynamic limit.Comment: 18 pages, 13 figure
Graph parameters from symplectic group invariants
In this paper we introduce, and characterize, a class of graph parameters
obtained from tensor invariants of the symplectic group. These parameters are
similar to partition functions of vertex models, as introduced by de la Harpe
and Jones, [P. de la Harpe, V.F.R. Jones, Graph invariants related to
statistical mechanical models: examples and problems, Journal of Combinatorial
Theory, Series B 57 (1993) 207-227]. Yet they give a completely different class
of graph invariants. We moreover show that certain evaluations of the cycle
partition polynomial, as defined by Martin [P. Martin, Enum\'erations
eul\'eriennes dans les multigraphes et invariants de Tutte-Grothendieck, Diss.
Institut National Polytechnique de Grenoble-INPG; Universit\'e
Joseph-Fourier-Grenoble I, 1977], give examples of graph parameters that can be
obtained this way.Comment: Some corrections have been made on the basis of referee comments. 21
pages, 1 figure. Accepted in JCT
- …