A subspace A of a topological space X is said to be $P^{\gamma }$-embedded ($P^{\gamma }$(point-finite)-embedded) in X if every (point-finite) partition of unity α on A with |α| ≤ γ extends to a (point-finite) partition of unity on X. The main results are: (Theorem A) A subspace A of X is $P^{\gamma }$(point-finite)-embedded in X iff it is $P^{\gamma }$-embedded and every countable intersection B of cozero-sets in X with B ∩ A = ∅ can be separated from A by a cozero-set in X. (Theorem B) The product A × [0,1] is $P^{\gamma }$(point-finite)-embedded...

Given a bounded open set $\Omega$ in ${ℝ}^n$ (or in a Riemannian manifold) and a partition of $\Omega$ by $k$ open sets $D_j$, we consider the quantity ${\mathrm{𝚖𝚊𝚡}}_j\lambda \left(D_j\right)$ where $\lambda \left(D_j\right)$ is the ground state energy of the Dirichlet realization of the Laplacian in $D_j$. If we denote by ${ℒ}_k\left(\Omega \right)$ the infimum over all the $k$-partitions of ${\mathrm{𝚖𝚊𝚡}}_j\lambda \left(D_j\right)$, a minimal $k$-partition is then a partition which realizes the infimum. When $k=2$, we find the two nodal domains of a second eigenfunction, but the analysis of higher $k$’s is non trivial and quite interesting. In this...

Given a graph $G=(V,E)$, if we can partition the vertex set $V$ into two nonempty subsets $V_1$ and $V_2$ which satisfy $\Delta \left(G\left[V_1\right]\right)\le d_1$ and $\Delta \left(G\left[V_2\right]\right)\le d_2$, then we say $G$ has a $({\Delta }_{d_1},{\Delta }_{d_2})$-partition. And we say $G$ admits an $(F_{d_1},F_{d_2})$-partition if $G\left[V_1\right]$ and $G\left[V_2\right]$ are both forests whose maximum degree is at most $d_1$ and $d_2$, respectively. We show that every planar graph with girth at least 5 has an $(F_4,F_4)$-partition.

It is shown that there is a subspace $Z_q$ of ${\ell }_q$ for $1<q<2$ which is isomorphic to ${\ell }_q$ such that ${\ell }_q/Z_q$ does not have the approximation property. On the other hand, for $2<p<\infty$ there is a subspace $Y_p$ of ${\ell }_p$ such that $Y_p$ does not have the approximation property (AP) but the quotient space ${\ell }_p/Y_p$ is isomorphic to ${\ell }_p$. The result is obtained by defining random “Enflo-Davie spaces” $Y_p$ which with full probability fail AP for all $2<p\le \infty$ and have AP for all $1\le p\le 2$. For $1<p\le 2$, $Y_p$ are isomorphic to ${\ell }_p$.

