相关论文: Examining $H$-Closed Ducci Sequences on $\mathbb{Z…

We study continuous homomorphisms between algebras of iterated Laurent series over a commutative ring. We give a full description of such homomorphisms in terms of a discrete data determined by the images of parameters. In similar terms, we…

In this paper, we demonstrate that the modified Emden type equation (MEE), $\ddot{x}+\alpha x\dot{x}+\beta x^3=0$, is integrable either explicitly or by quadrature for any value of $\alpha$ and $\beta$. We also prove that the MEE possesses…

We study the set $\mathcal D^{n,\beta}(\mathbb R^d)$ of orientation preserving diffeomorphisms of $\mathbb R^d$ which differ from the identity by a H\"older $C^{n,\beta}_0$-mapping, where $n \in \mathbb N_{\ge 1}$ and $\beta \in (0,1]$. We…

Let the sequence $\{t_n\}_{n=1}^{\infty}$ of reals satisfy the condition $ \frac{t_{n+1}}{t_n} \ge 1+ \frac{\gamma}{n^\beta},0\le \beta <1, \gamma >0. $ Then the set $ \{\alpha \in [0,1]: \exists \varkappa > 0 \forall n \in \mathbb{N} ||t_n…

A classic theorem of Dirac from 1952 states that every graph with minimum degree at least n/2 contains a Hamiltonian cycle. In 1963, P\'osa conjectured that every graph with minimum degree at least 2n/3 contains the square of a Hamiltonian…

Given a digraph $D$, we denote by $\vec{\alpha}(D)$ the maximum size of an acyclic set of $D$ (i.e. a set of vertices which induces a subdigraph with no directed cycles), and by $\vec\chi(D)$ the minimum number of acyclic sets into which…

Let $D$ be a strong digraph on $n\geq 4$ vertices. In [3, Discrete Applied Math., 95 (1999) 77-87)], J. Bang-Jensen, Y. Guo and A. Yeo proved the following theorem: if (*) $d(x)+d(y)\geq 2n-1$ and $min \{d^+(x)+ d^-(y),d^-(x)+ d^+(y)\}\geq…

Let $d\geq 2$ be an integer and let $\omega_1,\cdots ,\omega_d$ be moduli of continuity in a specified class which contains the moduli of H\"{o}lder continuity. Let $f_k$, $k\in\{1,\cdots,d\}$, be $C^{1+\omega_k}$ orientation preserving…

In this paper, we prove that any perfect complex of $D^{\infty}$-modules may be reconstructed from its holomorphic solution complex provided that we keep track of the natural topology of this last complex. This is to be compared with the…

It is known that to every 1|1 dimensional supercurve X there is associated a dual supercurve \hat{X}, and a superdiagonal \Delta in their product. We establish that the categories of D-modules on X, \hat{X}, and \Delta are equivalent. This…

We consider families of planar polynomial vector fields of degree $n$ and study the cyclicity of a type of unbounded polycycle~$\Gamma$ called hemicycle. Compactified to the Poincar\'e disc,~$\Gamma$ consists of an affine straight line…

The harmonic Dirichlet space $\cal{D} (\mathbb{T})$ is the Hilbert space of functions $f \in L^2(\mathbb{T})$ such that $$\|f\|_{\cal{D} (\mathbb{T})}^2 := \sum_{n\in\mathbb{Z}} (1+|n|)|\hat{f}(n)|^2 < \infty.$$ We give sufficient…

In 2003, Bohman, Frieze, and Martin initiated the study of randomly perturbed graphs and digraphs. For digraphs, they showed that for every $\alpha>0$, there exists a constant $C$ such that for every $n$-vertex digraph of minimum…

A sequence in the additive group ${\mathbb Z}_n$ of integers modulo $n$ is called $n$-zero-free if it does not contain subsequences with length $n$ and sum zero. The article characterizes the $n$-zero-free sequences in ${\mathbb Z}_n$ of…

We present an extension of the classical De Giorgi class, and then we show that functions in this new class are locally bounded and locally H\"older continuous. Some applications are given. As a first application, we give a regularity…

In this series of papers, the primary goal is to enumerate Hamiltonian cycles (HC's) on the grid cylinder graphs $P_{m+1}\times C_n$, where $n$ is allowed to grow whilst $m$ is fixed. In Part~I, we studied the so-called non-contractible…

For a positive constant $\alpha$ a graph $G$ on $n$ vertices is called an $\alpha$-expander if every vertex set $U$ of size at most $n/2$ has an external neighborhood whose size is at least $\alpha\left|U\right|$. We study cycle lengths in…

P\'osa's theorem states that any graph $G$ whose degree sequence $d_1 \le \ldots \le d_n$ satisfies $d_i \ge i+1$ for all $i < n/2$ has a Hamilton cycle. This degree condition is best possible. We show that a similar result holds for…

The sequence of derangements is given by the formula $D_0 = 1, D_n = nD_{n-1} + (-1)^n, n>0$. It is a classical object appearing in combinatorics and number theory. In this paper we consider two classes of sequences: first class is given by…

A graph $H$ is an \emph{isometric} subgraph of $G$ if $d_H(u,v)= d_G(u,v)$, for every pair~$u,v\in V(H)$. A graph is \emph{distance preserving} if it has an isometric subgraph of every possible order. A graph is \emph{sequentially distance…