相关论文: Almost resolvable even cycle systems of $(K_u \tim…

Tuza [1992] proved that a graph with no cycles of length congruent to $1$ modulo $k$ is $k$-colorable. We prove that if a graph $G$ has an edge $e$ such that $G-e$ is $k$-colorable and $G$ is not, then for $2\leq r\leq k$, the edge $e$ lies…

We prove new results for approximating Graphic TSP. Specifically, we provide a polynomial-time \frac{9}{7}-approximation algorithm for cubic bipartite graphs and a (\frac{9}{7}+\frac{1}{21(k-2)})-approximation algorithm for k-regular…

A $K$-XORGAME system corresponds to a $K$-XORSAT system with the additional restriction that the variables divide uniformly into $K$ blocks. This forms a system of $m$ equations with $K n$ unknowns over $\mathbb{Z}_2$, and a perfect…

Algebraic structure of a class of differential equations including Heun is shown to be related with the deformations of sl(2) algebra. These include both quadratic and cubic ones. The finite dimensional representation of cubic algebra is…

We develop a constructive method to derive exactly solvable quantum mechanical models of rational (Calogero) and trigonometric (Sutherland) type. This method starts from a linear algebra problem: finding eigenvectors of triangular finite…

Zero-cycles are conjectured to satisfy weak approximation with Brauer-Manin obstruction for proper smooth varieties defined over number fields. Roughly speaking, we prove that the conjecture is compatible for products of rationally…

We prove that a uniquely 2-divisible group that admits an almost regular involutory automorphism is solvable.

Let $G$ be a simple graph with no even cycle, called an odd-cycle graph. Cavers et al. [Cavers et al. Skew-adjacency matrices of graphs, Linear Algebra Appl. 436(2012), 4512--1829] showed that the spectral radius of $G^\sigma$ is the same…

In this paper, we study the existence problem for cyclic $\ell$-cycle decompositions of the graph $K_m[n]$, the complete multipartite graph with $m$ parts of size $n$, and give necessary and sufficient conditions for their existence in the…

Let $\mbox{interval} + k v$, $\mbox{interval} + k e$, and $\mbox{interval} - k e$ denote the classes of graphs that can be obtained from some interval graph by adding $k$ vertices, adding $k$ edges, and deleting $k$ edges, respectively.…

We obtain strong invariance principles for normalized multiple iterated sums and integrals of the form $\bbS_N^{(\nu)}(t)=N^{-\nu/2}\sum_{0\leq k_1<...<k_\nu\leq Nt}\xi(k_1)\otimes\cdots\otimes\xi(k_\nu)$, $t\in[0,T]$ and…

We investigate modules over "systematic" rings. Such rings are "almost graded" and have appeared under various names in the literature; they are special cases of the G-systems of Grzeszczuk. We analyse their K-theory in the presence of…

Let $G$ be a connected graph and $\mathcal{P}(G)$ a graph parameter. We say that $\mathcal{P}(G)$ is feasible if $\mathcal{P}(G)$ satisfies the following properties: (I) $\mathcal{P}(G)\leq \mathcal{P}(G_{uv})$, if $G_{uv}=G[u\to v]$ for…

Let $V$ be a vertex operator superalgebra and $g=\left(1\ 2\ \cdots k\right)$ be a $k$-cycle which is viewed as an automorphism of the tensor product vertex operator superalgebra $V^{\otimes k}$. In this paper, we construct an explicit…

It is proved that there exists an absolute constant c > 0 such that for every natural number k, every non-bipartite 2-connected graph with average degree at least ck contains k cycles with consecutive odd lengths. This implies the existence…

We develop novel methods for constructing nearly Hamilton cycles in sublinear expanders with good regularity properties, as well as new techniques for finding such expanders in general graphs. These methods are of independent interest due…

We define a large class of integrable nonlinear PDE's, \emph{$k$-symmetric AKS systems}, whose solutions evolve on finite dimensional subalgebras of loop algebras, and linearize on an associated algebraic curve. We prove that periodicity of…

A graph is called $K$-almost regular if its maximum degree is at most $K$ times the minimum degree. Erd\H{o}s and Simonovits showed that for a constant $0< \varepsilon< 1$ and a sufficiently large integer $n$, any $n$-vertex graph with more…

Designing algorithms for space bounded models with restoration requirements on the space used by the algorithm is an important challenge posed about the catalytic computation model introduced by Buhrman et al. (2014). Motivated by the…

An entire solution of the Allen-Cahn equation $\Delta u=f(u)$, where $f$ has exactly three zeros at $\pm 1$ and 0, is balanced and odd, e.g. $f(u)=u(u^2-1)$, is called a $2k$-ended solution if its nodal set is asymptotic to $2k$ half lines,…