This paper addresses two problems lying at the intersection of geometric analysis and theoretical computer science: The non-linear isomorphic Dvoretzky theorem and the design of good approximate distance oracles for large distortion.We introduce the notion of Ramsey partitions of a finite metric space, and show that the existence of good Ramsey partitions implies a solution to the metric Ramsey problem for large distortion (also known as the non-linear version of the isomorphic Dvoretzky...

We give a graph theoretic interpretation of $r$-Lah numbers, namely, we show that the $r$-Lah number ${⌊\genfrac{}{}{0pt}{}{n}{k}⌋}_r$ counting the number of $r$-partitions of an $(n+r)$-element set into $k+r$ ordered blocks is just equal to the number of matchings consisting of $n-k$ edges in the complete bipartite graph with partite sets of cardinality $n$ and $n+2r-1$ ($0\le k\le n$, $r\ge 1$). We present five independent proofs including a direct, bijective one. Finally, we close our work with a similar result for $r$-Stirling numbers of the second kind. ...

Following a suggestion of W.M. Schmidt and L. Summerer, we construct a proper $3$-system $(P_1,P_2,P_3)$ with the property ${\overline{\varphi }}_3=1$. In fact, our method generalizes to provide $n$-systems with ${\overline{\varphi }}_n=1$, for arbitrary $n\ge 3$. We visualize our constructions with graphics. We further present explicit examples of numbers ${\xi }_1,...,{\xi }_{n-1}$ that induce the $n$-systems in question.

Let $G_1$ and $G_2$ be two given graphs. The Ramsey number $R(G_1,G_2)$ is the least integer $r$ such that for every graph $G$ on $r$ vertices, either $G$ contains a $G_1$ or $\overline{G}$ contains a $G_2$. Parsons gave a recursive formula to determine the values of $R(P_n,K_{1,m})$, where $P_n$ is a path on $n$ vertices and $K_{1,m}$ is a star on $m+1$ vertices. In this note, we study the Ramsey numbers $R(P_n,K_1\vee F_m)$, where $F_m$ is a linear forest on $m$ vertices. We determine the exact values of $R(P_n,K_1\vee F_m)$ for the cases $m\le n$ and $m\ge 2n$, and for the case that $F_m$ has no odd component. Moreover, we...

Let d be a positive integer and α a real algebraic number of degree d + 1. Set $\alpha ̲:=(\alpha ,\alpha ²,...,{\alpha }^d)$. It is well-known that $c\left(\alpha ̲\right):=limin{f}_{q\to \infty }{q}^{1/d}·\left|\right|q\alpha ̲\left|\right|>0$, where ||·|| denotes the distance to the nearest integer. Furthermore, $c\left(\alpha ̲\right)n^{-1/d}\le c\left(n\alpha ̲\right)\le nc\left(\alpha ̲\right)$ for any integer n ≥ 1. Our main result asserts that there exists a real number C, depending only on α, such that $c\left(n\alpha ̲\right)\le C{n}^{-1/d}$ for any integer n ≥ 1.

Let β ∈ (1,2) and x ∈ [0,1/(β-1)]. We call a sequence ${\left({ϵ}_i\right)}_{i=1}^{\infty }\in {0,1}^{\mathbb{N}}$ a β-expansion for x if $x={\sum }_{i=1}^{\infty }{ϵ}_i{\beta }^{-i}$. We call a finite sequence ${\left({ϵ}_i\right)}_{i=1}^n\in {0,1}^n$ an n-prefix for x if it can be extended to form a β-expansion of x. In this paper we study how good an approximation is provided by the set of n-prefixes. Given $\Psi :\mathbb{N}\to {ℝ}_{\ge 0}$, we introduce the following subset of ℝ: $W_{\beta }\left(\Psi \right):={\bigcap }_{m=1}^{\infty }{\bigcup }_{n=m}^{\infty }{\bigcup }_{{\left({ϵ}_i\right)}_{i=1}^n\in {0,1}^n}[{\sum }_{i=1}^n\left({ϵ}_i\right)/\left({\beta }^i\right),{\sum }_{i=1}^n\left({ϵ}_i\right)/\left({\beta }^i\right)+\Psi \left(n\right)]$In other words, $W_{\beta }\left(\Psi \right)$ is the set of x ∈ ℝ for which there exist infinitely many solutions to the inequalities $0\le x-{\sum }_{i=1}^n\left({ϵ}_i\right)/\left({\beta }^i\right)\le \Psi \left(n\right)$. When ${\sum }_{n=1}^{\infty }{2}^n\Psi \left(n\right)<\infty$, the Borel-Cantelli lemma tells us that the Lebesgue measure...

Let ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{k\to d}$ be the following algorithmic problem: Given a finite simplicial complex $K$ of dimension at most $k$, does there exist a (piecewise linear) embedding of $K$ into ${ℝ}^d$? Known results easily imply polynomiality of ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{k\to 2}$ ($k=1,2$; the case $k=1,d=2$ is graph planarity) and of ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{k\to 2k}$ for all $k\ge 3$. We show that the celebrated result of Novikov on the algorithmic unsolvability of recognizing the 5-sphere implies that ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{d\to d}$ and ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{(d-1)\to d}$ are undecidable for each ${}_d\ge 5$. Our main result is NP-hardness of ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{2\to 4}$ and, more generally, of ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{k\to d}$ for all...

A subset of a product of topological spaces is called $n$-thin if every its two distinct points differ in at least $n$ coordinates. We generalize a construction of Gruenhage, Natkaniec, and Piotrowski, and obtain, under CH, a countable $T_3$ space $X$ without isolated points such that $X^n$ contains an $n$-thin dense subset, but $X^{n+1}$ does not contain any $n$-thin dense subset. We also observe that part of the construction can be carried out under MA.