Manipulating Tournaments in Cup and Round Robin Competitions

In sports competitions, teams can manipulate the result by, for instance, throwing games. We show that we can decide how to manipulate round robin and cup competitions, two of the most popular types of sporting competitions in polynomial time. In addition, we show that finding the minimal number of games that need to be thrown to manipulate the result can also be determined in polynomial time. Finally, we show that there are several different variations of standard cup competitions where manipulation remains polynomial.Comment: Proceedings of Algorithmic Decision Theory, First International Conference, ADT 2009, Venice, Italy, October 20-23, 200

Branch Rings, Thinned Rings, Tree Enveloping Rings

We develop the theory of ``branch algebras'', which are infinite-dimensional associative algebras that are isomorphic, up to taking subrings of finite codimension, to a matrix ring over themselves. The main examples come from groups acting on trees. In particular, for every field k we construct a k-algebra K which (1) is finitely generated and infinite-dimensional, but has only finite-dimensional quotients; (2) has a subalgebra of finite codimension, isomorphic to $M_2(K)$; (3) is prime; (4) has quadratic growth, and therefore Gelfand-Kirillov dimension 2; (5) is recursively presented; (6) satisfies no identity; (7) contains a transcendental, invertible element; (8) is semiprimitive if k has characteristic $\neq2$; (9) is graded if k has characteristic 2; (10) is primitive if k is a non-algebraic extension of GF(2); (11) is graded nil and Jacobson radical if k is an algebraic extension of GF(2).Comment: 35 pages; small changes wrt previous versio

Combinatorial Voter Control in Elections

Voter control problems model situations such as an external agent trying to affect the result of an election by adding voters, for example by convincing some voters to vote who would otherwise not attend the election. Traditionally, voters are added one at a time, with the goal of making a distinguished alternative win by adding a minimum number of voters. In this paper, we initiate the study of combinatorial variants of control by adding voters: In our setting, when we choose to add a voter~$v$, we also have to add a whole bundle $\kappa(v)$ of voters associated with $v$. We study the computational complexity of this problem for two of the most basic voting rules, namely the Plurality rule and the Condorcet rule.Comment: An extended abstract appears in MFCS 201

Complexity of Manipulative Actions When Voting with Ties

Most of the computational study of election problems has assumed that each voter's preferences are, or should be extended to, a total order. However in practice voters may have preferences with ties. We study the complexity of manipulative actions on elections where voters can have ties, extending the definitions of the election systems (when necessary) to handle voters with ties. We show that for natural election systems allowing ties can both increase and decrease the complexity of manipulation and bribery, and we state a general result on the effect of voters with ties on the complexity of control.Comment: A version of this paper will appear in ADT-201

Identification of the genetic defect in the original Wagner syndrome family

PURPOSE: The aim of the present study was to determine the genetic defect in Wagner syndrome, a rare disorder belonging to the group of hereditary vitreoretinal degenerations. This disease has been genetically mapped to chromosome 5q14.3. METHODS: Molecular analysis was performed in the progeny of the original pedigree described by Wagner in 1938. We searched for pathogenic mutations and their effects in two candidate genes, CSPG2 and EDIL3, which locate to the critical chromosomal interval. Reverse transcriptase polymerase chain reaction (RT-PCR) analysis was used to investigate potential splice defects of CSPG2 transcripts. RESULTS: While no alterations were detected in the exons of EDIL3, several changes were identified in the CSPG2 gene. Only one of the novel changes, a heterozygous G to A substitution of the first nucleotide in intron 8, cosegregates with the disease phenotype. This change disrupts the highly conserved splice donor sequence. In blood cells of an index patient, we found CSPG2 transcripts with normally spliced exon 8/9 junction but also two additional CSPG2 transcripts, which were not detected in the control. One lacks the entire exon 8, while the other is missing only the last 21 bp of exon 8. CONCLUSIONS: CSPG2 encodes versican, a large proteoglycan, which is an extracellular matrix component of the human vitreous and participates in the formation of the vitreous gel. The splice site mutation described here may lead to a complete lack of exon 8 in CSPG2 transcripts, which shortens the predicted protein by 1754 amino acids and leads to severe reduction of glycosaminoglycan attachment sites

Pseudorandom Selective Excitation in NMR

In this work, average Hamiltonian theory is used to study selective excitation in a spin-1/2 system evolving under a series of small flip-angle $\theta-$pulses $(\theta\ll 1)$ that are applied either periodically [which corresponds to the DANTE pulse sequence] or aperiodically. First, an average Hamiltonian description of the DANTE pulse sequence is developed; such a description is determined to be valid either at or very far from the DANTE resonance frequencies, which are simply integer multiples of the inverse of the interpulse delay. For aperiodic excitation schemes where the interpulse delays are chosen pseudorandomly, a single resonance can be selectively excited if the $\theta$-pulses' phases are modulated in concert with the time delays. Such a selective pulse is termed a pseudorandom-DANTE or p-DANTE sequence, and the conditions in which an average Hamiltonian description of p-DANTE is found to be similar to that found for the DANTE sequence. It is also shown that averaging over different p-DANTE sequences that are selective for the same resonance can help reduce excitations at frequencies away from the resonance frequency, thereby improving the apparent selectivity of the p-DANTE sequences. Finally, experimental demonstrations of p-DANTE sequences and comparisons with theory are presented.Comment: 23 pages, 8 figure