Related papers: Quasi-Carousel Tournaments
The paper develops a new technique to extract a characteristic subset from a random source that repeatedly samples from a set of elements. Here a characteristic subset is a set that when containing an element contains all elements that have…
The pattern of a matrix M is a (0,1)-matrix which replaces all non-zero entries of M with a 1. There are several contexts in which studying the patterns of orthogonal matrices can be useful. One necessary condition for a matrix to be…
It is well known that a tournament (complete oriented graph) on $n$ vertices has at most ${1/4}\binom{n}{3}$ directed triangles, and that the constant 1/4 is best possible. Motivated by some geometric considerations, our aim in this paper…
We study the chaos of travelling waves (TW) in unidirectional chains of bistable maps. Previous numerical results suggested that this property is selective, {\sl viz.}\ given the parameters, there is at most a single (non-trivial) velocity…
I introduce a family of closeness functions between causal Lorentzian geometries of finite volume and arbitrary underlying topology. When points are randomly scattered in a Lorentzian manifold, with uniform density according to the volume…
Quasi-homogeneous surfaces, or Gizatullin surfaces, are normal affine surfaces such that there exists an open orbit of the automorphism group with a finite complement. If the action of the automorphism group is transitive, the surface is…
A multipartite tournament is an orientation of a complete $k$-partite graph for some positive integer $k\geq 3$. We say that a multipartite tournament $D$ is tight if every partite set forms a clique in the $(1,2)$-step competition graph,…
A "tournament sequence" is an increasing sequence of positive integers (t_1,t_2,...) such that t_1=1 and t_{i+1} <= 2 t_i. A "Meeussen sequence" is an increasing sequence of positive integers (m_1,m_2,...) such that m_1=1, every nonnegative…
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…
Tank-treading, tumbling and trembling are different types of the vesicle behavior in an external flow. We derive a dynamical equation for nearly spherical vesicles enabling to establish a phase diagram of the system predicting the regimes.…
The self-organization of turbulence into regular zonal flows can be fruitfully investigated with quasilinear methods and statistical descriptions. A wave kinetic equation that assumes asymptotically large-scale zonal flows is pathological.…
We give a beautiful explicit example of a convex plane curve such that the outer billiard has a given finite number of invariant curves. Moreover, the dynamics on these curves is a standard shift. This example can be considered as an outer…
Knockout tournaments, also known as single-elimination or cup tournaments, are a popular form of sports competitions. In the standard probabilistic setting, for each pairing of players, one of the players wins the game with a certain (a…
A fundamental property of choice functions is stability, which, loosely speaking, prescribes that choice sets are invariant under adding and removing unchosen alternatives. We provide several structural insights that improve our…
In this paper, we consider upper bounds on the size of transitive subtournaments in a digraph. In particular, we give an analogy of Hoffman's bound for the size of cocliques in a regular graph. Furthermore, we partially improve the Hoffman…
We study the typical structure of oriented graphs and digraphs that do not contain a blow-up T_{r+1}^t of a transitive tournament. For any integers r >= 2, t >= 1 and any real a in (3/2,2], we prove that almost all T_{r+1}^t-free oriented…
Flow games coincide precisely with the fundamental class of non-negative totally balanced games. However, the conditions for their convexity have remained elusive. In this paper, we resolve this challenge by providing a complete…
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yuster proved the following result on quasi-randomness of…
The classical result of Landau on the existence of kings in finite tournaments (=finite directed complete graphs) is extended to continuous tournaments for which the set X of players is a compact Hausdorff space. The following partial…
Both Cuckler and Yuster independently conjectured that when $n$ is an odd positive multiple of $3$ every regular tournament on $n$ vertices contains a collection of $n/3$ vertex-disjoint copies of the cyclic triangle. Soon after, Keevash…