English
Related papers

Related papers: $\mathsf{SOCA}$ and $\mathsf{OGA}$ for $\mathsf{HL…

200 papers

Over a smooth complex projective curve $C$ of genus $g$ let $\M (n,d)$ be the moduli space of semistable bundles of rank $n$ and degree $d$ on $C$, and $\SM (n,L)$, the moduli space of those bundles whose determinant is isomorphic to a…

alg-geom · Mathematics 2008-02-03 Ron Donagi , Loring W. Tu

Let $n \geq 3$ and $\Omega$ be a bounded domain in $\mathbb{C}^n$ with a smooth negative plurisubharmonic exhaustion function $\varphi$. As a generalization of Y. Tiba's result, we prove that any holomorphic function on a connected open…

Complex Variables · Mathematics 2019-05-15 Seungjae Lee , Yoshikazu Nagata

In this work we study the uncountable Borel chromatic numbers, defined by Geschke (2011) as cardinal characteristics of the continuum, of low complexity graphs. We show that a strong form of locally countable graphs with compact totally…

Logic · Mathematics 2022-09-12 Raiean Banerjee , Michel Gaspar

We prove density of smooth functions in subspaces of Sobolev- and higher order $BV$-spaces of kind $W^{m,p}(\Omega)\cap L^q(\Omega-D)$ and $BV^m(\Omega)\cap L^q(\Omega-D)$, respectively, where $\Omega\subset\mathbb{R}^n$ ($n\in\mathbb{N}$)…

Analysis of PDEs · Mathematics 2018-03-28 Jan Mueller

Let $X$ be a connected, locally finite graph with symmetric growth. We prove that there is a vertex coloring $\phi\colon X\to\{0,1\}$ and some $R\in\mathbb{N}$ such that every automorphism $f$ preserving $\phi$ is $R$-close to the identity…

Combinatorics · Mathematics 2020-05-21 Jesús Antonio Álvarez López , Ramón Barral Lijó , Hiraku Nozawa

A class of graphs is $\chi$-bounded if there is a function $f$ such that every graph $G$ in the class has chromatic number at most $f(\omega(G))$, where $\omega(G)$ is the clique number of $G$; the class is polynomially $\chi$-bounded if…

Combinatorics · Mathematics 2023-03-24 Maria Chudnovsky , Alex Scott , Paul Seymour , Sophie Spirkl

For a given compact Hausdorff space $X$, we construct the space $OS_{f}(X)$ of normed, order-preserving, weakly additive, positively homogeneous and semi-additive functionals (for brevity, semi-additive functionals) and it is proved that…

General Topology · Mathematics 2020-11-13 Kh. ~Kh. ~Kurbanov , A. ~Ya. ~Ishmetov

Given a graph $G$, a vertex-colouring $\sigma$ of $G$, and a subset $X\subseteq V(G)$, a colour $x \in \sigma(X)$ is said to be \emph{odd} for $X$ in $\sigma$ if it has an odd number of occurrences in $X$. We say that $\sigma$ is an…

Combinatorics · Mathematics 2023-06-05 Tianjiao Dai , Qiancheng Ouyang , François Pirot

We prove that: 1. If a Hausdorff M-space is a continuous closed image of a submetrizable space, then it is metrizable. 2. A dense-in-itself open-closed image of a submetrizable space is submetrizable if and only if it is functionally…

General Topology · Mathematics 2023-12-07 Vlad Smolin

We consider a new class of open covers and classes of spaces defined from them, called "iota spaces". We explore their relationship with epsilon-spaces (that is, spaces having all finite powers Lindelof) and countable network weight. An…

General Topology · Mathematics 2013-02-22 Natasha May , Santi Spadaro , Paul Szeptycki

We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they preserve planarity), particularly in relation to homomorphism…

Combinatorics · Mathematics 2022-06-22 David E. Roberson

Graph coloring is a fundamental problem in computer science. We study the fully dynamic version of the problem in which the graph is undergoing edge insertions and deletions and we wish to maintain a vertex-coloring with small update time…

Data Structures and Algorithms · Computer Science 2020-02-25 Monika Henzinger , Stefan Neumann , Andreas Wiese

In this short note we answer a query of Brodzki, Niblo, \v{S}pakula, Willett and Wright by showing that all bounded degree uniformly locally amenable graphs have Property A. For the second result of the note recall that Kaiser proved that…

Metric Geometry · Mathematics 2021-04-20 Gábor Elek

We show that in a bounded Gromov hyperbolic domain $\Omega$ smooth functions with bounded derivatives $C^\infty(\Omega)\cap W^{k,\infty}(\Omega)$ are dense in the homogeneous Sobolev spaces $L^{k,p}(\Omega)$.

Functional Analysis · Mathematics 2018-03-26 Debanjan Nandi

A graph manifold rational homology $3$-sphere $W$ with a left-orderable fundamental group admits a co-oriented taut foliation, though it is unknown whether it admits a smooth co-oriented taut foliation. In this paper we extend the gluing…

Geometric Topology · Mathematics 2015-10-09 Steven Boyer , Adam Clay

We prove upper bounds for the spread, the Lindel\"of number and the weak Lindel\"of number of the $G_\delta$-topology on a topological space and apply a few of our bounds to give a short proof to a recent result of Juh\'asz and van Mill…

General Topology · Mathematics 2017-07-18 Angelo Bella , Santi Spadaro

We provide a complete classification of when the homeomorphism group of a stable surface, $\Sigma$, has the automatic continuity property: Any homomorphism from Homeo$(\Sigma)$ to a separable group is necessarily continuous. This result…

Geometric Topology · Mathematics 2024-11-21 Mladen Bestvina , George Domat , Kasra Rafi

We study the space ${\mathcal X}^{d}(G)$ of pictures of a graph $G$ in complex projective $d$-space. The main result is that the homology groups (with integer coefficients) of ${\mathcal X}^{d}(G)$ are completely determined by the Tutte…

Combinatorics · Mathematics 2007-05-23 Jeremy L. Martin

Negami's famous planar cover conjecture is equivalent to the statement that a connected graph can be embedded in the projective plane if and only if it has a projective planar cover. In 1999, Hlin\v{e}n\'y proposed extending this conjecture…

Combinatorics · Mathematics 2024-12-06 Marcin Briański , James Davies , Jane Tan

A proper colouring of a graph $G$ is $\beta$-frugal if every colour appears at most $\beta$ times in the neighbourhood of each vertex. Let $\chi_\beta(G)$ denote the minimum number of colours needed for a $\beta$-frugal colouring of $G$.…

Combinatorics · Mathematics 2026-03-30 Quentin Chuet