Related papers: On the support of a non-autocorrelated function on…

We show that for a very general class of curvature functions defined in the positive cone, the problem of finding a complete strictly locally convex hypersurface in $H^n+1$ satisfying $f(\kappa)=\sigma\in(0, 1)$ with a prescribed asymptotic…

An edge-coloring of a hypergraph is {\em spanning} if every vertex sees every color used in the coloring. In this paper, we prove that for $k \geq 2r \geq 6$, in any spanning $k$-coloring of the edges of a complete $r$-partite $r$-uniform…

We prove that if a holomorphic self-map $f\colon \Omega\to \Omega$ of a bounded strongly convex domain $\Omega\subset \mathbb C^q$ with smooth boundary is hyperbolic then it admits a natural semi-conjugacy with a hyperbolic automorphism of…

The \emph{chromatic number} of a hypergraph is the smallest number of colors needed to color the vertices such that no edge of at least two vertices is monochromatic. Given a family of geometric objects $\mathcal{F}$ that covers a subset…

For a multigraph G, the integer round-up phi(G) of the fractional chromatic index yields a good general lower bound for the chromatic index . For an upper bound, Kahn showed that for any real c > 0 there exists a positive integer N so that…

We prove that a formula predicted on the basis of non-rigorous physics arguments [Zdeborova and Krzakala: Phys. Rev. E (2007)] provides a lower bound on the chromatic number of sparse random graphs. The proof is based on the interpolation…

Let $\Sigma$ be a compact, orientable surface of negative Euler characteristic, and let $h$ be a complete hyperbolic metric on $\Sigma$. A geodesic curve $\gamma$ in $\Sigma$ is filling, if it cuts the surface into topological disks and…

The paper deals with extremal problems concerning colorings of hypergraphs. By using a random recoloring algorithm we show that any $n$-uniform simple (i.e. every two distinct edges share at most one vertex) hypergraph $H$ with maximum edge…

The chromatic symmetric function of a graph is a generalization of the chromatic polynomial. The key motivation for studying the structure of a chromatic symmetric function is to answer positivity conjectures by Stanley in 1995 and Gasharov…

In this paper, we give bounds on the dichromatic number $\vec{\chi}(\Sigma)$ of a surface $\Sigma$, which is the maximum dichromatic number of an oriented graph embeddable on $\Sigma$. We determine the asymptotic behaviour of…

We show that many graphs naturally associated to a connected, compact, orientable surface are hierarchically hyperbolic spaces in the sense of Behrstock, Hagen and Sisto. They also automatically have the coarse median property defined by…

Consider a finite connected $2$-complex $X$ endowed with a piecewise Riemannian metric and whose fundamental group is freely indecomposable, of rank at least $3$, and in which every $2$-generated subgroup is free. In this paper we show that…

The (weak) chromatic number of a hypergraph $H$, denoted by $\chi(H)$, is the smallest number of colors required to color the vertices of $H$ so that no hyperedge of $H$ is monochromatic. For every $2\le k\le d+1$, denote by $\chi_L(k,d)$…

We construct countable Markov partitions for non-uniformly hyperbolic diffeomorphisms on compact manifolds of any dimension, extending earlier work of O. Sarig for surfaces. These partitions allow us to obtain symbolic coding on invariant…

We give a short proof of the following fact. Let $\Sigma$ be a connected, finitely connected, noncompact manifold without boundary. If $g$ is a complete Riemannian metric on $\Sigma$ whose Gaussian curvature $K$ is nonnegative at infinity,…

We consider spacelike graphs $\Gamma_f$ of simple products $(M\times N, g\times -h)$ where $(M,g)$ and $(N,h)$ are Riemannian manifolds and $f:M\to N$ is a smooth map. Under the condition of the Cheeger constant of $M$ to be zero and some…

Given a positive function $F$ on $S^n$ which satisfies a convexity condition, for $1\leq r\leq n$, we define the $r$-th anisotropic mean curvature function $H^F_r$ for hypersurfaces in $\mathbb{R}^{n+1}$ which is a generalization of the…

An $r$-hued coloring of a simple graph $G$ is a proper coloring of its vertices such that every vertex $v$ is adjacent to at least $\min\{r, \deg(v)\}$ differently colored vertices. The minimum number of colors needed for an $r$-hued…

We study stochastic homogenisation of free-discontinuity surface functionals defined on piecewise rigid functions which arise in the study of fracture in brittle materials. In particular, under standard assumptions on the density, we show…

Consider the surface measure $\mu$ on a sphere in a nonvertical hyperplane on the Heisenberg group $\mathbb{H}^n$, $n\ge 2$, and the convolution $f*\mu$. Form the associated maximal function $Mf=\sup_{t>0}|f*\mu_t|$ generated by the…