相关论文: The Hamilton-Waterloo Problem for Triangle-Factors…

This paper addresses an investigation on a factorization method for difference equations. It is proved that some classes of second order linear difference operators, acting in Hilbert spaces, can be factorized using a pair of mutually…

In this paper we consider the problem $$ {ll} -\Delta u=(N+\a)(N-2)|x|^{\a}u^\frac{N+2+2\a}{N-2} & in R^N u>0& in R^N u\in D^{1,2}(R^N). $$ where $N\ge3$. From the characterization of the solutions of the linearized operator, we deduce the…

For a graph (undirected, directed, or mixed), a cycle-factor is a collection of vertex-disjoint cycles covering the entire vertex set. Cycle-factors subject to parity constraints arise naturally in the study of structural graph theory and…

We consider uniformly resolvable decompositions of $K_v$ into subgraphs such that each resolution class contains only blocks isomorphic to the same graph. We give a complete solution for the case in which one resolution class is $K_2$ and…

It is a challenging open problem to construct an explicit 1-factorization of the bipartite Kneser graph $H(v,t)$, which contains as vertices all $t$-element and $(v-t)$-element subsets of $[v]:=\{1,\ldots,v\}$ and an edge between any two…

Let $H: V(G) \rightarrow 2^{\mathbb{N}}$ be a set mapping for a graph $G$. Given a spanning subgraph $F$ of $G$, $F$ is called a {\it general factor} or an $H$-{\it factor} of $G$ if $d_{F}(x)\in H(x)$ for every vertex $x\in V(G)$.…

For a scalar evolution equation $u_t=K(t,x,u,u_x,\ldots, u_n), n\geq 2$ the cohomology spaces $H^{1,s}({\mathcal R}^\infty)$ vanishes for $s\geq 3$ while the space $H^{1,2}({\mathcal R}^\infty)$ is isomorphic to the space of variational…

A method of determining two factors of an odd integer without need of multiplication or division operation in iterative portion of computation is presented. It is feasible for an implementing algorithm to use only integer addition and…

We give an identification between the planar algebra of the subgroup-subfactor $R \rtimes H \subset R \rtimes G$ and the $G$-invariant planar subalgebra of the planar algebra of the bipartite graph $\star_n$, where $n = [G : H]$. The…

Let $H$ be a fixed graph on $v$ vertices. For an $n$-vertex graph $G$ with $n$ divisible by $v$, an $H$-{\em factor} of $G$ is a collection of $n/v$ copies of $H$ whose vertex sets partition $V(G)$. In this paper we consider the threshold…

A graph is pseudo 2-factor isomorphic if all of its 2-factors have the same parity of number of cycles. Abreu et al. [J. Comb. Theory, Ser. B. 98 (2008) 432--442] conjectured that $K_{3,3}$, the Heawood graph and the Pappus graph are the…

For which values of $k$ does a uniformly chosen $3$-regular graph $G$ on $n$ vertices typically contain $ n/k$ vertex-disjoint $k$-cycles (a $k$-cycle factor)? To date, this has been answered for $k=n$ and for $k \ll \log n$; the former,…

In the Longest Common Factor with $k$ Mismatches (LCF$_k$) problem, we are given two strings $X$ and $Y$ of total length $n$, and we are asked to find a pair of maximal-length factors, one of $X$ and the other of $Y$, such that their…

We consider the factorisation problem for bialgebras: when a bialgebra $K$ factorises as $K=HL$, where $H$ and $L$ are algebras and coalgebras (but not necessarly bialgebras). Given two maps $R: H\ot L\to L\ot H$ and $W:L\ot H\to H\ot L$,…

In this paper, we mainly consider the existence of infinitely many homoclinic solutions for a class of subquadratic second-order Hamiltonian systems $\ddot{u}-L(t)u+W_u(t,u)=0$, where $L(t)$ is not necessarily positive definite and the…

We consider the problem of counting and of listing topologically inequivalent "planar" {4-valent} maps with a single component and a given number n of vertices. This enables us to count and to tabulate immersions of a circle in a sphere…

We derive the von K\'arm\'an-Howarth equation for a full three dimensional incompressible two-fluid plasma. In the long-time limit and for very large Reynolds numbers we obtain the equivalent of the hydrodynamic "four-fifth" law. This exact…

We propose an alternative method to factorize an integer by using three harmonic oscillators. These oscillators are coupled together via specific Kerr nonlinear interactions. This method can be applied even if two harmonic oscillators are…

We show that for $n \geq 2$ there exist real analytic Hamiltonian systems on $\mathbf{R}^{2n}$ with non-resonant eigenvalues at a singular point, of which the Birkhoff normal form itself is divergent. The proof of the result is achieved by…

For a fixed graph H with t vertices, an H-factor of a graph G with n vertices, where t divides n, is a collection of vertex disjoint (not necessarily induced) copies of H in G covering all vertices of G. We prove that for a fixed tree T on…