相关论文: Improved Upper Bounds for Pairing Heaps
We enumerate interlaced pairs of parking functions whose underlying Dyck path has a bounded height. We obtain an explicit formula for this enumeration in the form of a quotient of analogs of Chebicheff polynomials having coefficients in the…
Bifurcations in a system of coupled maps are investigated. Using symbolic dynamics it is proven that for coupled shift maps the well known space--time--mixing attractor becomes unstable at a critical coupling strength in favour of a…
A sound and complete algorithm for nominal unification of higher-order expressions with a recursive let is described, and shown to run in non-deterministic polynomial time. We also explore specializations like nominal letrec-matching for…
Given a topologically transitive system on the unit interval, one can investigate the cover time, i.e. time for an orbit to reach certain level of resolution in the repeller. We introduce a new notion of dimension, namely the stretched…
The running-time analysis of evolutionary combinatorial optimization is a fundamental topic in evolutionary computation. Its current research mainly focuses on specific algorithms for simplified problems due to the challenge posed by…
We investigate the convergence properties of popular data-augmentation samplers for Bayesian probit regression. Leveraging recent results on Gibbs samplers for log-concave targets, we provide simple and explicit non-asymptotic bounds on the…
Symmetrical subdivisions in the space of Jager Pairs for continued fractions-like expansions will provide us with bounds on their difference. Results will also apply to the classical regular and backwards continued fractions expansions,…
Baswana, Gupta and Sen [FOCS'11] showed that fully dynamic maximal matching can be maintained in general graphs with logarithmic amortized update time. More specifically, starting from an empty graph on $n$ fixed vertices, they devised a…
Peer methods are a comprehensive class of time integrators offering numerous degrees of freedom in their coefficient matrices that can be used to ensure advantageous properties, e.g. A-stability or super-convergence. In this paper, we show…
We present simulations on a binary blend of bead-spring polymer chains. The introduction of monomer size disparity yields very different relaxation times for each component of the blend. Competition between two different arrest mechanisms,…
We introduce a new update scheme to systematically improve the efficiency of parallel tempering simulations. We show that by adapting the number of sweeps between replica exchanges to the canonical autocorrelation time, the average…
For non-uniformly expanding maps inducing with a general return time to Gibbs Markov maps, we provide sufficient conditions for obtaining higher order asymptotics for the correlation function in the infinite measure setting. Along the way,…
We give new approximation algorithms for the submodular joint replenishment problem and the inventory routing problem, using an iterative rounding approach. In both problems, we are given a set of $N$ items and a discrete time horizon of…
The recent paper claims that mean characteristics of chaotic orbits differ from the corresponding values averaged over the set of unstable periodic orbits, embedded in the chaotic attractor. We demonstrate that the alleged discrepancy is an…
We find that imposing the crossing symmetry in the iteration process considerably extends the range of convergence for solutions of the parquet equations for the Hubbard model. When the crossing symmetry is not imposed, the convergence of…
This article introduces a new optimization method to improve mergesort's runtime complexity, when sorting sequences that have equal keys to $O(n log_2 k)$, where $k$ is the number of distinct keys in the sequence. When $k$ is constant, it…
The desirable gambles framework provides a rigorous foundation for imprecise probability theory but relies heavily on linear utility via its coherence axioms. In our related work, we introduced function-coherent gambles to accommodate…
We present a new threshold phenomenon in data structure lower bounds where slightly reduced update times lead to exploding query times. Consider incremental connectivity, letting t_u be the time to insert an edge and t_q be the query time.…
We study the existence of asymptotically stable periodic trajectories induced by reset feedback. The analysis is developed for a planar system. Casting the problem into the hybrid setting, we show that a periodic orbit arises from the…
In this paper, we study a time-inconsistent consumption-investment problem with random endowments in a possibly incomplete market under general discount functions. We provide a necessary condition and a verification theorem for an open-loop…