相关论文: Improved Upper Bounds for Pairing Heaps

By an analogy to the duality between the recurrence time and the longest match length, we introduce a quantity dual to the maximal repetition length, which we call the repetition time. Extending prior results, we sandwich the repetition…

Competing time scales generate novelty. Here, we show that a coupling between the time scales imposed by instrument inertia and the formation of inter-particle frictional contacts in shear-thickening suspensions leads to highly asymmetric…

We present two types of meta-algorithm that can greatly improve the accuracy of existing algorithms for integrating the equations of motion of dynamical systems. The first meta-algorithm takes an integrator that is time-symmetric only for…

We investigate how the notions of pairings of operads of May and compatible pairs of indexing systems of Blumberg--Hill relate via the correspondence between indexing systems and $N_{\infty}$-operads. We show that a pairing of operads…

We present here a more general version of the balanced pair algorithm. This version works in the reducible case and terminates more often than the standard algorithm. We present examples to illustrate this point. Lastly, we discuss the…

Evidence for strong pairing at arbitrary small J/t is provided in a t-J model on the checkerboard lattice for the sign of hopping leading to frustration in hole motion. Destructive quantum interferences suppress Nagaoka ferromagnetism when…

Efficient computation of trajectories of switched affine systems becomes possible, if for any such hybrid system, we can manage to efficiently compute the sequence of switching times. Once the switching times have been computed, we can…

We investigate the relationship between the dynamical properties of minimal topological dynamical systems and the multiplicative combinatorial properties of return time sets arising from those systems. In particular, we prove that for a…

This paper presents a new algorithm for the fast, shared memory, multi-core computation of augmented contour trees on triangulations. In contrast to most existing parallel algorithms our technique computes augmented trees, enabling the full…

We study signatures of superconductivity in a 2--leg "checkerboard" Hubbard ladder model, defined as a one--dimensional (period 2) array of square plaquettes with an intra-plaquette hopping $t$ and inter-plaquette hopping $t'$, using the…

We investigate the properties of chain recurrent, chain transitive, and chain mixing maps (generalizations of the well-known notions of non-wandering, topologically transitive, and topologically mixing maps). We describe the structure of…

Pair correlations are described in the framework of the HFB approximation applied to a uniformly rotating system (Cranking model). The reduction of the moments of inertia, the classification of rotational bands as multi quasiparticle…

Using the correspondence between a cycle up-down permutation and a pair of matchings, we give a combinatorial proof of the enumeration of alternating permutations according to the given peak set.

A single-step high-order implicit time integration scheme with controllable numerical dissipation at high frequencies is presented for the transient analysis of structural dynamic problems. The amount of numerical dissipation is controlled…

A model is proposed for a class of asynchronous sample-and-hold operators that is relevant in the analysis of embedded and networked systems. The model is parametrized by characteristics of the corresponding time-varying input-output delay.…

This paper describes the shortest path problem in weighted graphs and examines the differences in efficiency that occur when using Dijkstra's algorithm with a Fibonacci heap, binary heap, and self-balancing binary tree. Using C++…

Entrainment by a pacemaker, representing an element with a higher frequency, is numerically investigated for several classes of random networks which consist of identical phase oscillators. We find that the entrainment frequency window of a…

We prove that return time statistics of a dynamical system do not change if one passes to an induced (i.e. first return) map. We apply this to show exponential return time statistics in i) smooth interval maps with nowhere-dense critical…

We consider a class of simple one parameter families of interval maps, and we study how metric (resp. topological) entropy changes as the parameter varies. We show that in many cases the entropy displays a semi-regular behaviour, i.e. it is…

We prove a lower bound on the size of bottlenecks in uniform quadrangulations, valid at all scales simultaneously. We use it to establish upper bounds on the uniform mixing time of the lazy random walk on uniform quadrangulations, as well…