相关论文: A decomposition of multicorrelation sequences for …

We study decay of correlations, the asymptotic distribution of hitting times and fluctuations of the return times for a robust class of multidimensional non-uniformly hyperbolic transformations. Oliveira and Viana [15] proved that there is…

We present a new method for the calculation of fragment size correlations in a discrete finite system in which correlations explicitly due to the finite extent of the system are suppressed. To this end, we introduce a combinatorial model,…

We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.

We prove that over a commutative semiring every symmetric strongly invertible matrix with nonnegative numerical range has a Cholesky decomposition.

We study the effect of quantum fluctuations on the multiphase point of the Heisenberg model with first- and second-neighbor competing interactions and strong uniaxial spin anisotropy $D$. By studying the structure of perturbation theory we…

For finitely generated modules $N \subsetneq M$ over a Noetherian ring $R$, we study the following properties about primary decomposition: (1) The Compatibility property, which says that if $\ass (M/N)=\{P_1, P_2, ..., P_s\}$ and $Q_i$ is a…

The class of problems complete for NP via first-order reductions is known to be characterized by existential second-order sentences of a fixed form. All such sentences are built around the so-called generalized IS-form of the sentence that…

To give positive answer to a question of Frantzikinakis, we study a class of subsets of $\mathbb{N}$, called interpolation sets, on which every bounded sequence can be extended to an almost periodic sequence on $\mathbb{N}$. Strzelecki has…

In this paper, we develop a theory of common decomposition for two correlated Brownian motions, in which, by using change of time method, the correlated Brownian motions are represented by a triplet of processes, $(X,Y,T)$, where $X$ and…

A long-investigated problem in circuit complexity theory is to decompose an $n$-input or $n$-variable Majority Boolean function (call it $M_n$) using $k$-input ones ($M_k$), $k < n$, where the objective is to achieve the decomposition using…

In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…

The paper investigates recoverability of sequences from their periodic subsequences and offers some modification of the approach suggested in papers arXiv:1605.00414 and arXiv:1803.02233. It is shown that there exists a class of sequences…

We investigate in detail the behavior of the bipartite fluctuations of particle number $\hat{N}$ and spin $\hat{S}^z$ in many-body quantum systems, focusing on systems where such U(1) charges are both conserved and fluctuate within…

We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…

A classic and fundamental result about the decomposition of random sequences into a mixture of simpler ones is de Finetti's Theorem. In its original form it applies to infinite 0-1 valued exchangeable sequences. Later it was extended and…

In this paper we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [$1$-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph $G$ on $n$…

We establish discorrelation estimates between the Piatetski-Shapiro prime set \[ \mathcal{P}_{\gamma} := \{p \text{ is prime and } p = \lfloor n^{1/\gamma} \rfloor \text{ for some } n \in \mathbb{N}\} \] and arbitrary nilsequences when…

We study the real, bounded-variables process (X_n) defined by a k-term recurrence relation X_{n+k} ={\phi}(X_n, ... , X_{n+k-1}). We prove the decay of correlations, mainly under purely analytic hypotheses concerning the function {\phi} and…

A Hamilton cycle in a directed graph $G$ is a cycle that passes through every vertex of $G$. A Hamiltonian decomposition of $G$ is a partition of its edge set into disjoint Hamilton cycles. In the late $60$s Kelly conjectured that every…

We prove that the crossing number of a graph decays in a continuous fashion in the following sense. For any epsilon>0 there is a delta>0 such that for a sufficiently large n, every graph G with n vertices and m > n^{1+epsilon} edges, has a…