Related papers: Cofinality of Regular Tournaments
We form a "map of tournaments" by adapting the map framework from the world of elections. By a tournament we mean a complete directed graph where the nodes are the players and an edge points from a winner of a game to the loser (with no…
Every semigroup which is a finite disjoint union of copies of the free monogenic semigroup (natural numbers under addition) is finitely presented and residually finite.
We determine the structure of the finite groups with the property that every cyclic subgroup is the intersection of maximal subgroups, comparing this property with the one where all proper subgroups are intersections of maximal subgroups.
We determine the inducibility of all tournaments with at most $4$ vertices together with the extremal constructions. The $4$-vertex tournament containing an oriented $C_3$ and one source vertex has a particularly interesting extremal…
In this paper, we define finitely additive, probability and modular functions over semiring-like structures. We investigate finitely additive functions with the help of complemented elements of a semiring. We also generalize some classical…
The purpose of this article is to formulate and prove a global high-order regularity result within the high-contrast framework of elliptic homogenization. In order to achieve this, we also present a version of the high-contrast Caccioppoli…
This paper surveys basic properties of finite presentation in groups, Lie algebras and rings. It includes some new results and also new, more elementary proofs, of some results that are already in the literature. In particular, we discuss…
A single-elimination (SE) tournament is a popular way to select a winner in both sports competitions and in elections. A natural and well-studied question is the tournament fixing problem (TFP): given the set of all pairwise match outcomes,…
For a compact smooth manifold $M$ (with boundary) we prove that the topological rank of the diffeomorphism group Diff$_0^k(M)$ is finite for all $k\geq 1$. This extends a result from [2] where the same claim is proved in the special case of…
In 1953, Kuhn showed that every sequential game has a Nash equilibrium by showing that a procedure, named ``backward induction'' in game theory, yields a Nash equilibrium. It actually yields Nash equilibria that define a proper subclass of…
A generalized tournament matrix $M$ is a nonnegative matrix that satisfies $M+M^{t}=J-I$, where $J$ is the all ones matrix and $I$ is the identity matrix. In this paper, a characterization of generalized tournament matrices with the same…
We show that every (not necessarily saturated) fusion system can be realized as a full subcategory of the fusion system of a finite group. This result extends our previous work \cite{Park2010} and complements the related result…
We determine the finite groups whose real irreducible representations have different degrees.
We introduce the notion of universal graphs as a tool for constructing algorithms solving games of infinite duration such as parity games and mean payoff games. In the first part we develop the theory of universal graphs, with two goals:…
In this paper we compute extension groups in the category of strict polynomial superfunctors and thereby exhibit certain "universal extension classes" for the general linear supergroup. Some of these classes restrict to the universal…
We prove that in every finitely generated profinite group, every subgroup of finite index is open; this implies that the topology on such groups is determined by the algebraic structure. This is deduced from the main result about finite…
In this paper we will discuss scoring play games. We will give the basic definitions for scoring play games, and show that they form a well defined set, with clear and distinct outcome classes under these definitions. We will also show that…
It has been conjectured that finite tensor categories have finitely generated cohomology. We show that this is equivalent to finitely generated Hochschild cohomology for the endomorphism algebras of the projective generators.
Let $k(G)$ be the number of conjugacy classes of finite groups $G$ and $\pi_e(G)$ be the set of the orders of elements in $G$. Then there exists a non-negative integer $k$ such that $k(G)=|\pi_e(G)|+k$. We call such groups to be $co(k)$…
In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives. To this end, we introduce the notion of requirement, and the…