English
Related papers

Related papers: Quasi-Carousel Tournaments

200 papers

Quasirandomness is a general mathematical concept meant to encapsulate several characteristics usually satisfied by random combinatorial objects, and which we regard as describing when a given object 'looks random'. In this survey we…

Combinatorics · Mathematics 2021-07-06 Davi Castro-Silva

Gowers has elegantly characterized the finite groups $G$ in which $A_1A_2A_3 = G$ for any positive density subsets $A_1,A_2,A_3$. This property, quasi-randomness, holds if and only if G does not admit a nontrivial irreducible representation…

Group Theory · Mathematics 2021-03-23 Mark Sellke

Sumner's universal tournament conjecture states that any tournament on $2n-2$ vertices contains a copy of any directed tree on $n$ vertices. We prove an asymptotic version of this conjecture, namely that any tournament on $(2+o(1))n$…

Combinatorics · Mathematics 2015-09-16 Daniela Kühn , Richard Mycroft , Deryk Osthus

Erd\"{o}s-Hajnal conjecture states that for every undirected graph $H$ there exists $ \epsilon(H) > 0 $ such that every undirected graph on $ n $ vertices that does not contain $H$ as an induced subgraph contains a clique or a stable set of…

Combinatorics · Mathematics 2022-08-10 Soukaina Zayat , Salman Ghazal

It is shown that if a non-invertible area preserving local homeomorphism on $\mathbb{T}^2$ is homotopic to a linear expanding or hyperbolic endomorphism, then it must be topologically transitive. This gives a complete characterization, in…

Dynamical Systems · Mathematics 2018-06-18 Martin Andersson

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…

Dynamical Systems · Mathematics 2020-08-25 Ethan Akin

A real matrix $Q$ is quasi-orthogonal if $Q^{\top}Q=qI$, for some positive real number $q$. We prove that any $n\times n$ skew-symmetric matrix $S$ is a principal sub-matrix of a skew-symmetric quasi-orthogonal matrix $Q$, called a…

Combinatorics · Mathematics 2024-10-28 Abderrahim Boussaïri , Brahim Chergui , Zaineb Sarir , Mohamed Zouagui

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…

Probability · Mathematics 2026-05-21 Yaakov Malinovsky

A question whether sufficiently regular manifold automorphisms may have wandering domains with controlled geometry is answered in the negative for quasiconformal or smooth homeomorphisms of $n$-tori, $n\ge2$, and hyperbolic surfaces.…

Dynamical Systems · Mathematics 2022-05-25 Sergei Merenkov

Chaotic dynamics can be quite heterogeneous in the sense that in some regions the dynamics are unstable in more directions than in other regions. When trajectories wander between these regions, the dynamics is complicated. We say a chaotic…

Dynamical Systems · Mathematics 2022-10-10 Yoshitaka Saiki , Hiroki Takahasi , James A. Yorke

We consider the minimum-weight feedback vertex set problem in tournaments: given a tournament with non-negative vertex weights, remove a minimum-weight set of vertices that intersects all cycles. This problem is $\mathsf{NP}$-hard to solve…

Data Structures and Algorithms · Computer Science 2015-11-05 Matthias Mnich , Virginia Vassilevska Williams , László A. Végh

We consider the dynamics of `nonlinear tent maps': piecewise smooth unimodal maps with nowhere vanishing derivative. We show that if a nonlinear tent map $f$ is not infinitely renormalizable, then all its periodic orbits of sufficiently…

Dynamical Systems · Mathematics 2016-09-06 Ale Jan Homburg

We study the topological dynamics by iterations of a piecewise continuous, non linear and locally contractive map in a real finite dimensional compact ball. We consider those maps satisfying the "separation property": different continuity…

Dynamical Systems · Mathematics 2011-06-22 Eleonora Catsigeras , Ruben Budelli

The transitivity of preferences is one of the basic assumptions used in the theory of games and decisions. It is often equated with rationality of choice and is considered useful in building rankings. Intransitive preferences are considered…

Quantum Physics · Physics 2015-06-23 Marcin Makowski , Edward W. Piotrowski , Jan Sładkowski

In this paper we define and study the billiard problem on bounded regions on surfaces of constant curvature. We show that this problem defines a 2-dimensional conservative and reversible dynamical system, defined by a Twist diffeomorphism,…

Dynamical Systems · Mathematics 2016-06-14 Luciano Coutinho dos Santos , Sonia Pinto-de-Carvalho

Bertrand et al. [1] (LMCS 2019) describe two-player zero-sum games in which one player tries to achieve a reachability objective in $n$ games (on the same finite arena) simultaneously by broadcasting actions, and where the opponent has full…

Logic in Computer Science · Computer Science 2019-09-17 Corto Mascle , Mahsa Shirmohammadi , Patrick Totzke

We study the phenomenon of intransitivity in models of dice and voting. First, we follow a recent thread of research for $n$-sided dice with pairwise ordering induced by the probability, relative to $1/2$, that a throw from one die is…

Probability · Mathematics 2020-10-27 Jan Hązła , Elchanan Mossel , Nathan Ross , Guangqu Zheng

A transient stochastic process is considered strongly transient if conditioned on returning to the starting location, the expected time it takes to return the the starting location is finite. We characterize strong transience for a…

Probability · Mathematics 2016-06-14 Jonathon Peterson

We investigate dynamical properties of chaotic trajectories in mushroom billiards. These billiards present a well-defined simple border between a single regular region and a single chaotic component. We find that the stickiness of chaotic…

Chaotic Dynamics · Physics 2007-05-23 Eduardo G. Altmann , Adilson E. Motter , Holger Kantz

The traveling tournament problem is a well-known benchmark problem of the sports scheduling. We propose an approximation algorithm for the traveling tournament problem with the constraints such that both the number of consecutive home games…

Data Structures and Algorithms · Computer Science 2021-08-20 Shinji Imahori