相关论文: Soft Barycentric Refinement

The \emph{Square Colouring} of a graph $G$ refers to colouring of vertices of a graph such that any two distinct vertices which are at distance at most two receive different colours. In this paper, we initiate the study of a related…

Brenti and Welker have shown that for any simplicial complex X, the face vectors of successive barycentric subdivisions of X have roots which converge to fixed values depending only on the dimension of X. We improve and generalize this…

We continue our study, initiated in our earlier paper, of Riemann surfaces with constant curvature and isolated conic singularities. Using the machinery developed in that earlier paper of extended configuration families of simple divisors,…

In this paper we show that a simplicial complex can be determined uniquely up to isomorphism by its barycentric subdivision or comparability graph. At the end, it is summarized several algebraic, combinatorial and topological invariants of…

We prove sharp $L^2$ Fourier restriction inequalities for compact, smooth surfaces in $\mathbb{R}^3$ equipped with the affine surface measure or a power thereof. The results are valid for all smooth surfaces and the bounds are uniform for…

We establish a simple generalization of a known result in the plane. The simplices in any pure simplicial complex in R^d may be colored with d+1 colors so that no two simplices that share a (d-1)-facet have the same color. In R^2 this says…

We prove a new generalisation of Ramsey's theorem by showing that every $2$-edge-coloured graph with sufficiently large minimum degree contains a monochromatic induced subgraph whose minimum degree remains large. From this, we also derive…

A classical result of Cheng states that the bottom spectrum of complete manifolds of fixed dimension and Ricci curvature lower bound achieves its maximal value on the corresponding hyperbolic space. The paper establishes an analogous result…

We prove that with high probability over the choice of a random graph $G$ from the Erd\H{o}s-R\'enyi distribution $G(n,1/2)$, a natural $n^{O(\varepsilon^2 \log n)}$-time, degree $O(\varepsilon^2 \log n)$ sum-of-squares semidefinite program…

In this paper, we study closed four-dimensional manifolds. In particular, we show that under various new pinching curvature conditions (for example, the sectional curvature is no more than 5/6 of the smallest Ricci eigenvalue) then the…

We show that the edges of any graph $G$ containing two edge-disjoint spanning trees can be blue/red coloured so that the blue and red graphs are connected and the blue and red degrees at each vertex differ by at most four. This improves a…

We study the low energy phase structure of SU(2) gauge theories in three-dimensional spacetime, at finite baryon density. The pseudoreality of representations of SU(2) permits an analytic study of a real baryon chemical potential, and the…

Following recent result of L. M. T\' oth [arXiv:1906.03137] we show that every $2\Delta$-regular Borel graph $\mathcal{G}$ with a (not necessarily invariant) Borel probability measure admits approximate Schreier decoration. In fact, we show…

In this paper, we show that the \alpha_{m,2}-invariant of a smooth cubic surface with Eckardt points is strictly bigger than 2/3. This can be used to simplify Tian's original proof of the existence of Kaehler-Einstein metrics on such…

Tutte's celebrated barycentric embedding theorem describes a natural way to build straight-line embeddings (crossing-free drawings) of a (3-connected) planar graph: map the vertices of the outer face to the vertices of a convex polygon, and…

We prove that Riemannian metrics with an absolute Ricci curvature bound and a conjugate radius bound can be smoothed to having a sectional curvature bound. Using this we derive a number of results about structures of manifolds with Ricci…

The Colour Refinement procedure and its generalisation to higher dimensions, the Weisfeiler-Leman algorithm, are central subroutines in approaches to the graph isomorphism problem. In an iterative fashion, Colour Refinement computes a…

We consider a family of compact manifolds which shrinks with respect to an appropriate parameter to a graph. The main result is that the spectrum of the Laplace-Beltrami operator converges to the spectrum of the (differential) Laplacian on…

Building upon previous works by Conlon-Ferber and Wigderson, Sawin showed a few years ago that upper bounds on the minimum density of independent sets in a $K_t$-free $G$ can be used to provide lower bounds for multicolor Ramsey numbers. In…

This paper is devoted to the study of a newly introduced tool, projectional coderivatives and the corresponding calculus rules in finite dimensions. We show that when the restricted set has some nice properties, more specifically, is a…