Related papers: The Doyen-Wilson theorem for 3-sun systems
We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at least six points in S are in general…
We construct and study a new topological field theory in three dimensions. It is a hybrid between Chern-Simons and Rozansky-Witten theory and can be regarded as a topologically-twisted version of the N=4 d=3 supersymmetric gauge theory…
In this paper we study some Erdos type problems in discrete geometry. Our main result is that we show that there is a planar point set of n points such that no four are collinear but no matter how we choose a subset of size $n^{5/6+o(1)} $…
We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…
A torus fibered Calabi-Yau threefold with first homotopy group Z_3 x Z_3 is constructed as a free quotient of a fiber product of two dP_9 surfaces. Calabi-Yau threefolds of this type admit Z_3 x Z_3 Wilson lines. In conjunction with SU(4)…
This is an elementary and self--contained review of twistor theory as a geometric tool for solving non-linear differential equations. Solutions to soliton equations like KdV, Tzitzeica, integrable chiral model, BPS monopole or Sine-Gordon…
We show that planar embeddable 3-connected CAD graphs are generically non-soluble. A CAD graph represents a configuration of points on the Euclidean plane with just enough distance dimensions between them to ensure rigidity. Formally, a CAD…
A graph $G$ on $n$ vertices with $k$ edges is $t$-edge-balanced if every graph on $n$ vertices with $t$ edges is contained in exactly the same number of subgraphs of $K_n$ isomorphic to $G$. Despite the existence of infinite families of…
We show that every planar triangulation on $n>10$ vertices has a dominating set of size $n/7=n/3.5$. This approaches the $n/4$ bound conjectured by Matheson and Tarjan [MT'96], and improves significantly on the previous best bound of…
The Kramer-Mesner method for constructing designs with a prescribed automorphism group $G$ has proven effective many times. In the special case of Steiner designs, the task reduces to solving an exact cover problem, with the advantage that…
We solve the existence problem for $F$-designs for arbitrary $r$-uniform hypergraphs~$F$. This implies that given any $r$-uniform hypergraph~$F$, the trivially necessary divisibility conditions are sufficient to guarantee a decomposition of…
A graph $G$ is 3-colorable if and only if it maps homomorphically to the complete 3-vertex graph $K_3$. The last condition can be checked by a $k$-consistency algorithm where the parameter $k$ has to be chosen large enough, dependent on…
A dijoin in a digraph is a set of edges meeting every directed cut. D. R. Woodall conjectured in 1976 that if G is a digraph, and every directed cut of G has at least k edges, then there are k pairwise disjoint dijoins. This remains open,…
Planar point sets with many triple lines (which contain at least three distinct points of the set) have been studied for 180 years, started with Jackson and followed by Sylvester. Green and Tao has shown recently that the maximum possible…
We give a construction that provides infinitely many 2-connected, cubic, bipartite, and planar graphs G with 3k vertices and such that the number of disjoint copies of a 3-vertex path in G is less than k.
One of the most central and long-standing open questions in combinatorial design theory concerns the existence of Steiner t-designs for large values of t. Although in his classical 1987 paper, L. Teirlinck has shown that non-trivial…
The three-gluon vertex is a basic object of interest in nonabelian gauge theory. It contains important structural information, in particular on infrared divergences, and also figures prominently in the Schwinger-Dyson equations. At the…
The Jeans equations relate the second-order velocity moments to the density and potential of a stellar system. For general three-dimensional stellar systems, there are three equations, but these are not very helpful, as they contain six…
In this paper we established the global well-posedness theorem for a special type of wave-Klein-Gordon system that have the strong coupling terms in divergence form on the right hand side of its wave equation. We cope with the problem by…
In this manuscript the three types of late-time behavior of spherically symmetric Boson Stars are presented, these are: stable configurations, unstable bounded that collapse to form black holes and unstable unbounded that explode. The…