Related papers: Shellsort with three increments
We consider the following general model of a sorting procedure: we fix a hereditary permutation class $\mathcal{C}$, which corresponds to the operations that the procedure is allowed to perform in a single step. The input of sorting is a…
We show that any permutation of ${1,2,...,N}$ can be written as the product of two involutions. As a consequence, any permutation of the elements of an array can be performed in-place in parallel in time O(1). In the case where the…
We study the chaotic behavior of the ``GOY'' shell model by measuring the variation of the maximal Lyapunov exponent with the parameter $\epsilon$ which determines the nature of the second invariant (the generalized ``helicity'' invariant).…
Methods for detecting structural changes, or change points, in time series data are widely used in many fields of science and engineering. This chapter sketches some basic methods for the analysis of structural changes in time series data.…
In-place associative integer sorting technique was developed, improved and specialized for distinct integers. The technique is suitable for integer sorting. Hence, given a list S of n integers S[0...n-1], the technique sorts the integers in…
We study unbiased $(1+1)$ evolutionary algorithms on linear functions with an unknown number $n$ of bits with non-zero weight. Static algorithms achieve an optimal runtime of $O(n (\ln n)^{2+\epsilon})$, however, it remained unclear whether…
We prove a generalized fluctuation-dissipation theorem for a certain class of out-of-time-ordered correlators (OTOCs) with a modified statistical average, which we call bipartite OTOCs, for general quantum systems in thermal equilibrium.…
NLO corrections to jet cross sections in DIS at HERA are studied, with particular emphasis on the two jet final state. High jet transverse momenta are a good criterion for the applicability of fixed order perturbation theory. A ``natural''…
Defant and Zheng introduced a consecutive-pattern-avoiding stack sort map $SC_{\sigma}$, where the stack must avoid a consecutive pattern $\sigma$. Seidel and Sun disproved a conjecture in Defant and Zheng's paper about the maximum…
Pop-Stack Sorting is an algorithm that takes a permutation as an input and sorts its elements. It consists of several steps. At one step, the algorithm reads the permutation it has to process from left to right and reverses each of its…
We present results at one-loop order of perturbation theory for various improvement coefficients in on-shell O($a$) improved lattice QCD. In particular we determine the additive counterterm required for on-shell improvement of the isovector…
For a broad class of planar Markov processes, viz. L\'evy processes satisfying certain conditions (valid \textit{eg} in the case of Brownian motion and L\'evy flights), we establish an exact, universal formula describing the shape of the…
It is known in \cite{beccari} that the standard explicit Euler-type scheme (such as the exponential Euler and the linear-implicit Euler schemes) with a uniform timestep, though computationally efficient, may diverge for the stochastic…
We describe an algorithm to simulate time evolution using the Multi-scale Entanglement Renormalization Ansatz (MERA) and test it by studying a critical Ising chain with periodic boundary conditions and with up to L ~ 10^6 quantum spins. The…
We show that if A is a subset of {1,...,N} contains no non-trivial three-term arithmetic progressions then |A|=O(N/ log^{1-o(1)} N). The approach is somewhat different from that used in arXiv:1007.5444.
Several examples suggest the conjecture that the central aspect determining a monotonic evolution for perturbed highly symmetric thin-shells is the approximation adopted for their equations of state.
We explore the fundamental problem of sorting through the lens of learning-augmented algorithms, where algorithms can leverage possibly erroneous predictions to improve their efficiency. We consider two different settings: In the first…
We present improved upper bounds on the spanning ratio of constrained $\theta$-graphs with at least 6 cones and constrained Yao-graphs with 5 or at least 7 cones. Given a set of points in the plane, a Yao-graph partitions the plane around…
We consider combinatorial optimization problems defined over random ensembles, and study how solution cost increases when the optimal solution undergoes a small perturbation delta. For the minimum spanning tree, the increase in cost scales…
We give algorithms with running time $2^{O({\sqrt{k}\log{k}})} \cdot n^{O(1)}$ for the following problems. Given an $n$-vertex unit disk graph $G$ and an integer $k$, decide whether $G$ contains (1) a path on exactly/at least $k$ vertices,…