Related papers: Cofinality of Regular Tournaments
We introduce and study the concept of cyclicity degree of a finite group $G$. This quantity measures the probability of a random subgroup of $G$ to be cyclic. Explicit formulas are obtained for some particular classes of finite groups. An…
We give a complete characterization of tournaments H that have the Sidorenko property with respect to nearly regular tournaments, i.e., the homomorphism density of H among all nearly regular tournaments is minimized by a random tournament.…
Tournaments are graphs obtained by assigning a direction for every edge in an undirected complete graph. We give a formula for the number of isomorphism classes of vertex-transitive tournaments with prime order. For that, we introduce…
Every sport needs rules. Tournament design refers to the rules that determine how a tournament, a series of games between a number of competitors, is organized. This study aims to provide an overview of the tournament design literature from…
We summarize several results about non-simplicity, solvability and normal structure of finite groups related to the number of conjugacy classes appearing in the product or the power of conjugacy classes. We also collect some problems that…
Crucial to an Evolutionary Algorithm's performance is its selection scheme. We mathematically investigate the relation between polynomial rank and probabilistic tournament methods which are (respectively) generalisations of the popular…
Coclass theory can be used to define infinite families of finite p-groups of a fixed coclass. It is conjectured that the groups in one of these infinite families all have isomorphic mod-p cohomology rings. Here we prove that almost all…
We present a version of arithmetic in all finite types which allows for a definition of equality at higher types for which all congruence are derivable, for which the soundness of the Dialectica interpretation is provable inside the system…
We provide a self-contained introduction to finite extensive games with perfect information. In these games players proceed in turns having, at each stage, finitely many moves to their disposal, each play always ends, and in each play the…
We construct an algorithm that, given a pair of homomorphisms between polycyclic-by-finite groups, determines whether their Reidemeister number is finite, and if so returns a set of representatives of the twisted conjugacy classes.…
We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…
We prove that every finite distributive lattice is isomorphic to a final segment of the d.c.e. Turing degrees (i.e., the degrees of differences of computably enumerable sets). As a corollary, we are able to infer the undecidability of the…
We formulate and analyze several finiteness conjectures for linear algebraic groups over higher-dimensional fields. In fact, we prove all of these conjectures for algebraic tori as well as in some other situations. This work relies in an…
The principle result of this article is the determination of the possible finite subgroups of arithmetic lattices in U(2,1).
This paper gives a systematic construction of certain covers of finite semigroups. These covers will be used in future work on the complexity of finite semigroups.
We examine questions involving nondeterministic finite automata where all states are final, initial, or both initial and final. First, we prove hardness results for the nonuniversality and inequivalence problems for these NFAs. Next, we…
We consider the finite generation property for cohomology algebra of pointed finite tensor categories via de-equivariantization and exact sequence of finite tensor categories. As a result, we prove that all coradically graded pointed finite…
In this note, we extend a recent result on the uniqueness of the maximum score in a classical round-robin tournament to general round-robin tournament models with equally strong players, where the scores take values in $[0,\,1]$.
We prove that for any prime $p$ the finite $p$-groups of fixed coclass have only finitely many different mod-$p$ cohomology rings between them. This was conjectured by Carlson; we prove it by first proving a stronger version for groups of…
It is well-known that every tournament contains a Hamilton path, and every strongly connected tournament contains a Hamilton cycle. This paper establishes transversal generalizations of these classical results. For a collection…