English
Related papers

Related papers: Soft Barycentric Refinement

200 papers

Higher chromatic numbers $\chi_s$ of simplicial complexes naturally generalize the chromatic number $\chi_1$ of a graph. In any fixed dimension $d$, the $s$-chromatic number $\chi_s$ of $d$-complexes can become arbitrarily large for…

Combinatorics · Mathematics 2019-06-28 Frank H. Lutz , Jesper M. Møller

A simplicial complex of dimension $d-1$ is said to be balanced if its graph is $d$-colorable. Juhnke-Kubitzke and Murai proved an analogue of the generalized lower bound theorem for balanced simplicial polytopes. We establish a…

Combinatorics · Mathematics 2016-08-30 Martina Juhnke-Kubitzke , Satoshi Murai , Isabella Novik , Connor Sawaske

We establish two versions of Vizing's theorem for Borel multi-graphs whose vertex degrees and edge multiplicities are uniformly bounded by respectively $\Delta$ and $\pi$. The ``approximate'' version states that, for any Borel probability…

Combinatorics · Mathematics 2020-07-21 Jan Grebík , Oleg Pikhurko

We prove that if a framework of a graph is neighborhood affine rigid in $d$-dimensions (or has the stronger property of having an equilibrium stress matrix of rank $n-d-1$) then it has an affine flex (an affine, but non Euclidean, transform…

Metric Geometry · Mathematics 2017-01-19 Robert Connelly , Steven J. Gortler , Louis Theran

A \emph{unichord} in a graph is an edge that is the unique chord of a cycle. A \emph{square} is an induced cycle on four vertices. A graph is \emph{unichord-free} if none of its edges is a unichord. We give a slight restatement of a known…

Discrete Mathematics · Computer Science 2014-02-05 Raphael C. S. Machado , Celina M. H. de Figueiredo , Nicolas Trotignon

We examine maximum vertex coloring of random geometric graphs, in an arbitrary but fixed dimension, with a constant number of colors. Since this problem is neither scale-invariant nor smooth, the usual methodology to obtain limit laws…

Probability · Mathematics 2016-11-17 Sem Borst , Milan Bradonjić

Higher dimensional graphs can be used to colour two-dimensional geometric graphs. If G the boundary of a three dimensional graph H for example, we can refine the interior until it is colourable with 4 colours. The later goal is achieved if…

Combinatorics · Mathematics 2014-12-23 Oliver Knill

We say that an edge colouring $c$ of a graph preserves an automorphism $\varphi$ if $\varphi$ maps each edge to an edge of the same colour. Otherwise, we say that $c$ breaks $\varphi$. We call an automorphism of a graph small if it moves…

Combinatorics · Mathematics 2026-02-18 Marcin Stawiski

In this paper, we study Lefschetz properties of Artinian reductions of Stanley-Reisner rings of balanced simplicial $3$-polytopes. A $(d-1)$-dimensional simplicial complex is said to be balanced if its graph is $d$-colorable. If a…

Combinatorics · Mathematics 2016-06-08 David Cook , Martina Juhnke-Kubitzke , Satoshi Murai , Eran Nevo

We present a characterization of $2$-dimensional Lorentzian manifolds with constant Ricci scalar curvature. It is well known that every $2$-dimensional Lorentzian manifolds is conformally flat, so we rewrite the Ricci scalar curvature in…

Mathematical Physics · Physics 2020-05-19 Nicolò Cangiotti , Mattia Sensi

Applying the recently obtained results on the renormalization of soft supersymmetry-breaking parameters, we investigate the infrared behaviour of the softly broken supersymmetric QCD as well as its dual theory in the conformal window. Under…

High Energy Physics - Theory · Physics 2009-10-31 Andreas Karch , Tatsuo Kobayashi , Jisuke Kubo , George Zoupanos

This article proves that if M is a smooth manifold of dimension at least four, then for generic choice of metric on M, all prime parametrized minimal surfaces in M are free of branch points and lie on nondegenerate critical submanifolds for…

Differential Geometry · Mathematics 2011-05-05 John Douglas Moore

Let $(Y,d)$ be a Gromov-Hausdorff limit of closed shrinking Ricci solitons with uniformly upper bounded diameter and lower bounded volume. We prove that off a closed subset of codimension at least 2, $Y$ is a smooth manifold satisfying a…

Differential Geometry · Mathematics 2009-09-15 Zhenlei Zhang

By designating vertices with variables, a simple undirected graph can be augmented to have an associated representing rational function in two variables taking the complex bi-upper halfplane to itself. We give relations between representing…

Complex Variables · Mathematics 2025-11-05 Lily Adlin , Giovani Thai , Samuel Tiscareno , Ryan Tully-Doyle

We study unknottedness for free boundary minimal surfaces in a three-dimensional Riemannian manifold with nonnegative Ricci curvature and strictly convex boundary, and for self-shrinkers in the three-dimensional Euclidean space. For doing…

Differential Geometry · Mathematics 2025-12-02 Sabine Chu , Giada Franz

We study a family of birational maps of smooth affine quadric 3-folds, {over the complex numbers}, of the form $x_1x_4-x_2x_3=$ constant, which seems to have some (among many others) interesting/unexpected characters: a) they are…

Algebraic Geometry · Mathematics 2024-05-14 Cinzia Bisi , Jonathan D. Hauenstein , Tuyen Trung Truong

Let $G=(V,E)$ be a multigraph of maximum degree $\Delta$. The edges of $G$ can be colored with at most $\frac{3}{2}\Delta$ colors by Shannon's theorem. We study lower bounds on the size of subgraphs of $G$ that can be colored with $\Delta$…

Data Structures and Algorithms · Computer Science 2013-09-25 Michał Farnik , Łukasz Kowalik , Arkadiusz Socała

A 7-dimensional area-minimizing embedded hypersurface $M$ will in general have a discrete singular set. The same is true if $M$ is stable, or has bounded index, provided $H^6(sing M) = 0$. We show that if $M_i$ are a sequence of such…

Differential Geometry · Mathematics 2022-05-23 Nick Edelen

In this paper we construct Ricci-positive metrics on the connected sum of products of arbitrarily many spheres provided the dimensions of all but one sphere in each summand are at least 3. There are two new technical theorems required to…

Differential Geometry · Mathematics 2019-11-19 Bradley Lewis Burdick

A strong edge-coloring $\varphi$ of a graph $G$ assigns colors to edges of $G$ such that $\varphi(e_1)\ne \varphi(e_2)$ whenever $e_1$ and $e_2$ are at distance no more than 1. It is equivalent to a proper vertex coloring of the square of…

Combinatorics · Mathematics 2022-12-06 Daniel W. Cranston