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

We consider ergodic series of the form $\sum_{n=0}^\infty a_n f(T^n x)$ where $f$ is an integrable function with zero mean value with respect to a $T$-invariant measure $\mu$. Under certain conditions on the dynamical system $T$, the…

We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…

We prove that constant minimum degree already forces cycles with almost linearly many chords. Specifically, every graph $G$ with $\delta(G)\ge C$ contains a cycle of length $\ell\ge 4$ with $\Omega(\ell/\log^{C}\ell)$ chords for some…

We prove that for all $k\geq 4$ and $1\leq\ell<k/2$, every $k$-uniform hypergraph $\mathcal{H}$ on $n$ vertices with $\delta_{k-2}(\mathcal{H})\geq\left(\frac{4(k-\ell)-1}{4(k-\ell)^2}+o(1)\right)\binom{n}{2}$ contains a Hamiltonian…

This paper gives the most general form of the Adler-Kostant-Symes Theorem, and many applications of it, both finite and infinite dimensional, the former yielding algebraic completely integrable (a.c.i.) systems, and the latter examples in…

A recently posed question of Haggkvist and Scott's asked whether or not there exists a constant c such that if G is a graph of minimum degree ck then G contains cycles of k consecutive even lengths. In this paper we answer the question by…

This work is devoted to the almost sure stabilization of adaptive control systems that involve an unknown Markov chain. The control system displays continuous dynamics represented by differential equations and discrete events given by a…

The purpose of this article is to demonstrate that non-crystallographic reflection groups can be used to build new solvable quantum particle systems. We explicitly construct a one-parametric family of solvable four-body systems on a line,…

A group G is almost cyclic if there is an element x in G, such that for all g in G, there is an element y in G and an integer n with ygy^{-1} = x^n (that is, every element is conjugate to some power of x). W. Ziller asked whether there are…

We conjecture that the balanced complete bipartite graph $K_{\lfloor n/2 \rfloor,\lceil n/2 \rceil}$ contains more cycles than any other $n$-vertex triangle-free graph, and we make some progress toward proving this. We give equivalent…

The article is devoted to the study of non-autonomous Navier-Stokes equations. First, the authors have proved that such systems admit compact global attractors. This problem is formulated and solved in the terms of general non-autonomous…

We prove the almost sure existence of absolutely continuous spectrum at low disorder for the Anderson model on the simplest example of a product of a regular tree with a finite graph. This graph contains loops of unbounded size.

We review some recent results on quasi-exactly solvable spin models presenting near-neighbors interactions. These systems can be understood as cyclic generalizations of the usual Calogero-Sutherland models. A nontrivial modification of the…

This paper considers discrete-time linear systems with bounded additive disturbances, and studies the convergence properties of the backward reachable sets of robust controlled invariant sets (RCIS). Under a simple condition, we prove that…

In this document, some structured operator approximation theoretical methods for system identification of nearly eventually periodic systems, are presented. Let $\mathbb{C}^{n\times m}$ denote the algebra of $n\times m$ complex matrices.…

The aim of this paper is studying the problem of almost periodicity of almost periodic lattice dynamical systems of the form $u_{i}'=\nu (u_{i-1}-2u_i+u_{i+1})-\lambda u_{i}+F(u_i)+f_{i}(t)\ (i\in \mathbb Z,\ \lambda >0)$. We prove the…

We consider the \emph{$k$-edge connected spanning subgraph} (kECSS) problem, where we are given an undirected graph $G = (V, E)$ with nonnegative edge costs $\{c_e\}_{e\in E}$, and we seek a minimum-cost \emph{$k$-edge connected} subgraph…

In many dynamical systems, countably infinitely many invariant tori co-exist. The occurrence of quasiperiodicity on any one of these tori is sometimes sufficient to establish strong global properties, like dense trajectories and periodic…

Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence has been settled a long time ago. Yet, in comparison with Steiner triple systems, little is known about their automorphism groups. In…

We study the problem of \emph{robust satisfiability} of systems of nonlinear equations, namely, whether for a given continuous function $f:\,K\to\mathbb{R}^n$ on a~finite simplicial complex $K$ and $\alpha>0$, it holds that each function…