Related papers: On q-Runge domains

At most how many (proper) q-colorings does a regular graph admit? Galvin and Tetali conjectured that among all n-vertex, d-regular graphs with 2d|n, none admits more q-colorings than the disjoint union of n/2d copies of the complete…

We prove that any quasirandom uniform hypergraph $H$ can be approximately decomposed into any collection of bounded degree hypergraphs with almost as many edges. In fact, our results also apply to multipartite hypergraphs and even to the…

Let G be a reductive group over a commutative ring R. We say that G has isotropic rank >=n, if every normal semisimple reductive R-subgroup of G contains (G_m)^n. We prove that if G has isotropic rank >=1 and R is a regular domain…

We revisit the phenomenon where, for certain domains $D$, if the squeezing function $s_D$ extends continuously to a point $p\in \partial{D}$ with value $1$, then $\partial{D}$ is strongly pseudoconvex around $p$. In $\mathbb{C}^2$, we…

For certain families of functions $\{f_q\}$ mapping $K^{nv_q} \to K^m$, where $K$ is a complete, nonarchimedean local field, we find a set $E$ of large Hausdorff dimension with the property that $f_q(x_1, \ldots, x_{v_q})$ is nonzero for…

A sparse version of Mantel's Theorem is that, for sufficiently large $p$, with high probability (w.h.p.), every maximum triangle-free subgraph of $G(n,p)$ is bipartite. DeMarco and Kahn proved this for $p>K \sqrt{\log n/n}$ for some…

If most of the pixels in an $n \times m$ digital image are the same color, must the image contain a large connected component? How densely can a given set of connected components pack in $\mathbb{Z}^2$ without touching? We answer these two…

We show that if $E$ is a closed convex set in $\mathbb C^n$ $(n>1)$ contained in a closed halfspace $H$ such that $E\cap bH$ is nonempty and bounded, then the concave domain $\Omega = \mathbb C^n\setminus E$ contains images of proper…

Let $\mathrm{ex}(n,H,\mathcal{F})$ be the maximum number of copies of $H$ in an $n$-vertex graph which contains no copy of a graph from $\mathcal{F}$. Thinking of $H$ and $\mathcal{F}$ as fixed, we study the asymptotics of…

Inspired by Feynman integral computations in quantum field theory, Kontsevich conjectured in 1997 that the number of points of graph hypersurfaces over a finite field $\F_q$ is a (quasi-) polynomial in $q$. Stembridge verified this for all…

Let D_1 be a subdomain of D_2 in the complex plane CC. Under very mild conditions on D_2 we show that there exist holomorphic functions f, defined on D_1 with the property that $f$ is nowhere extendible across the boundary of D_1, while the…

We investigate Diophantine definability and decidability over some subrings of algebraic numbers contained in quadratic extensions of totally real algebraic extensions of $\mathbb Q$. Among other results we prove the following. The big…

A conjecture of Coleman implies that only finitely many quaternion algebras over the rational numbers can be the endomorphism $\mathbf{Q}$-algebras of abelian surfaces over the complex numbers which can be defined over $\mathbf{Q}$. One may…

A dominating set on an $n $-dimensional hypercube is equivalent to a binary covering code of length $n $ and covering radius 1. It is still an open problem to determine the domination number $\gamma(Q_n)$ for $ n\geq10$ and $…

We study the density of functions which are holomorphic in a neighbourhood of the closure $\overline{\Omega}$ of a bounded non-smooth pseudoconvex domain $\Omega$, in the Bergman space $ H^2(\Omega ,\varphi)$ with a plurisubharmonic weight…

Given a proper map f : M $\rightarrow$ Q, having cell-like point-inverses, from a manifold-without-boundary M onto an ANR Q, it is a much-studied problem to find when f is approximable by homeomorphisms, i.e., when the decomposition of M…

There exists a function f: N -> N such that for every positive integer d, every quasi-finite field K and every projective hypersurface X of degree d and dimension at least f(d), the set X(K) is non-empty. This is a special case of a more…

For a connected graph $G=(V,E)$, a matching $M\subseteq E$ is a matching cut of $G$ if $G-M$ is disconnected. It is known that for an integer $d$, the corresponding decision problem Matching Cut is polynomial-time solvable for graphs of…

We introduce a novel concept of rank for subsets of finite metric spaces E^n_q (the set of all n-dimensional vectors over an alphabet of size q) equipped with the Hamming distance, where the rank R(A) of a subset A is defined as the number…

We investigate extremal problems for hypergraphs satisfying the following density condition. A $3$-uniform hypergraph $H=(V, E)$ is $(d, \eta,P_2)$-dense if for any two subsets of pairs $P$, $Q\subseteq V\times V$ the number of pairs…