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

We prove that every flat nonlinear discrete-time system can be decomposed by coordinate transformations into a smaller-dimensional subsystem and an endogenous dynamic feedback. For flat continuous-time systems, no comparable result is…

We assess the probability of resonances between sufficiently distant states in a combinatorial graph serving as the configuration space of an N-particle disordered quantum system. This includes the cases where the transition "shuffles" the…

We investigate the properties of a class of mode-coupling equations for the glass transition where the density mode decays into multiple relaxation channels. We prove the existence and uniqueness of the solutions for Newtonian as well as…

We prove the existence as well as regularity of a finite range decomposition for the resolvent $G_{\alpha} (x-y,m^2) = ((-\Delta)^{\alpha\over 2} + m^{2})^{-1} (x-y) $, for $0<\alpha<2$ and all real $m$, in the lattice ${\mathbf Z}^{d}$ as…

Motivated by the wide-ranging applications of Hamiltonian decompositions in distributed computing, coded caching, routing, resource allocation, load balancing, and fault tolerance, our work presents a comprehensive design for Hamiltonian…

We discuss the uniqueness or non-uniqueness problem of the decomposition of the gluon field into the physical and pure-gauge components, which is the basis of the recently proposed two physically inequivalent gauge-invariant decompositions…

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…

In this work we show how to decompose a linear code relatively to any given poset metric. We prove that the complexity of syndrome decoding is determined by a maximal (primary) such decomposition and then show that a refinement of a partial…

A reconstruction problem is formulated for multisets over commutative groupoids. The cards of a multiset are obtained by replacing a pair of its elements by their sum. Necessary and sufficient conditions for the reconstructibility of…

A collection of complex sequences of length v is complementary if the sum of their periodic autocorrelation function values at all non-zero shifts is constant. For a complex sequence A=[a_0,a_1,...,a_{v-1}] of length v=dm we define the…

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

A decomposition of a multigraph $G$ is a partition of its edges into subgraphs $G(1), \ldots , G(k)$. It is called an $r$-factorization if every $G(i)$ is $r$-regular and spanning. If $G$ is a subgraph of $H$, a decomposition of $G$ is said…

Background Nucleotide sequences contain multiple codes responsible for organism's functioning and structure. They can be investigated by various signal processing methods. These techniques are well suited for indication of frequently…

In rigidly supersymmetric quantum theories, the Nicolai map allows one to turn on a coupling constant (from zero to a finite value) by keeping the (free) functional integration measure but subjecting the fields to a particular nonlocal and…

In this paper, we present a quasi-polynomial time classical algorithm that estimates the partition function of quantum many-body systems at temperatures above the thermal phase transition point. It is known that in the worst case, the same…

In this paper we consider permutations of sequences of partitions, obtaining a result which parallels von Neumann's theorem on permutations of dense sequences and uniformly distributed sequences of points.

We develop a combinatorial and order-theoretic framework for shuffles, understood as ordered concatenations of indexed families of sequences that induce total orders on the natural numbers. Motivated by the classical \v{S}arkovski\u{i}…

Classic results by L.-S. Young show that the decay of correlations for systems that admit inducing schemes can be obtained through the recurrence rates of the inducing scheme. Reciprocal results were obtained for non-invertible systems…

Recall that a Stirling permutation is a permutation on the multiset $\{1,1,2,2,\ldots,n,n\}$ such that any numbers appearing between repeated values of $i$ must be greater than $i$. We call a Stirling permutation ``flattened'' if the…

In this paper we establish decomposition theorems for derivations of group rings. We provide a topological technique for studying derivations of a group ring $A[G]$ in case $G$ has finite conjugacy classes. As a result, we describe all…