Deciding the Winner of an Arbitrary Finite Poset Game is PSPACE-Complete

A poset game is a two-player game played over a partially ordered set (poset) in which the players alternate choosing an element of the poset, removing it and all elements greater than it. The first player unable to select an element of the poset loses. Polynomial time algorithms exist for certain restricted classes of poset games, such as the game of Nim. However, until recently the complexity of arbitrary finite poset games was only known to exist somewhere between NC^1 and PSPACE. We resolve this discrepancy by showing that deciding the winner of an arbitrary finite poset game is PSPACE-complete. To this end, we give an explicit reduction from Node Kayles, a PSPACE-complete game in which players vie to chose an independent set in a graph

Studies of nucleotide sequences in TMV-RNA. II - The action of spleen diesterase

Spleen diesterase action on polynucleotide and ribonucleic acid infectivit

A new heap game

Given $k\ge 3$ heaps of tokens. The moves of the 2-player game introduced here are to either take a positive number of tokens from at most $k-1$ heaps, or to remove the {\sl same} positive number of tokens from all the $k$ heaps. We analyse this extension of Wythoff's game and provide a polynomial-time strategy for it.Comment: To appear in Computer Games 199

Words with the Maximum Number of Abelian Squares

An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain $\Theta(n^2)$ distinct factors that are abelian squares. We study infinite words such that the number of abelian square factors of length $n$ grows quadratically with $n$.Comment: To appear in the proceedings of WORDS 201

Epidemiology of gastroenteropancreatic neuroendocrine tumours.

Gastroenteropancreatic neuroendocrine tumours are a heterogeneous group of tumours arising from diffuse endocrine cells, causing unique clinical syndromes. These tumours, formerly named carcinoid, can involve any part of the gastrointestinal tract and the endocrine pancreas and have a wide range of malignant potential: from benign to poorly differentiated tumours. In this review we will summarize the data available on the epidemiology of gastroenteropancreatic tumours as it is reported from around the world. This includes annual incidence rates at the various anatomic sites, and trends in incidence rates with time. In addition age and stage at presentation, gender and racial differences and finally prognosis and survival were collected when reported

Palindromic complexity of trees

We consider finite trees with edges labeled by letters on a finite alphabet $\varSigma$. Each pair of nodes defines a unique labeled path whose trace is a word of the free monoid $\varSigma^*$. The set of all such words defines the language of the tree. In this paper, we investigate the palindromic complexity of trees and provide hints for an upper bound on the number of distinct palindromes in the language of a tree.Comment: Submitted to the conference DLT201

Construction and Expected Performance of the Hadron Blind Detector for the PHENIX Experiment at RHIC

A new Hadron Blind Detector (HBD) for electron identification in high density hadron environment has been installed in the PHENIX detector at RHIC in the fall of 2006. The HBD will identify low momentum electron-positron pairs to reduce the combinatorial background in the $e^{+}e^{-}$ mass spectrum, mainly in the low-mass region below 1 GeV/c$^{2}$. The HBD is a windowless proximity-focusing Cherenkov detector with a radiator length of 50 cm, a CsI photocathode and three layers of Gas Electron Multipliers (GEM). The HBD uses pure CF$_{4}$ as a radiator and a detector gas. Construction details and the expected performance of the detector are described.Comment: QM2006 proceedings, 4 pages 3 figure

Game saturation of intersecting families

We consider the following combinatorial game: two players, Fast and Slow, claim $k$-element subsets of $[n]=\{1,2,...,n\}$ alternately, one at each turn, such that both players are allowed to pick sets that intersect all previously claimed subsets. The game ends when there does not exist any unclaimed $k$-subset that meets all already claimed sets. The score of the game is the number of sets claimed by the two players, the aim of Fast is to keep the score as low as possible, while the aim of Slow is to postpone the game's end as long as possible. The game saturation number is the score of the game when both players play according to an optimal strategy. To be precise we have to distinguish two cases depending on which player takes the first move. Let $gsat_F(\mathbb{I}_{n,k})$ and $gsat_S(\mathbb{I}_{n,k})$ denote the score of the saturation game when both players play according to an optimal strategy and the game starts with Fast's or Slow's move, respectively. We prove that $\Omega_k(n^{k/3-5}) \le gsat_F(\mathbb{I}_{n,k}),gsat_S(\mathbb{I}_{n,k}) \le O_k(n^{k-\sqrt{k}/2})$ holds

Development of a triple GEM UV-photon detector operated in pure CF4 for the PHENIX experiment

Results obtained with a triple GEM detector operated in pure CF4 with and without a reflective CsI photocathode are presented. The detector operates in a stable mode at gains up to 10^4. A deviation from exponential growth starts to develop when the total charge exceeds ~ 4 10^6 e leading to gain saturation when the total charge is ~ 2 10^7 e and making the structure relatively robust against discharges. No aging effects are observed in the GEM foils after a total accumulated charge of ~ 10 mC/cm^2 at the anode. The ion back-flow current to the reflective photocathode is comparable to the electron current to the anode. However, no significant degradation of the CsI photocathode is observed for a total ion back-flow charge of ~ 7 mC/cm^2.Comment: 14 pages, 11 figures, Submitted to NIM