相关论文: Soft Barycentric Refinement

Let M be a 3-manifold (possibly with boundary). We show that, for any positive integer g, there exists an open nonempty set of metrics on M for each of which there are stable compact embedded minimal surfaces of genus g with arbitrarily…

In analogy with the spectral theory of geometrically finite hyperbolic manifolds, we initiate the study of resonances on geometrically finite (q+1)-regular graphs of groups. We prove the meromorphic continuation of the resolvent of the…

We show that a Kleinian surface group, or hyperbolic 3-manifold with a cusp-preserving homotopy-equivalence to a surface, has bounded geometry if and only if there is an upper bound on an associated collection of coefficients that depend…

Algebraic varieties which are locally isomorphic to open subsets of affine space will be called {\em plain}. Plain varieties are smooth and rational. The converse is true for curves and surfaces, and unknown in general. It is shown that…

The purpose of this note is twofold. First, we give a quick proof of Ballico-Chiantini's theorem stating that a Fano or Calabi-Yau variety of dimension at least 4 in codimension two is a complete intersection. Second, we improve Barth-Van…

This paper explores the Bernstein problem of smooth maps $f:\mathbb{R}^4 \to \mathbb{R}^3$ whose graphs form coassociative submanifolds in $\mathbb{R}^7$. We establish a condition, expressed in terms of the second elementary symmetric…

We study the thermodynamics of two-color QCD at high temperature and/or density using a dimensionally reduced superrenormalizable effective theory, formulated in terms of a coarse grained Wilson line. In the absence of quarks, the theory is…

It is known that the surface of a cone over the unit disc with large height has smaller distortion than the standard embedding of the 2-sphere in $\mathbb R^3$. In this note we show that distortion minimisers exist among convex embedded…

The famous Wegner's Planar Graph Conjecture asserts tight upper bounds on the chromatic number of the square $G^2$ of a planar graph $G$, depending on the maximum degree $\Delta(G)$ of $G$. The only case that the conjecture is resolved is…

A $k$-bisection of a bridgeless cubic graph $G$ is a $2$-colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes (monochromatic…

For each strongly connected finite-dimensional (pure) simplicial complex we construct a finite group, the group of projectivities of the complex, which is a combinatorial but not a topological invariant. This group is studied for…

We give an exponential improvement to the lower bound on diagonal Ramsey numbers for any fixed number of colors greater than two.

We show that codimension one dimensional Jacobian of the barycentric straightening map is uniformly bounded for most of the higher rank symmetric spaces. As a consequence, we prove that the locally finite simplicial volume of most $\mathbb…

Let $F$ be a graph which contains an edge whose deletion reduces its chromatic number. We prove tight bounds on the number of copies of $F$ in a graph with a prescribed number of vertices and edges. Our results extend those of Simonovits,…

We study a certain relaxation of the classic vertex coloring problem, namely, a coloring of vertices of undirected, simple graphs, such that there are no monochromatic triangles. We give the first classification of the problem in terms of…

The mean-field level calculation shows that the QCD matter can have multiple critical points incorporating the color superconductivity under charge neutrality constraint due to the repulsive vector interaction; this actually implies that…

We prove that the degree of a nonconstant morphism from a smooth projective 3-fold $X$ with N\'{e}ron-Severi group ${\bf Z}$ to a smooth 3-dimensional quadric is bounded in terms of numerical invariants of $X$. In the special case where $X$…

We study the problem of constructing a (near) uniform random proper $q$-coloring of a simple $k$-uniform hypergraph with $n$ vertices and maximum degree $\Delta$. (Proper in that no edge is mono-colored and simple in that two edges have…

Recently determined atomistic scale structures of near-two dimensional bilayers of vitreous silica (using scanning probe and electron microscopy) allow us to refine the experimentally determined coordinates to incorporate the known local…

A coloring is called $s$-wide if no walk of length $2s-1$ connects vertices of the same color. A graph is $s$-widely colorable with $t$ colors if and only if it admits a homomorphism into a universal graph $W(s,t)$. Tardif observed that the…