相关论文: Improved Upper Bounds for Pairing Heaps

We consider a two-parameter family of random substitutions and show certain combinatorial and topological properties they satisfy. We establish that they admit recognisable words at every level. As a consequence, we get that the subshifts…

In a recent Letter, Hunt and Ott argued that SHORT-period unstable periodic orbits (UPOs) would be the invariant sets associated with a chaotic attractor that are most likely to optimize the time average of some smooth scalar performance…

We present a microscopic theory of fluctuation-mediated pairing mechanism in a two-dimensional extended Hubbard model. In contrast to conventional wisdom, odd-frequency spin-triplet pairing can be stabilized near the spin-density-wave…

We associate to any dynamical system with finitely many periodic orbits of each length a collection of possible time-changes of the sequence of periodic point counts that preserve the property of counting periodic points. Intersecting over…

Pairwise comparison matrices have received substantial attention in a variety of applications, especially in rank aggregation, the task of flattening items into a one-dimensional (and thus transitive) ranking. However, non-transitive…

The infinite Projected Entangled Pair States (iPEPS) algorithm [J. Jordan et al, PRL 101, 250602 (2008)] has become a useful tool in the calculation of ground state properties of 2d quantum lattice systems in the thermodynamic limit.…

This paper examines the valuation of American capped call options with two-level caps. The structure of the immediate exercise region is significantly more complex than in the classical case with constant cap. When the cap grows over time,…

In this work we consider the dynamics of a chain of many coupled kicked rotors with dissipation. We map a rich phase diagram with many dynamical regimes. We focus mainly on a regime where the system shows period doubling, and forms patterns…

In this paper, an estimation of lower bound of topological entropy for coupled-expanding systems associated with transition matrices in compact Hausdorff spaces is given. Estimations of upper and lower bounds of topological entropy for…

In this paper we examine the importance of the choice of metric in path coupling, and the relationship of this to \emph{stopping time analysis}. We give strong evidence that stopping time analysis is no more powerful than standard path…

In this paper, we focus attention on extending the topological conjugacy of adding machine maps and minimal systems to iterated function systems. We provide necessary and sufficient conditions for an iterated function system to be…

We show that if $f$ is an annular homeomorphism admitting an attractor which is an irreducible annular continua with two different rotation numbers, then the entropy of $f$ is positive. Further, the entropy is shown to be associated to a…

It is proven, without using the microscopic reversibility argument of Onsager, that lossy reciprocal systems have a hidden time-reversal symmetry. The key idea is that the dissipation channels of lossy dielectrics can be mimicked by a…

A one-step analysis of Anderson acceleration with general algorithmic depths is presented. The resulting residual bounds within both contractive and noncontractive settings reveal the balance between the contributions from the higher and…

In this paper we study functions on the interval that have the same persistent homology. By introducing an equivalence relation modeled after topological conjugacy, which we call graph-equivalence, a precise enumeration of functions with…

There exists a simple, didactically useful one-to-one relationship between stopping times and adapted c\`agl\`ad (LCRL) processes that are non-increasing and take the values 0 and 1 only. As a consequence, stopping times are always hitting…

In a recent work, Baladi and Demers constructed a measure of maximal entropy for finite horizon dispersing billiard maps and proved that it is unique, mixing and moreover Bernoulli. We show that this measure enjoys natural probabilistic…

We present a combinatorial approach to rigorously show the existence of fixed points, periodic orbits, and symbolic dynamics in discrete-time dynamical systems, as well as to find numerical approximations of such objects. Our approach…

We describe an approach to bounded-memory computation of persistent homology and betti barcodes, in which a computational state is maintained with updates introducing new edges to the underlying neighbourhood graph and percolating the…

Using a two-channel Anderson model, we develop a theory of composite pairing in the 115 family of heavy fermion superconductors that incorporates the effects of f-electron valence fluctuations. Our calculations introduce "symplectic Hubbard…