We study the magneto-transport in Aharonov-Bohm (AB) billiards forming doubly connected structures. In these systems, non-averaged conductance oscillates as a function of magnetic flux with period h/e. We derive formulas of the correlation function C(∆φ) of the magneto-conductance for chaotic and regular AB billiards by use of the semiclassical theory. The different higher harmonics behaviors f...

A tournament T is a pair (A,≻), whereA is a set of alternatives and ≻ is an asymmetric and complete (and thus irreflexive) binary relation on A, usually referred to as the dominance relation. The dominance relation can be extended to sets of alternatives by writing X ≻ Y when x ≻ y for all x ∈ X and y ∈ Y . For a tournament (A,≻), an alternative x ∈ A, and a subset X ⊆ A of alternatives, we den...

A Steinhaus matrix is a binary square matrix of size n which is symmetric, with diagonal of zeros, and whose upper-triangular coefficients satisfy ai,j = ai−1,j−1+ai−1,j for all 2 6 i < j 6 n. Steinhaus matrices are determined by their first row. A Steinhaus graph is a simple graph whose adjacency matrix is a Steinhaus matrix. We give a short new proof of a theorem, due to Dymacek, which states...

UNLABELLED Competition-specific conditioning for tournament basketball games is challenging, as the demands of tournament formats are not well characterized. PURPOSE To compare the physical, physiological, and tactical demands of seasonal and tournament basketball competition and determine the pattern of changes within an international tournament. METHODS Eight elite junior male basketball ...

For a tournament T , let ν3(T ) denote the maximum number of pairwise arc-disjoint triangles in T . Let ν3(n) denote the minimum of ν3(T ) ranging over all regular tournaments with n vertices (n odd). It is conjectured that ν3(n) = (1 + on(1))n /9 and proved that n 11.43 (1− on(1)) ≤ ν3(n) ≤ n 9 (1 + on(1)) improving upon the best known upper bound and lower bound. The result is generalized to ...

The tournament text classification methods are proposed in this article to perform the task of email categorization, in which the essence is to break down the multi-class categorization process into a set of binary classification tasks. We implement the methods of elimination and Round Robin tournament to classify emails within 15 folders. Substantial experiments are conducted to compare the ef...

The Bermond-Thomassen conjecture states that, for any positive integer r, a digraph of minimum out-degree at least 2r − 1 contains at least r vertex-disjoint directed cycles. Thomassen proved that it is true when r = 2, and very recently the conjecture was proved for the case where r = 3. It is still open for larger values of r, even when restricted to (regular) tournaments. In this paper, we p...

A Hamilton cycle in a directed graph G is a cycle that passes through every vertex of G. A Hamiltonian decomposition of G is a partition of its edge set into disjoint Hamilton cycles. In the late 60s Kelly conjectured that every regular tournament has a Hamilton decomposition. This conjecture was recently settled by Kühn and Osthus [15], who proved more generally that every r-regular n-vertex o...

The Bermond-Thomassen conjecture states that, for any positive integer r, a digraph of minimum out-degree at least 2r − 1 contains at least r vertex-disjoint directed cycles. Thomassen proved that it is true when r = 2, and very recently the conjecture was proved for the case where r = 3. It is still open for larger values of r, even when restricted to (regular) tournaments. In this paper, we p...

We give a polynomial-time oracle algorithm for Tournament Canonization that accesses oracles for Tournament Isomorphism and Rigid-Tournament Canonization. Extending the Babai-Luks Tournament Canonization algorithm, we give an n n) algorithm for canonization and isomorphism testing of k-hypertournaments, where n is the number of vertices and k is the size of hyperedges.