Related papers: Maximal compatibility of disklike $G$-transfer sys…
Here, we develop a theory of radiative heat transfer based on an equivalent electrical network representation for the hot material slabs in an arbitrary multilayered environment with arbitrary distribution of temperatures and…
Fixed-size commutative rings are quasi-ordered such that all scalar linearly solvable networks over any given ring are also scalar linearly solvable over any higher-ordered ring. As consequences, if a network has a scalar linear solution…
We study a statistical model defined by a conformally invariant distribution of overlapping spheres in arbitrary dimension d. The model arises as the asymptotic distribution of cosmic bubbles in d+1 dimensional de Sitter space, and also as…
We characterize $A_\infty$-structures that are transfers over a chain homotopy equivalence or a quasi-isomorphism, answering a question posed by D. Sullivan. Along the way, we present an obstruction theory for weak $A_\infty$-morphisms over…
We describe $\sigma$-matching, interchangeable and, as a consequence, totally compatible structures on the strictly upper triangular matrix algebra $UT_n(K)$ for all $n\ge 3$.
A computational procedure is developed for determining the conversion probability for reaction-diffusion systems in which a first-order catalytic reaction is performed over active particles. We apply this general method to systems on metric…
This work presents an exactly soluble scheme to address the problem of optimal transfer of quantum states through a set of $s$ harmonic oscillators composing a network with connected ends as a closed quantum circuit. For this purpose we…
This work inspects the thermally activated transfer of solute particles across the interface between two interstitial solid solution phases that equilibrate internally by fast diffusion on conserved arrays of sites. When each phase is…
This note aims to demonstrate that performing maximum-likelihood estimation for a mixture model is equivalent to minimizing over the parameters an optimal transport problem with entropic regularization. The objective is pedagogical: we seek…
We propose a new concept for the regularization and discretization of transfer and Koopman operators in dynamical systems. Our approach is based on the entropically regularized optimal transport between two probability measures. In…
A transitive graph is 2-dimensional if it can be represented as the intersection of two linear orders. Such representations make answering of reachability queries trivial, and allow many problems that are NP-hard on arbitrary graphs to be…
Quantum synchronisation has recently been proposed as a mechanism for electronic excitation energy transfer in light-harvesting complexes, yet its robustness in driven-dissipative settings remains under active investigation. Here, we…
We explicitly determine the spectrum of transfer operators (acting on spaces of holomorphic functions) associated to analytic expanding circle maps arising from finite Blaschke products. This is achieved by deriving a convenient natural…
Arbieto and S. recently used atomic decomposition to study transfer operators. We give a long list of old and new expanding dynamical systems for which those results can be applied, obtaining the quasi-compactness of transfer operator…
The max-product algorithm, a local message-passing scheme that attempts to compute the most probable assignment (MAP) of a given probability distribution, has been successfully employed as a method of approximate inference for applications…
We propose an efficient variation of the fermionic swap network scheme used to efficiently simulate n-dimensional Fermi-Hubbard-model Hamiltonians encoded using the Jordan-Wigner transform. For the two-dimensional versions, we show that our…
For a class of Hamiltonian systems naturally arising in the modern theory of separation of variables, we establish their maximal superintegrability by explicitly constructing the additional integrals of motion.
Previous studies have shown that bipartite Hubbard systems with inhomogeneous hopping amplitudes can exhibit higher pair-binding energies than the uniform model. Here we examine whether this result holds for systems with a more generic band…
We consider the communication complexity of finding an approximate maximum matching in a graph in a multi-party message-passing communication model. The maximum matching problem is one of the most fundamental graph combinatorial problems,…
The seminal work of Roth, S\"onmez, & \"Unver shows that the Edmonds-Gallai structure theorem for non-bipartite matching can be leveraged to yield a randomized algorithm to match patient-donor pairs in kidney exchange with extraordinarily…