A graph $G$ is called $\{H_1,H_2,\cdots ,H_k\}$-free if $G$ contains no induced subgraph isomorphic to any graph $H_i$, $1\le i\le k$. We define $${\sigma }_k=min\left\{\sum _{i=1}^{k}d\left(v_i\right):\{v_1,\cdots ,v_k\}\text{is}\text{an}\text{independent}\text{set}\text{of}\text{vertices}\text{in}G\right\}.$$ In this paper, we prove that (1) if $G$ is a connected $\{K_{1,4},K_{1,4}+e\}$-free graph of order $n$ and ${\sigma }_3\left(G\right)\ge n-1$, then $G$ is traceable, (2) if $G$ is a 2-connected $\{K_{1,4},K_{1,4}+e\}$-free graph of order $n$ and $|N\left(x_1\right)\cup N\left(x_2\right)|+|N\left(y_1\right)\cup N\left(y_2\right)|\ge n-1$ for any two distinct pairs of non-adjacent vertices $\{x_1,x_2\}$, $\{y_1,y_2\}$ of $G$, then $G$ is traceable, i.e., $G$ has a Hamilton path, where $K_{1,4}+e$ is a graph obtained by joining a pair of non-adjacent vertices in a $K_{1,4}$.

Let $\mathbb{N}$ be the set of positive integers and let $s\in \mathbb{N}$. We denote by $d^s$ the arithmetic function given by $d^s\left(n\right)={\left(d\left(n\right)\right)}^s$, where $d\left(n\right)$ is the number of positive divisors of $n$. Moreover, for every $\ell ,m\in \mathbb{N}$ we denote by ${\delta }^{s,\ell ,m}\left(n\right)$ the sequence $$\underset{m\text{-times}}{\underbrace{d^s(d^s(...d^s(d^s\left(n\right)+\ell )+\ell ...)+\ell )}}=\left\{\begin{array}{cc}{d}^s\left(n\right)\hfill & \text{for}m=1,\hfill \\ d^s(d^s\left(n\right)+\ell )\hfill & \text{for}m=2,\hfill \\ d^s(d^s(d^s\left(n\right)+\ell )+\ell )\hfill & \text{for}m=3,\hfill \\ ⋮\hfill \end{array}\right.$$ We present classical and nonclassical notes on the sequence ${\left({\delta }^{s,\ell ,m}\left(n\right)\right)}_{m\ge 1}$, where $\ell$, $n$, $s$ are understood as parameters.

Let $\mathrm{T}$ be the family of all typically real functions, i.e. functions that are analytic in the unit disk $\Delta :=\{z\in ℂ:|z|<1\}$, normalized by $f\left(0\right)=f^{\text{'}}\left(0\right)-1=0$ and such that Im $z$ Im $f\left(z\right)$ $\ge 0$ for $z\in \Delta$. Moreover, let us denote: ${\mathrm{T}}^{\left(2\right)}:=\{f\in \mathrm{T}:f\left(z\right)=-f(-z)\text{for}z\in \Delta \}$ and ${\mathrm{T}}^{M,g}:=\{f\in \mathrm{T}:f\prec Mg\text{in}\Delta \}$, where $M>1$, $g\in \mathrm{T}\cap \mathrm{S}$ and $\mathrm{S}$ consists of all analytic functions, normalized and univalent in $\Delta$.We investigate  classes in which the subordination is replaced with the majorization and the function $g$ is typically real but does not necessarily univalent, i.e. classes $\{f\in \mathrm{T}:f\ll Mg\text{in}\Delta \}$, where $M>1$, $g\in \mathrm{T}$, which we denote...

The Turán number of a given graph $H$, denoted by $\mathrm{ex}(n,H)$, is the maximum number of edges in an $H$-free graph on $n$ vertices. Applying a well-known result of Hajnal and Szemerédi, we determine the Turán number $\text{ex}(n,K_p\cup K_q$) of a vertex-disjoint union of cliques $K_p$ and $K_q$ for all values of $n$.

In this paper, we consider solutions to the following chemotaxis system with general sensitivity $$\left\{\begin{array}{c}\tau u_t=\Delta u-\nabla ·\left(u\nabla \chi \left(v\right)\right)\text{in}\Omega \times (0,\infty ),\hfill \\ \eta v_t=\Delta v-v+u\text{in}\Omega \times (0,\infty ),\hfill \\ {\displaystyle \frac{\partial u}{\partial \nu }=\frac{\partial u}{\partial \nu }=0\text{on}\partial \Omega \times (0,\infty ).}\hfill \end{array}\right.$$ Here, $\tau$ and $\eta$ are positive constants, $\chi$ is a smooth function on $(0,\infty )$ satisfying ${\chi }^{\text{'}}(·)>0$ and $\Omega$ is a bounded domain of ${𝐑}^n$ ($n\ge 2$). It is well known that the chemotaxis system with direct sensitivity ($\chi \left(v\right)={\chi }_{0}v$, ${\chi }_0>0$) has blowup solutions in the case where $n\ge 2$. On the other hand, in the case where $\chi \left(v\right)={\chi }_{0}logv$ with $0<{\chi }_0\ll 1$, any solution to the system exists globally in time and is bounded. We present a sufficient condition for the boundedness...

The author proved in 2018 that if $G$ is an open subset of a Hilbert space, $f_1,f_2:G\to ℝ$ continuous functions and $\omega$ a nontrivial modulus such that $f_1\le f_2$, $f_1$ is locally semiconvex with modulus $\omega$ and $f_2$ is locally semiconcave with modulus $\omega$, then there exists $f\in C_{\text{loc}}^{1,\omega }\left(G\right)$ such that $f_1\le f\le f_2$. This is a generalization of Ilmanen’s lemma (which deals with linear modulus and functions on an open subset of ${ℝ}^n$). Here we extend the mentioned result from Hilbert spaces to some superreflexive spaces, in particular to $L^p$ spaces, $p\in [2,\infty )$. We...

Let $X$ be a proper, smooth, geometrically connected curve over a $p$-adic field $k$. Lichtenbaum proved that there exists a perfect duality: $$\text{Br}\left(X\right)\times \text{Pic}\left(X\right)\to \mathbb{Q}/\mathbb{Z}$$ between the Brauer and the Picard group of $X$, from which he deduced the existence of an injection of $\text{Br}\left(X\right)$ in ${\displaystyle \prod _{P\in X}\text{Br}\left(k_P\right)}$ where $P\in X$ and $k_P$ denotes the residual field of the point $P$. The aim of this paper is to prove that if $G=\tilde{G}$ is an $X_{et}$- scheme of semi-simple simply connected groups (s.s.s.c groups), then we can deduce from Lichtenbaum’s results...

We investigate the following quasilinear and singular problem, $$\text{t}o2.7cm\left\{\begin{array}{cc}-{\Delta }_{p}u=\frac{\lambda }{u^{\delta }}+u^q\hfill & \text{in}\Omega ;\hfill \\ {u|}_{\partial \Omega }=0,u\&gt;0\hfill & \text{in}\Omega ,\hfill \end{array}\right.\text{t}o2.7cm\text{(P)}$$ where $\Omega$ is an open bounded domain with smooth boundary, $1\&lt;p\&lt;\infty$, $p-1\&lt;q\le p^{*}-1$, $\lambda \&gt;0$, and $0\&lt;\delta \&lt;1$. As usual, $p^{*}=\frac{Np}{N-p}$ if $1\&lt;p\&lt;N$, $p^{*}\in (p,\infty )$ is arbitrarily large if $p=N$, and $p^{*}=\infty$ if $p\&gt;N$. We employ variational methods in order to show the existence of at least two distinct (positive) solutions of problem (P) in $W_0^{1,p}\left(\Omega \right)$. While following an approach due to Ambrosetti-Brezis-Cerami, we need to prove two new results of separate interest: a strong comparison principle...

In this paper, we investigate a measure of similarity of graphs similar to the Ramsey number. We present values and bounds for $g(n,l)$, the biggest number $k$ guaranteeing that there exist $l$ graphs on $n$ vertices, each two having edit distance at least $k$. By edit distance of two graphs $G$, $F$ we mean the number of edges needed to be added to or deleted from graph $G$ to obtain graph $F$. This new extremal number $g(n,l)$ is closely linked to the edit distance of graphs. Using probabilistic methods we show...

A graph $G$ is $H$-saturated if it contains no $H$ as a subgraph, but does contain $H$ after the addition of any edge in the complement of $G$. The saturation number, $\mathrm{sat}(n,H)$, is the minimum number of edges of a graph in the set of all $H$-saturated graphs of order $n$. We determine the saturation number $\mathrm{sat}(n,P_6+t{P}_2)$ for $n\ge \frac{10}{3}t+10$ and characterize the extremal graphs for $n>\frac{10}{3}t+20$.

For a graph $G=(V,E)$, a double Roman dominating function is a function $f:V\to \{0,1,2,3\}$ having the property that if $f\left(v\right)=0$, then the vertex $v$ must have at least two neighbors assigned $2$ under $f$ or one neighbor with $f\left(w\right)=3$, and if $f\left(v\right)=1$, then the vertex $v$ must have at least one neighbor with $f\left(w\right)\ge 2$. The weight of a double Roman dominating function $f$ is the sum $f\left(V\right)={\sum }_{v\in V}f\left(v\right)$. The minimum weight of a double Roman dominating function on $G$ is called the double Roman domination number of $G$ and is denoted by ${\gamma }_{\mathrm{dR}}\left(G\right)$. In this paper, we establish a new...

For any positive integer $k\ge 2$, let ${\left(P_n^{\left(k\right)}\right)}_{n\ge 2-k}$ be the $k$-generalized Pell sequence which starts with $0,\cdots ,0,1$ ($k$ terms) with the linear recurrence $$P_n^{\left(k\right)}=2P_{n-1}^{\left(k\right)}+P_{n-2}^{\left(k\right)}+\cdots +P_{n-k}^{\left(k\right)}\text{for}n\ge 2.$$ Let ${\left(N_n\right)}_{n\ge 0}$ be Narayana’s sequence given by $$N_0=N_1=N_2=1\text{and}{N}_{n+3}=N_{n+2}+N_n.$$ The purpose of this paper is to determine all $k$-Pell numbers which are sums of two Narayana’s numbers. More precisely, we study the Diophantine equation $$P_p^{\left(k\right)}=N_n+N_m$$ in nonnegative integers $k$, $p$, $n$ and $m$.

We prove a density version of the Carlson–Simpson Theorem. Specifically we show the following. For every integer $k\ge 2$ and every set $A$ of words over $k$ satisfying $\lim {\sup }_{n\to \infty }|A\cap {\left[k\right]}^n|/k^n>0$ there exist a word $c$ over $k$ and a sequence $\left(w_n\right)$ of left variable words over $k$ such that the set $c\cup \{c^{}{w}_0{\left(a_0\right)}^{}..{.}^{}{w}_n\left(a_n\right):n\in \mathbb{N}\text{and}{a}_0,...,a_n\in \left[k\right]\}$ is contained in $A$. While the result is infinite-dimensional its proof is based on an appropriate finite and quantitative version, also obtained in the paper.

Let $V$ be a complex nonsingular projective 3-fold of general type. We prove $P_{12}\left(V\right):=dim{H}^0(V,12K_V)\&gt;0$ and $P_{m_0}\left(V\right)\&gt;1$ for some positive integer $m_0\le 24$. A direct consequence is the birationality of the pluricanonical map ${\varphi }_m$ for all $m\ge 126$. Besides, the canonical volume $\text{Vol}\left(V\right)$ has a universal lower bound $\nu \left(3\right)\ge \frac{1}{63·{126}^2}$.

The paper deals with the existence of a Kneser solution of the $n$-th order nonlinear differential inclusion $$\begin{array}{cc}\hfill x^{\left(n\right)}\left(t\right)\in -A_1(t,x\left(t\right),...,x^{(n-1)}\left(t\right))x^{(n-1)}\left(t\right)-...-A_n(t,x\left(t\right),...,& x^{(n-1)}\left(t\right))x\left(t\right)\\ & \text{for}\text{a.a.}t\in [a,\infty ),\end{array}$$ where $a\in (0,\infty )$, and $A_i:[a,\infty )\times {ℝ}^n\to ℝ$, $i=1,...,n,$ are upper-Carathéodory mappings. The derived result is finally illustrated by the third order Kneser problem.