Related papers: On q-Runge domains

We show that each pseudoconvex domain $\Omega\subset {\mathbb C}^n$ admits a holomorphic map $F$ to ${\mathbb C}^m$ with $|F|\le C_1 e^{C_2 \hat{\delta}^{-6}}$, where $\hat{\delta}$ is the minimum of the boundary distance and…

We give an example of a bounded, pseudoconvex, circular domain in ${\mathbb C}^3$ with smooth, real-analytic boundary and non-compact automorphism group, which is not biholomorphically equivalent to any Reinhardt domain.

We consider four problems. Rogers proved that for any convex body $K$, we can cover ${\mathbb R}^d$ by translates of $K$ of density very roughly $d\ln d$. First, we extend this result by showing that, if we are given a family of positive…

W.M.Schmit[11] conjectured that for any$\;\theta$ with deg$\;\theta\geq 3,$ there is no constant$\;C=C(\theta)$ so that$\;|p-q\theta|>Cq^{-1}$ for every rationa$\;p/q.$ [12,p26] states that the computations of the first several thousand…

King, Lu, and Peng recently proved that for $\Delta\geq 4$, any $K_\Delta$-free graph with maximum degree $\Delta$ has fractional chromatic number at most $\Delta-\tfrac{2}{67}$ unless it is isomorphic to $C_5\boxtimes K_2$ or $C_8^2$.…

We consider a holomorphic foliation $\mathcal{F}$ of codimension $k\geq 1$ on a homogeneous compact K\"ahler manifold $X$ of dimension $n>k$. Assuming that the singular set $Sing(\mathcal{F})$ of $\mathcal{F}$ is contained in an absolutely…

We show that, if $\alpha > 0$ is a real number, $n \ge 2$ and $\ell \ge 2$ are integers, and $q$ is a prime power, then every simple matroid $M$ of sufficiently large rank, with no $U_{2,\ell}$-minor, no rank-$n$ projective geometry minor…

Let $X$ be a smooth irreducible projective variety over a field $\mathbf{k}$ of dimension $d.$ Let $\tau: \mathbb{Q}_l\to \mathbb{C}$ be any field embedding. Let $f: X\to X$ be a surjective endomorphism. We show that for every…

A vertex colouring of a graph is \emph{nonrepetitive on paths} if there is no path $v_1,v_2,...,v_{2t}$ such that v_i and v_{t+i} receive the same colour for all i=1,2,...,t. We determine the maximum density of a graph that admits a…

We investigate data-enriched models, like Petri nets with data, where executability of a transition is conditioned by a relation between data values involved. Decidability status of various decision problems in such models may depend on the…

A (q,k,t)-design matrix is an m x n matrix whose pattern of zeros/non-zeros satisfies the following design-like condition: each row has at most q non-zeros, each column has at least k non-zeros and the supports of every two columns…

We introduce the Colombeau Quaternio Algebra and study its algebraic structure. We also study the dense ideal, dense in the algebraic sense, of the algebra of Colombeau generalized numbers and use this show the existence of a maximal ting…

We prove that for every digraph $F$ and every assignment of pairs of integers $(r_e,q_e)_{e \in A(F)}$ to its arcs there exists an integer $N$ such that every digraph $D$ with dichromatic number at least $N$ contains a subdivision of $F$ in…

We determine, asymptotically, the number of quintic fields having bounded discriminant. Specifically, we prove that the asymptotic number of quintic fields having absolute discriminant at most X is a constant times X. In contrast with the…

The hypercube Qn of dimension n is one of the most versatile and powerful interconnection networks. The n-dimensional folded cube denoted as FQn, a variation of the hypercube possesses some embeddable properties that the hypercube does not…

We show that for an odd prime r > 3 and an integer g > 1, in the projective representation given by the SO(3) Witten-Chern-Simons theory at an rth root of unity, the image of the mapping class group of a surface of genus g is dense.

Ulam asked in 1945 if there is an everywhere dense \emph{rational set}, i.e. a point set in the plane with all its pairwise distances rational. Erd\H os conjectured that if a set $S$ has a dense rational subset, then $S$ should be very…

Let $ H $ be a multi-digraph on $ h $ vertices with $ q $ arcs. An \textbf{$H$-subdivision} in a digraph $D$ is a subdigraph obtained by replacing every arc $uv$ of $H$ with a path from $u$ to $v$ in $D$ such that these paths are pairwise…

There exists an infinite family of examples of subsets of $\mathbb{F}_q^2$ with $q^{4/3}$ elements whose distance sets are not the whole of $\mathbb{F}_q$.

We study the parameterized complexity of dominating sets in geometric intersection graphs. In one dimension, we investigate intersection graphs induced by translates of a fixed pattern Q that consists of a finite number of intervals and a…