This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
We consider a generalization of the model of stochastic search in an out-forest, introduced and studied by Denardo, Rothblum, and Van der Heyden [1]. We provide a simple proof of ...
Abstract. In this paper we provide a simple proof of the extension theorem for partial orderings due to Suzumura [1983] when the domain of the partial order is finite. The extensio...
We give a short and simple proof of Hales and Hallgren's Fourier Sampling Theorem ["Quantum Fourier Sampling Simplified", Proceedings of the Thirty-First Annual ACM...
We examine the classic on-line bipartite matching problem studied by Karp, Vazirani, and Vazirani [8] and provide a simple proof of their result that the Ranking algorithm for thi...
We give a simple proof for a theorem of Katchalski, Last, and Valtr, asserting that the maximum number of edges in a geometric graph G on n vertices with no pair of parallel edges...
Using a technique that Tverberg and Vrecica [TV93] discovered to give a surprisingly simple proof of Tverberg's theorem, we show the following extension of the centerpoint th...
Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfra...
A simple proof is provided for the fact that the set of all possible triangulations of a planar point set in a polygonal domain is closed under the basic diagonal flip operation.
: Bisets can be considered as categories. This note uses this point of view to give a simple proof of a Mackey-like formula expressing the tensor product of two induced bimodules. ...