On the number of transversals in Cayley tables of cyclic groups

It is well known that if n is even, the addition table for the integers modulo n (which we denote by B_n) possesses no transversals. We show that if n is odd, then the number of transversals in B_n is at least exponential in n. Equivalently, for odd n, the number of diagonally cyclic latin squares of order n, the number of complete mappings or orthomorphisms of the cyclic group of order n, the number of magic juggling sequences of period n and the number of placements of n non-attacking semi-queens on an n×n toroidal chessboard are at least exponential in n. For all large n we show that there is a latin square of order n with at least (3.246)ⁿ transversals.We diagnose all possible sizes for the intersection of two transversals in B_n and use this result to complete the spectrum of possible sizes of homogeneous latin bitrades.We also briefly explore potential applications of our results in constructing random mutually orthogonal latin squares.     

Extending the choice of starting points for Newton's method

In this paper, we propose a center Lipschitz condition for the second derivative together with the use of restricted domains in order to improve the starting points for Newton's method when compared with previous results. Moreover, we present some numerical examples validating the theoretical results.     

The Structure of Vector Bundles on Non-primary Hopf Manifolds∗

Let X be a Hopf manifold with non-Abelian fundamental group and E be a holomorphic vector bundle over X, with trivial pull-back to Cⁿ ? {0}. The authors show that there exists a line bundle L over X such that E ? L has a nowhere vanishing section. It is proved that in case dim(X) ≥ 3, π^?(E) is trivial if and only if E is filtrable by vector bundles. With the structure theorem, the authors get the cohomology dimension of holomorphic bundle E over X with trivial pull-back and the vanishing of Chern class of E.     

Which cospectral graphs have same degree sequences

Two graphs are said to be $L$-cospectral (respectively, $Q$-cospectral) if they have the same (respectively, signless) Laplacian spectra, and a graph $G$ is said to be $L?DS$ (respectively, $Q?DS$) if there does not exist other non-isomorphic graph $H$ such that $H$ and $G$ are $L$-cospectral (respectively, $Q$-cospectral). Let $d_1\left(G\right)\ge d_2\left(G\right)\ge ?\ge d_n\left(G\right)$ be the degree sequence of a graph $G$ with $n$ vertices. In this paper, we prove that except for two exceptions (respectively, the graphs with $d_1\left(G\right)\in \{4,5\}$), if $H$ is $L$-cospectral (respectively, $Q$-cospectral) with a connected graph $G$ and $d_2\left(G\right)=2$, then $H$ has the same degree sequence as $G$. A spider graph is a unicyclic graph obtained by attaching some paths to a common vertex of the cycle. As an application of our result, we show that every spider graph and its complement graph are both $L?DS$, which extends the corresponding results of Haemers et al. (2008), Liu et al. (2011), Zhang et al. (2009) and Yu et al. (2014).     

On vertex-disjoint cycles and degree sum conditions

This paper considers a degree sum condition sufficient to imply the existence of $k$ vertex-disjoint cycles in a graph $G$. For an integer $t\ge 1$, let ${\sigma }_t\left(G\right)$ be the smallest sum of degrees of $t$ independent vertices of $G$. We prove that if $G$ has order at least $7k+1$ and ${\sigma }_4\left(G\right)\ge 8k?3$, with $k\ge 2$, then $G$ contains $k$ vertex-disjoint cycles. We also show that the degree sum condition on ${\sigma }_4\left(G\right)$ is sharp and conjecture a degree sum condition on ${\sigma }_t\left(G\right)$ sufficient to imply $G$ contains $k$ vertex-disjoint cycles for $k\ge 2$.     

A note on conservative galaxies,Skolem systems,cyclic cycle decompositions,and Heffter arrays

The conservative number of a graph $G$ is the minimum positive integer $M$, such that $G$ admits an orientation and a labeling of its edges by distinct integers in $\{1,2,\dots ,M\}$, such that at each vertex of degree at least three, the sum of the labels on the in-coming edges is equal to the sum of the labels on the out-going edges. A graph is conservative if $M=\left|E\left(G\right)\right|$. It is worth noting that determining whether certain biregular graphs are conservative is equivalent to find integer Heffter arrays.In this work we show that the conservative number of a galaxy (a disjoint union of stars) of size $M$ is $M$ for $M\equiv 0$, $3(mod4)$, and $M+1$ otherwise. Consequently, given positive integers $m_1$, $m_2$, …, $m_n$ with $m_i\ge 3$ for $1\le i\le n$, we construct a cyclic $(m_1,m_2,\dots ,m_n)$-cycle system of infinitely many circulant graphs, generalizing a result of Bryant, Gavlas and Ling (2003). In particular, it allows us to construct a cyclic $(m_1,m_2,\dots ,m_n)$-cycle system of the complete graph $K_{2M+1}$, where $M={\sum }_{i=1}^n{m}_i$. Also, we prove necessary and sufficient conditions for the existence of a cyclic $(m_1,m_2,\dots ,m_n)$-cycle system of $K_{2M+2}?F$, where $F$ is a 1-factor. Furthermore, we give a sufficient condition for a subset of ${\mathbb{Z}}_v?\left\{0\right\}$ to be sequenceable.     

具有非Lipschitz和非增长条件的带跳倒向随机微分方程

本文研究一类带Poisson跳的倒向随机微分方程。在方程的系数满足非增长条件和非Lipschitz条件下,讨论方程适应解的存在唯一性和稳定性。为了证明解的存在性,首先通过函数变换,构造出一逼近序列,然后运用推广的Bihari不等式和Lebesgue控制收敛定理证明该逼近序列是收敛的,得到逼近序列的极限就是方程的适应解。解的唯一性和稳定性主要运用了Bihari不等式和推广的Bihari不等式来进行证明。     

一类适应随机变量序列的强极限定理

研究了一类适应随机变量序列的局部收敛性,推广了文献[1]中的结论.并在假定部分和序列为极限鞅时,得到了极限鞅的强极限定理.最后给出了*-mixing序列的强大数定律.     

INFINITELY MANY SOLUTIONS FOR ELLIPTIC SYSTEMS WITH STRONGLY INDEFINITE VARIATIONAL STRUCTURE

Based on the multiplicity results of Benci and Fortunato [4], we consider some elliptic systems with strongly indefinite quadratic part, and establish the existence of infinitely many nontrivial solutions in a suitable family of products of fractional Sobolev spaces.