Related papers: Counting Integer Points in Multi-Index Transportat…
Electronic transport through chaotic quantum dots exhibits universal behaviour which can be understood through the semiclassical approximation. Within the approximation, transport moments reduce to codifying classical correlations between…
In this paper, we present a new method via the transfer matrix approach to obtain asymptotic formulae of orthogonal polynomials with asymptotically identical coefficients of bounded variation. We make use of the hyperbolicity of the…
Let $f(x)$ be a polynomial of degree $n \ge 1$ with real coefficients and let $X \ge 2$ and $\delta \ge 0$ be real numbers. Let $\|\cdot\|$ be the distance to the nearest integer. We obtain upper bounds for the number of solutions to the…
Intersection numbers of Stokes polytopes living in complex projective space are computed using the techniques employed to find the inverse string KLT matrix elements in terms of intersection numbers of associahedra. To do this requires an…
We obtain the rigorous uniform asymptotics of a particular integral where a stationary point is close to an endpoint. There exists a general method introduced by Bleistein for obtaining uniform asymptotics in this situation. However, this…
Recent experiments have probed quantum dots through transport measurements in the regime where they are described by a two lead Anderson model. In this paper we develop a new method to analytically compute for the first time the…
We review various numerical approaches to compute transport coefficients in molecular dynamics. These approaches can be broadly classified into three groups: (i) nonequilibrium methods based on applying an external driving field to the…
We prove an asymptotic formula for the number of $k$-uniform hypergraphs with a given degree sequence, for a wide range of parameters. In particular, we find a formula that is asymptotically equal to the number of $d$-regular $k$-uniform…
We establish several asymptotic formulae and upper bounds for the count of multiplicatively dependent integer vectors that lie on a fixed hyperplane and have bounded height. This work constitutes a direct extension of the results obtained…
We introduce fast algorithms for generalized unnormalized optimal transport. To handle densities with different total mass, we consider a dynamic model, which mixes the $L^p$ optimal transport with $L^p$ distance. For $p=1$, we derive the…
The scattering theory of quantum transport relates transport properties of disordered mesoscopic conductors to their transfer matrix $\bbox{T}$. We introduce a novel approach to the statistics of transport quantities which expresses the…
We describe the $C_2$-equivariant homotopy type of the space of commuting n-tuples in the stable unitary group in terms of Real K-theory. The result is used to give a complete calculation of the homotopy groups of the space of commuting…
We study an asymptotic formula for counting integral points over an equation defined by a non-degenerated indefinite integral ternary quadratic form $f$ representing a non-zero integer $a$ such that $-a\cdot det(f)$ is square over a number…
We have developed a numerical approach to compute real-time path integral expressions for quantum transport problems out of equilibrium. The scheme is based on a deterministic iterative summation of the path integral (ISPI) for the…
Approximating periodic solutions to the coupled Duffing equations amounts to solving a system of polynomial equations. The number of complex solutions measures the algebraic complexity of this approximation problem. Using the theory of…
A probabilistic method for solving the Monge-Kantorovich mass transport problem on $R^d$ is introduced. A system of empirical measures of independent particles is built in such a way that it obeys a doubly indexed large deviation principle…
We study a refined version of the Linnik problem on the asymptotic behavior of the number of representations of integer $m$ by an integral polynomial as $m$ tends to infinity. We assume that the polynomial arises from invariant theory, and…
We describe a perturbation method that can be used to reduce the problem of finding the multivariate generating function (MGF) of a non-simple polytope to computing the MGF of simple polytopes. We then construct a perturbation that works…
Given a primitive collection of vectors in the integer lattice, we count the number of ways it can be extended to a basis by vectors with sup-norm bounded by $T$, producing an asymptotic estimate as $T \to \infty$. This problem can be…
In this paper, we present a numerical method, based on iterative Bregman projections, to solve the optimal transport problem with Coulomb cost. This is related to the strong interaction limit of Density Functional Theory. The first idea is…