Related papers: On k-hypertournament losing scores
We give a new theorem describing a relation between the quasi-random property of regular tournaments and their spectra. This provides many solutions to a constructing problem mentioned by Erd\H{o}s and Moon (1965) and Spencer (1985).
We improve several recent results by Hong, Lee, Lee and Park (2012) on gaps and Bzd\c{e}ga (2014) on jumps amongst the coefficients of cyclotomic polynomials. Besides direct improvements, we also introduce several new techniques that have…
A well-known theorem of Chung and Graham states that if $h\geq 4$ then a tournament $T$ is quasirandom if and only if $T$ contains each $h$-vertex tournament the "correct number" of times as a subtournament. In this paper we investigate the…
We give two generalizations of the Zhou fixed point theorem. They weaken the subcompleteness condition of values, and relax the ascending condition of the correspondence. As an application, we derive a generalization of Topkis's theorem on…
The famous theorem of R.Aumann and M.Maschler states that the sequence of values of an N-stage zero-sum game G_N with incomplete information on one side converges as N tends to infinity, and the error term is bounded by a constant divided…
In this note, we extend a recent result on the uniqueness of the maximum score in a classical round-robin tournament to general round-robin tournament models with equally strong players, where the scores take values in $[0,\,1]$.
This paper is a follow-up to our joint paper with I. Agol, P. Storm and K. Whyte "Finiteness of arithmetic hyperbolic reflection groups". The main purpose is to investigate the effective side of the method developed there and its possible…
Given non-negative integers m, n, h and k with $ m\geq h>1 $ and $ n\geq k>1, $an [h-k]-bipartite hypertournament on $ m+n$ vertices is a triple $(U,V,A) $, where U and V are two sets of vertices with $| U| =m$ and $ | V| =n,$ and $A$ is a…
We give a sketch for an alternative proof of a recent result by J. Tseng.
As a corollary to the recent extraordinary theorem of Maynard and Tao, we re-prove, in a stronger form, a result of Shiu concerning "strings" of consecutive, congruent primes.
We survey most of the known results concerning the Eisenbud-Green-Harris Conjecture. Our presentation includes new proofs of several theorems, as well as a unified treatment of many results which are otherwise scattered in the literature.…
In this paper, we first establish a K-theory version of the equivariant family index theorem for a circle action, then use it to prove several rigidity and vanishing theorems on the equivariant K-theory level.
We overview a web of conjectures about torsors under reductive groups over regular rings and survey some techniques that have been used for making progress on such problems.
We show that a quasirandom $k$-uniform hypergraph $G$ has a tight Euler tour subject to the necessary condition that $k$ divides all vertex degrees. The case when $G$ is complete confirms a conjecture of Chung, Diaconis and Graham from 1989…
Bermond and Thomassen conjectured in 1981 that every digraph with minimum outdegree at least $2k-1$ contains $k$ vertex-disjoint cycles,here $k$ is a positive integer. Lichiardopol conjectured in 2014 that for every positive integer $k$…
Rejoinder to ``Equi-energy sampler with applications in statistical inference and statistical mechanics'' by Kou, Zhou and Wong [math.ST/0507080]
In an investigation of the applications of Combinatorial Game Theory to chess, we construct novel mutual Zugzwang positions, explain an otherwise mysterious pawn endgame from "A Guide to Chess Endings" (Euwe and Hooper), show positions…
This is a remark on a recent post by P. Denton, S. Parke, T. Tao, X. Zhang, Eigenvectors from eigenvalues, arXiv:1908.03795v1
The paper contains a proof of the conjecture of M. Klin and D. Maru$\breve{\rm s}$i$\breve{\rm c}$ that an automorphism group of a transitive graph contains a permutation, decomposed in cycles of the same length. The proof is based on the…
Recently, Dragani\'c, Munh\'a Correia, Sudakov and Yuster showed that every tournament on $(2+o(1))k^2$ vertices contains a $1$-subdivision of a transitive tournament on $k$ vertices, which is tight up to a constant factor. We prove a…