相关论文: Soft Barycentric Refinement

This note is a continuation of the author's paper \cite{Li}. We prove that if the metric $g$ of a 4-manifold has bounded Ricci curvature and the curvature has no local concentration everywhere, then it can be smoothed to a metric with…

We consider the problem of $q$-colouring a $k$-uniform random hypergraph, where $q,k \geq 3$, and determine the rigidity threshold. For edge densities above the rigidity threshold, we show that almost all solutions have a linear number of…

This is a treatise on finite point configurations spanning a fixed volume to be found in a single color-class of an arbitrary finite (measurable) coloring of the Euclidean space $\mathbb{R}^n$, or in a single large measurable subset…

Extension dimension is characterized in terms of $\omega$-maps. We apply this result to prove that extension dimension is preserved by refinable maps between metrizable spaces. It is also shown that refinable maps preserve some…

Adaptive mesh refinement is a key component of efficient unstructured space-time finite element methods. Underlying any adaptive mesh refinement scheme is, of course, a method for local refinement of simplices. However, simplex bisection…

The generalization of QCD to many colors is not unique; each distinct choice corresponds to a distinct 1/N_c expansion. The familiar 't Hooft N_c -> \infty limit places quarks in the fundamental representation of SU(N_c), while an…

We classify the trees on $n$ vertices with the maximum and the minimum number of certain generalized colorings, including conflict-free, odd, non-monochromatic, star, and star rainbow vertex colorings. We also extend a result of Cutler and…

A $(d-1)$-dimensional simplicial complex $\Delta$ is balanced if its graph $G(\Delta)$ is $d$-colorable. Klee and Novik obtained the balanced lower bound theorem for balanced normal $(d-1)$-pseudomanifolds $\Delta$ with $d\geq3$ by showing…

We give superexponential lower and upper bounds on the number of coloured $d$-dimensional triangulations whose underlying space is an oriented manifold, when the number of simplices goes to infinity and $d\geq 3$ is fixed. In the special…

We prove that any closed, convex hypersurface in an $(n+1)$-dimensional Riemannian manifold with $\lceil \frac{n}{2} \rceil$-positive curvature operator is a rational homology sphere with finite fundamental group. The same conclusion holds…

We define the class of high dimensional graph manifolds. These are compact smooth manifolds supporting a decomposition into finitely many pieces, each of which is diffeomorphic to the product of a torus with a finite volume hyperbolic…

A colouring of a graph G is called distinguishing if its stabiliser in Aut G is trivial. It has been conjectured that, if every automorphism of a locally finite graph moves infinitely many vertices, then there is a distinguishing…

Let $G=(V,E)$ be a simple graph of maximum degree $\Delta$. The edges of $G$ can be colored with at most $\Delta +1$ colors by Vizing's theorem. We study lower bounds on the size of subgraphs of $G$ that can be colored with $\Delta$ colors.…

A vertex coloring of a graph $G$ is said to be a 2-distance coloring if any two vertices at distance at most $2$ from each other receive different colors, and the least number of colors for which $G$ admits a $2$-distance coloring is known…

We prove that Riemannian metrics with a uniform weak norm can be smoothed to having arbitrarily high regularity. This generalizes all previous smoothing results. As a consequence we obtain a generalization of Gromov's almost flat manifold…

We study and classify proper $q$-colorings of the $\mathbb Z^d$ lattice, identifying three regimes where different combinatorial behavior holds: (1) When $q\le d+1$, there exist frozen colorings, that is, proper $q$-colorings of $\mathbb…

We study in this paper the structure of solutions in the random hypergraph coloring problem and the phase transitions they undergo when the density of constraints is varied. Hypergraph coloring is a constraint satisfaction problem where…

If all but two vertices of a triangulated sphere have degrees divisible by $k$, then the exceptional vertices are not adjacent. This theorem is proved for $k=2$ with the help of the coloring monodromy. For $k = 3, 4, 5$ colorings by the…

We study a generalized boundary rigidity problem, which investigates whether the areas of embedded minimal surfaces can uniquely determine a Riemannian manifold with boundary. We prove that for a conformal perturbation of an analytic metric…

A proper $q$-coloring of a graph is an assignment of one of $q$ colors to each vertex of the graph so that adjacent vertices are colored differently. Sample uniformly among all proper $q$-colorings of a large discrete cube in the integer…