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

In this paper we study Almost-Riemannian Structures (ARS) on the class of nonnilpotent, solvable, conneted 3D Lie groups. The nice structures present in such groups allow us to show that the singular locus of ARSs on such groups are always…

In this article we investigate the existence, uniqueness and exponential decay of asymptotically almost periodic solutions of the parabolic-elliptic Keller-Segel system on a real hyperbolic manifold. We prove the existence and uniqueness of…

We prove that if two homomorphisms from O_{\infty} to a purely infinite simple C*-algebra have the same class in KK-theory, and if either both are unital or both are nonunital, then they are approximately unitarily equivalent. It follows…

More than twenty years ago Erd\H{o}s conjectured~\cite{E1} that a triangle-free graph $G$ of chromatic number $k \geq k_0(\varepsilon)$ contains cycles of at least $k^{2 - \varepsilon}$ different lengths as $k \rightarrow \infty$. In this…

In this paper we prove the almost sure existence of global weak solution to the 3D incompressible Navier-Stokes Equation for a set of large data in $\dot{H}^{-\alpha}(\mathbb{R}^{3})$ or $\dot{H}^{-\alpha}(\mathbb{T}^{3})$ with…

An $\ell$-cycle decomposition of $K_v$ is said to be \emph{equitably $2$-colourable} if there is a $2$-vertex-colouring of $K_v$ such that each colour is represented (approximately) an equal number of times on each cycle: more precisely, we…

We characterize the class of cycle decompositions that can achieve all Young tableau shapes (except the trivial ones with a single row or a single column) under the Robinson--Schensted--Knuth (RSK) correspondence, a property that we call…

In this paper, we prove some invariant curve theorems for the planar almost periodic reversible mappings. As an application, we will discuss the existence of almost periodic solutions and the boundedness of all solutions for the nonlinear…

We show that a set is almost periodic if and only if the associated exponential sum is concentrated in the minor arcs. Hence binary additive problems involving almost periodic sets can be solved using the circle method.

We prove that, given a finite graph $\Sigma$ satisfying some mild conditions, there exist infinitely many tetravalent half-arc-transitive normal covers of $\Sigma$. Applying this result, we establish the existence of infinite families of…

The $r$-uniform linear $k$-cycle $C^r_k$ is the $r$-uniform hypergraph on $k(r-1)$ vertices whose edges are sets of $r$ consecutive vertices in a cyclic ordering of the vertex set chosen in such a way that every pair of consecutive edges…

A quasi-representation of a group is a map from the group into a matrix algebra (or similar object) that approximately satisfies the relations needed to be a representation. Work of many people starting with Kazhdan and Voiculescu, and…

It has long been known, since the classical work of (Arora, Karger, Karpinski, JCSS~99), that \MC\ admits a PTAS on dense graphs, and more generally, \kCSP\ admits a PTAS on "dense" instances with $\Omega(n^k)$ constraints. In this paper we…

It has long been known that there exist finite connected tetravalent arc-transitive graphs with arbitrarily large vertex-stabilisers. However, beside a well known family of exceptional graphs, related to the lexicographic product of a cycle…

We exhibit a countably infinite family of simple, separable, nuclear, and mutually non-isomorphic C*-algebras which agree on K-theory and traces. The algebras do not absorb the Jiang-Su algebra Z tensorially, answering a question of N. C.…

We prove that random hypergraphs are asymptotically almost surely resiliently Hamiltonian. Specifically, for any $\gamma>0$ and $k\ge3$, we show that asymptotically almost surely, every subgraph of the binomial random $k$-uniform hypergraph…

A $k$-uniform tight cycle is a $k$-uniform hypergraph with a cyclic ordering of its vertices such that its edges are all the sets of size $k$ formed by $k$ consecutive vertices in the ordering. We prove that every red-blue edge-coloured…

A minimum chain cover (MCC) of a $k$-width directed acyclic graph (DAG) $G = (V, E)$ is a set of $k$ chains (paths in the transitive closure) of $G$ such that every vertex appears in at least one chain in the cover. The state-of-the-art…

We show that algebraic equivalence of images of stable maps of curves lifts to deformation equivalence of the stable maps. The main applications concern $A_1(X)$, the group of 1-cycles modulo algebraic equivalence, for smooth, separably…

In this paper, we prove that any analytic quasi-periodic cocycle close to constant is the Poincar\'{e} map of an analytic quasi-periodic linear system close to constant. With this local embedding theorem, we get fruitful new results. We…