Related papers: On k-hypertournament losing scores
We prove that there exists a function $f:\mathbb{N} \rightarrow \mathbb{N}$ such that for any positive integer $k$, if $T$ is a strongly $4k$-connected tournament with minimum out-degree at least $f(k)$, then $T$ is $k$-linked. This makes…
We consider a general class of round-robin tournament models of equally strong players. In these models, each of the $n$ players competes against every other player exactly once. For each match between two players, the outcome is a value…
We give some results and conjectures about recurrence relations for certain sequences of binomial sums.
Subtraction games is a class of combinatorial games. It was solved since the Sprague-Grundy Theory was put forward. This paper described a new algorithm for subtraction games. The new algorithm can find win or lost positions in subtraction…
In his paper "Kings in Bipartite Hypertournaments" (Graphs $\&$ Combinatorics 35, 2019), Petrovic stated two conjectures on 4-kings in multipartite hypertournaments. We prove one of these conjectures and give counterexamples for the other.
The proof of the theorem concerning to the inverse cyclotomic Discrete Fourier Transform algorithm over finite field is provided.
Nearly-doubly-regular tournaments have played significant roles in extremal graph theory. In this note, we construct new cyclotomic nearly-doubly-regular tournaments and determine their spectrum by establishing a new connection between…
In this note we correct a technical error occurred in [M. Torrente and M.C. Beltrametti, "Almost vanishing polynomials and an application to the Hough transform", J. Algebra Appl. 13(8), (2014)]. This affects the bounds given in that paper,…
Tournaments are widely used models to represent pairwise dominance between candidates, alternatives, or teams. We study the problem of providing certified explanations for why a candidate appears among the winners under various tournament…
This paper deals with a modifed iterative projection method for approximating a solution of hierarchical fixed point problems for nearly nonexpansive mappings. Some strong convergence theorems for the proposed method are presented under…
We prove asymptotic convergence for a general class of $k$-means algorithms performed over streaming data from a distribution: the centers asymptotically converge to the set of stationary points of the $k$-means cost function. To do so, we…
We prove some vanishing theorems for the cohomology groups of local systems associated to Laurent polynomials. In particular, we extend one of the results of Gelfand-Kapranov-Zelevinsky into various directions.
Two new sufficient conditions for generalized cycles (including Hamilton and dominating cycles as special cases) in an arbitrary k-connected graph (k=1,2,...) are derived, which prove the truth of Bondy's (1980) famous conjecture for some…
If $T$ is an $n$-vertex tournament with a given number of $3$-cycles, what can be said about the number of its $4$-cycles? The most interesting range of this problem is where $T$ is assumed to have $c\cdot n^3$ cyclic triples for some $c>0$…
A conjecture of Thomassen from 1982 states that for every k there is an f(k) so that every strongly f(k)-connected tournament contains k edge-disjoint Hamilton cycles. A classical theorem of Camion, that every strongly connected tournament…
Green and Tao famously proved in a 2008 paper that there are arithmetic progressions of prime numbers of arbitrary lengths. Soon after, analogous statements were proved by Tao for the ring of Gaussian integers and by L\^e for the polynomial…
This is a comprehensive set of notes on the ArXiV paper math.CA/0609815 by Dmitry Bilyk and the author. The focus of that paper is a new inequality for sums of hyperbolic Haar functions in three variables, extending a famous result of J…
In this paper we prove the conjecture posed by Kl\'en et al. in \cite{kvz}, and give optimal inequalities for generalized trigonometric and hyperbolic functions.
Two theorems announced by Topkis about the topological description of sublattices are proved. They are applied to extend some classical results concerning the existence and the order structure of Nash equilibria of certain supermodular…
A digraph $D$ is $k$-linked if for every $2k$-tuple $ x_1,\ldots , x_k, y_1, \ldots , y_k$ of distinct vertices in $D$, there exist $k$ pairwise vertex-disjoint paths $P_1,\ldots, P_k$ such that $P_i$ starts at $x_i$ and ends at $y_i$,…