Related papers: Improved Upper Bounds for Pairing Heaps
The bilayer Hubbard model with an intra-layer hopping $t$ and an inter-layer hopping $t_\perp$ provides an interesting testing ground for several aspects of what has been called unconventional superconductivity. One can study the type of…
Given an irrational alpha and an x in the unit interval, the set of balanced times, for which the same number of (k*alpha+x) (modulo one) are less than or equal to one half as are larger than one half, is in general infinite, but sparse in…
We present a pumping lemma for each level of the collapsible pushdown graph hierarchy in analogy to the second author's pumping lemma for higher-order pushdown graphs (without collapse). Using this lemma, we give the first known examples…
Measure of the weighted cumulative entropy about the predictability of failure time of a system have been introduced in [3]. Referring properties of doubly truncated (interval) cumulative residual and past entropy, several bounds and…
It is proved that the exchange property, the Bass stable rank and the quasi-Bass property are all preserved under surjective inverse limits. This is then applied to multiplier rings by showing that in many cases can be obtained as inverse…
The matched pair theory (of groups) is studied for a class of quasigroups; namely, the $m$-inverse property loops. The theory is upgraded to the Hopf level, and the "$m$-invertible Hopf quasigroups" are introduced.
It is well known that for higher order elliptic equations the positivity preserving property (PPP) may fail. In striking contrast to what happens under Dirichlet boundary conditions, we prove that the PPP holds for the biharmonic operator…
Hamiltonian mixed systems with unbounded phase space are typically characterized by two asymptotic algebraic laws: decay of recurrence time statistics ($\gamma$) and superdiffusion ($\beta$). We conjecture the universal exponents…
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…
Hybrid dynamical systems are systems which posses both continuous and discrete transitions. Assuming that the discrete transitions (resets) occur a finite number of times, the optimal control problem can be solved by gluing together the…
We show the diagonal problem for higher-order pushdown automata (HOPDA), and hence the simultaneous unboundedness problem, is decidable. From recent work by Zetzsche this means that we can construct the downward closure of the set of words…
It is well known that the minimal superhedging price of a contingent claim is too high for practical use. In a continuous-time model uncertainty framework, we consider a relaxed hedging criterion based on acceptable shortfall risks.…
A distance-based inconsistency indicator, defined by the third author for the consistency-driven pairwise comparisons method, is extended to the incomplete case. The corresponding optimization problem is transformed into an equivalent…
Enhancement, due to constructive interference through the many possible reaction channels, occurs in two-neutron transfer reactions from a bound system $A$ to a weakly-bound system ($A$+2), whenever the intermediate system is unbound and…
The Permutation Pattern Matching problem, asking whether a pattern permutation $\pi$ is contained in a permutation $\tau$, is known to be NP-complete. In this paper we present two polynomial time algorithms for special cases. The first…
Most modern control systems are switched, meaning they have continuous as well as discrete decision variables. Switched systems often have constraints called dwell-time constraints (e.g., cycling constraints in a heat pump) on the switching…
The matching of multiple objects (e.g. shapes or images) is a fundamental problem in vision and graphics. In order to robustly handle ambiguities, noise and repetitive patterns in challenging real-world settings, it is essential to take…
In this paper, we present an improved algorithm for the All Pairs Non-decreasing Paths (APNP) problem on weighted simple digraphs, which has running time $\tilde{O}(n^{\frac{3 + \omega}{2}}) = \tilde{O}(n^{2.686})$. Here $n$ is the number…
Given the continuous increase in dataset sizes and the complexity of forecasting models, the trade-off between forecast accuracy and computational cost is emerging as an extremely relevant topic, especially in the context of ensemble…
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as splay trees, can achieve this property in the amortized sense,…