Exploiting the Difference in Probability Calculation between Quantum and Probabilistic Computations

The main purpose of this paper is to show that we can exploit the difference ($l_1$-norm and $l_2$-norm) in the probability calculation between quantum and probabilistic computations to claim the difference in their space efficiencies. It is shown that there is a finite language $L$ which contains sentences of length up to $O(n^{c+1})$ such that: ($i$) There is a one-way quantum finite automaton (qfa) of $O(n^{c+4})$ states which recognizes $L$. ($ii$) However, if we try to simulate this qfa by a probabilistic finite automaton (pfa) \textit{using the same algorithm}, then it needs $\Omega(n^{2c+4})$ states. It should be noted that we do not prove real lower bounds for pfa's but show that if pfa's and qfa's use exactly the same algorithm, then qfa's need much less states.Comment: 11 pages and 5 figure

Finding large stable matchings

When ties and incomplete preference lists are permitted in the stable marriage and hospitals/residents problems, stable matchings can have different sizes. The problem of finding a maximum cardinality stable matching in this context is known to be NP-hard, even under very severe restrictions on the number, size, and position of ties. In this article, we present two new heuristics for finding large stable matchings in variants of these problems in which ties are on one side only. We describe an empirical study involving these heuristics and the best existing approximation algorithm for this problem. Our results indicate that all three of these algorithms perform significantly better than naive tie-breaking algorithms when applied to real-world and randomly-generated data sets and that one of the new heuristics fares slightly better than the other algorithms, in most cases. This study, and these particular problem variants, are motivated by important applications in large-scale centralized matching schemes

Interacting open p-branes

The Kalb-Ramond action, derived for interacting strings through an action-at-a-distance force, is generalized to the case of interacting p-dimensional objects (p-branes) in D-dimensional space-time. The open p-brane version of the theory is especially taken up. On account of the existence of their boundary surface, the fields mediating interactions between open p-branes are obtained as massive gauge fields, quite in contrast to massless gauge ones for closed p-branes.Comment: 10 pages, LaTe

Guest editorial: Special issue on matching under preferences

No abstract available

Moment Approach for Determining the Orbital Elements of an Astrometric Binary with Low Signal-to-noise Ratio

A moment approach for orbit determinations of an astrometric binary with low signal-to-noise ratio from astrometric observations alone is proposed, especially aiming at a close binary system with a short orbital period such as Cyg-X1 and also at a star wobbled by planets. As an exact solution to the nonlinearly coupled equation system, the orbital elements are written in terms of the second and third moments of projected positions that are measured by astrometry. This may give a possible estimation of the true orbit.Comment: 18 pages, 5 figures, 1 table; accepted by PAS