Related papers: Eplett's theorem for self-converse generalised tou…
We propose a method to identify and classify evolution equations and systems that can be multipotentialised in given target equations or target systems. We refer to this as the {\it converse problem}. Although we mainly study a method for…
Tournaments can be used to model a variety of practical scenarios including sports competitions and elections. A natural notion of strength of alternatives in a tournament is a generalized king: an alternative is said to be a $k$-king if it…
We describe computer searches that prove the graph reconstruction conjecture for graphs with up to 13 vertices and some limited classes on larger sizes. We also investigate the reconstructibility of tournaments up to 13 vertices, digraphs…
We consider a tournament $T=(V, A)$. For $X\subseteq V$, the subtournament of $T$ induced by $X$ is $T[X] = (X, A \cap (X \times X))$. An interval of $T$ is a subset $X$ of $V$ such that for $a, b\in X$ and $ x\in V\setminus X$, $(a,x)\in…
The score set of a tournament is defined as the set of its distinct out-degrees. In 1978, Reid proposed the conjecture that for any set of nonnegative integers $D$, there exists a tournament $T$ with a degree set $D$. In 1989, Yao presented…
Let $a, b$ and $n$ be nonnegative integers $(b \geq a, \ b > 0, \ n \geq 1)$, $\mathcal{G}_n(a,b)$ be a multigraph on $n$ vertices in which any pair of vertices is connected with at least $a$ and at most $b$ edges and \textbf{v =} $(v_1,…
In this paper, algorithms are developed for computing the Stirling transform and the inverse Stirling transform; specifically, we investigate a class of sequences satisfying a two-term recurrence. We derive a general identity which…
We show that every sufficiently large regular tournament can almost completely be decomposed into edge-disjoint Hamilton cycles. More precisely, for each \eta>0 every regular tournament G of sufficiently large order n contains at least…
The classic Rock-Paper-Scissors game of size 3 and its extension, Rock-Paper-Scissors-Lizard-Spock, are modeled by directed graphs called tournaments. They can be further extended to any odd size. The extended games are regular tournaments…
We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by K\"uhn…
We prove that there exists a constant $c > 0$ such that the vertices of every strongly $c \cdot kt$-connected tournament can be partitioned into $t$ parts, each of which induces a strongly $k$-connected tournament. This is clearly tight up…
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are `unique' constraints (i.e., permutations), the value of the game can be well…
There has been a recent coming together of the Converse Theorem for $\gln$ and the Langlands-Shahidi method of controlling the analytic properties of automorphic $L$-functions which has allowed us to establish a number of new cases of…
Tournament solutions provide methods for selecting the "best" alternatives from a tournament and have found applications in a wide range of areas. Previous work has shown that several well-known tournament solutions almost never rule out…
Let $a, \ b \ (b \geq a)$ and $n \ (n \geq 2)$ be nonnegative integers and let $\mathcal{T}(a,b,n)$ be the set of such generalised tournaments, in which every pair of distinct players is connected at most with $b$, and at least with $a$…
Ladder tournaments are widely used to rank individuals in real-world organizations and games. Their mathematical properties however are still poorly understood. We formalize the ranking rule generated by a ladder tournament, and we show…
I prove an envelope theorem with a converse: the envelope formula is equivalent to a first-order condition. Like Milgrom and Segal's (2002) envelope theorem, my result requires no structure on the choice set. I use the converse envelope…
We consider the manipulability of tournament rules for round-robin tournaments of $n$ competitors. Specifically, $n$ competitors are competing for a prize, and a tournament rule $r$ maps the result of all $\binom{n}{2}$ pairwise matches…
We give the converse to Dirichlet's theorem on primes in arithmetic progressions by generalizing an old result of Guinand.
Language models like OpenAI's Generative Pre-Trained Transformers (GPT-2/3) capture the long-term correlations needed to generate text in a variety of domains (such as language translators) and recently in gameplay (chess, Go, and…