Let $a$ and $b\in \mathbb{N}$. Denote by $R_{a,b}$ the set of all integers $n>1$ whose canonical prime representation $n=p_1^{{\alpha }_1}{p}_2^{{\alpha }_2}\cdots p_r^{{\alpha }_r}$ has all exponents ${\alpha }_i$ $(1\le i\le r)$ being a multiple of $a$ or belonging to the arithmetic progression $at+b$, $t\in {\mathbb{N}}_0:=\mathbb{N}\cup \left\{0\right\}$. All integers in $R_{a,b}$ are called generalized square-full integers. Using the exponent pair method, an upper bound for character sums over generalized square-full integers is derived. An application on the distribution of generalized square-full integers in an arithmetic progression is given. ...

The seminal theorem of Cobham has given rise during the last 40 years to a lot of work about non-standard numeration systems and has been extended to many contexts. In this paper, as a result of fifteen years of improvements, we obtain a complete and general version for the so-called substitutive sequences. Let $\alpha$ and $\beta$ be two multiplicatively independent Perron numbers. Then a sequence $x\in A^{\mathbb{N}}$, where $A$ is a finite alphabet, is both $\alpha$-substitutive and $\beta$-substitutive if and only if $x$ is ultimately...

In this paper we prove the following theorems in incidence geometry. 1. There is $\delta >0$ such that for any $P_1,\cdots ,P_4$, and $Q_1,\cdots ,Q_n\in {ℂ}^2$, if there are $\le n^{(1+\delta )/2}$ many distinct lines between $P_i$ and $Q_j$ for all $i$, $j$, then $P_1,\cdots ,P_4$ are collinear. If the number of the distinct lines is $<c{n}^{1/2}$ then the cross ratio of the four points is algebraic. 2. Given $c>0$, there is $\delta >0$ such that for any $P_1,P_2,P_3\in {ℂ}^2$ noncollinear, and $Q_1,\cdots ,Q_n\in {ℂ}^2$, if there are $\le c{n}^{1/2}$ many distinct lines between $P_i$ and $Q_j$ for all $i$, $j$, then for any $P\in {ℂ}^2\setminus \{P_1,P_2,P_3\}$, we have $\delta n$ distinct lines between $P$ and $Q_j$. 3. Given...

A vector $x$ is said to be an eigenvector of a square max-min matrix $A$ if $A\otimes x=x$. An eigenvector $x$ of $A$ is called the greatest $𝐗$-eigenvector of $A$ if $x\in 𝐗=\{x;\underline{x}\le x\le \overline{x}\}$ and $y\le x$ for each eigenvector $y\in 𝐗$. A max-min matrix $A$ is called strongly $𝐗$-robust if the orbit $x,A\otimes x,A^2\otimes x,\cdots$ reaches the greatest $𝐗$-eigenvector with any starting vector of $𝐗$. We suggest an $O\left(n^3\right)$ algorithm for computing the greatest $𝐗$-eigenvector of $A$ and study the strong $𝐗$-robustness. The necessary and sufficient conditions for strong $𝐗$-robustness are introduced...

Let $\Omega$ be a bounded domain of class $C^2$ in $ℝ$N and let $K$ be a compact subset of $\partial \Omega$. Assume that $q\ge (N+1)/\left(N-1\right)$ and denote by $U_K$ the maximal solution of $-\Delta u+u^q=0$ in $\Omega$ which vanishes on $\partial \Omega \setminus K$. We obtain sharp upper and lower estimates for $U_K$ in terms of the Bessel capacity $C_{2/q,q^{\text{'}}}$ and prove that $U_K$ is $\sigma$-moderate. In addition we describe the precise asymptotic behavior of $U_K$ at points $\sigma \in K$, which depends on the “density” of $K$ at $\sigma$, measured in terms of the capacity $C_{2/q,q^{\text{'}}}$.

General position properties play a crucial role in geometric and infinite-dimensional topologies. Often such properties provide convenient tools for establishing various universality results. One of well-known general position properties is DDⁿ, the property of disjoint n-cells. Each Polish $L{C}^{n-1}$-space X possessing DDⁿ contains a topological copy of each n-dimensional compact metric space. This fact implies, in particular, the classical Lefschetz-Menger-Nöbeling-Pontryagin-Tolstova embedding...

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...

We prove some results in the context of isoperimetric inequalities with quantitative terms. In the $2$-dimensional case, our main contribution is a method for determining the optimal coefficients $c_1,...,c_m$ in the inequality $\delta P\left(E\right)\ge {\sum }_{k=1}^m{c}_k\alpha {\left(E\right)}^k+o\left(\alpha {\left(E\right)}^m\right)$, valid for each Borel set $E$ with positive and finite area, with $\delta P\left(E\right)$ and $\alpha \left(E\right)$ being, respectively, the $\mathrm{𝑖𝑠𝑜𝑝𝑒𝑟𝑖𝑚𝑒𝑡𝑟𝑖𝑐𝑑𝑒𝑓𝑖𝑐𝑖𝑡}$ and the $\mathrm{𝐹𝑟𝑎𝑒𝑛𝑘𝑒𝑙𝑎𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑦}$ of $E$. In $n$ dimensions, besides proving existence and regularity properties of minimizers for a wide class of $\mathrm{𝑞𝑢𝑎𝑛𝑡𝑖𝑡𝑎𝑡𝑖𝑣𝑒𝑖𝑠𝑜𝑝𝑒𝑟𝑖𝑚𝑒𝑡𝑟𝑖𝑐𝑞𝑢𝑜𝑡𝑖𝑒𝑛𝑡𝑠}$ including the lower semicontinuous extension of $\frac{\delta P\left(E\right)}{\alpha {\left(E\right)}^2}$, we...

Let $D$ be a ${𝒞}^d$ $q$-convex intersection, $d\ge 2$, $0\le q\le n-1$, in a complex manifold $X$ of complex dimension $n$, $n\ge 2$, and let $E$ be a holomorphic vector bundle of rank $N$ over $X$. In this paper, ${𝒞}^k$-estimates, $k=2,3,\cdots ,\infty$, for solutions to the $\overline{\partial }$-equation with small loss of smoothness are obtained for $E$-valued $(0,s)$-forms on $D$ when $n-q\le s\le n$. In addition, we solve the $\overline{\partial }$-equation with a support condition in ${𝒞}^k$-spaces. More precisely, we prove that for a $\overline{\partial }$-closed form $f$ in ${𝒞}_{0,q}^k(X\setminus D,E)$, $1\le q\le n-2$, $n\ge 3$, with compact support and for $\epsilon$ with $0<\epsilon <1$ there...