Related papers: Coxeter tournaments
In an earlier paper the first two authors have shown that self-complementary graphs can always be oriented in such a way that the union of the oriented version and its isomorphically oriented complement gives a transitive tournament. We…
The main aim of the present paper is to disprove the Cohen--Lenstra--Martinet heuristics in two different ways and to offer possible corrections. We also recast the heuristics in terms of Arakelov class groups, giving an explanation for the…
Generalized permutahedra are a class of polytopes with many interesting combinatorial subclasses. We introduce pruned inside-out polytopes, a generalization of inside-out polytopes introduced by Beck--Zaslavsky (2006), which have many…
A graphical model encodes conditional independence relations via the Markov properties. For an undirected graph these conditional independence relations can be represented by a simple polytope known as the graph associahedron, which can be…
We introduce a notion of continuous crystal analogous, for general Coxeter groups, to the combinatorial crystals introduced by Kashiwara in representation theory of Lie algebras. We use a generalization of the Littelmann path model to show…
In this paper, we give new proofs of the celebrated Andr\'eka-Resek-Thompson representability results of certain axiomatized cylindric-like algebras. Such representability results provide completeness theorems for variants of first order…
Ranking the participants of a tournament has applications in voting, paired comparisons analysis, sports and other domains. In this paper we introduce bipartite tournaments, which model situations in which two different kinds of entity…
We give a geometric proof of the Decomposition Theorem of Beilinson, Bernstein, Deligne and Gabber for the direct image of the intersection cohomology complex under a proper map of complex algebraic varieties. The method rests on new…
We study the population genetics of Evolution in the important special case of weak selection, in which all fitness values are assumed to be close to one another. We show that in this regime natural selection is tantamount to the…
The Bermond-Thomassen conjecture states that, for any positive integer $r$, a digraph of minimum out-degree at least $2r-1$ contains at least $r$ vertex-disjoint directed cycles. Bessy, Sereni and Lichiardopol proved that a regular…
Sullivan stated the conjectures: (1) every oriented graph $D$ has a vertex $x$ such that $d^{++}(x)\geq d^{-}(x)$; (2) every oriented graph $D$ has a vertex $x$ such that $d^{++}(x)+d^{+}(x)\geq 2d^{-}(x)$. In this paper, we prove that…
We consider the manipulability of tournament rules which map the results of $\binom{n}{2}$ pairwise matches and select a winner. Prior work designs simple tournament rules such that no pair of teams can manipulate the outcome of their match…
Higher order cohomology of arithmetic groups is expressed in terms of (g,K)-cohomology. Generalizing results of Borel, it is shown that the latter can be computed using functions of (uniform) moderate growth. A higher order versions of…
We prove a Kahane-Khinchin type result with a few random vectors, which are distributed independently with respect to an arbitrary log-concave probability measure on $\R^n$. This is an application of small ball estimate and Chernoff's…
A comply/constrain game or a game with a Muller twist is a game where the next player is allowed to place constraints on opponent's next move. We develop a closed form formula for the Grundy value of the single-pile subtraction game where…
Competitive tournaments appear in sports, politics, population ecology, and animal behavior. All of these fields have developed methods for rating competitors and ranking them accordingly. A tournament is intransitive if it is not…
This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…
Ranking a vector of alternatives on the basis of a series of paired comparisons is a relevant topic in many instances. A popular example is ranking contestants in sport tournaments. To this purpose, paired comparison models such as the…
The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…
We introduce the notion of joint torsion for several commuting operators satisfying a Fredholm condition. This new secondary invariant takes values in the group of invertibles of a field. It is constructed by comparing determinants…