Related papers: Coxeter tournaments
A tournament is an orientation of a graph. Vertices are players and edges are games, directed away from the winner. Kannan, Tetali and Vempala and McShine showed that tournaments with given score sequence can be rapidly sampled, via simple…
Brualdi and Li introduced tournament interchange graphs. In such a graph, each vertex represents a tournament. Traversing an edge corresponds to reversing a cyclically directed triangle. Such a triangle is neutral, in that its reversal does…
We consider the problem of estimating the probability matrix governing a tournament or linkage in graphs from incomplete observations, under the assumption that the probability matrix satisfies natural monotonicity constraints after being…
We give a new theorem describing a relation between the quasi-random property of regular tournaments and their spectra. This provides many solutions to a constructing problem mentioned by Erd\H{o}s and Moon (1965) and Spencer (1985).
Tournaments are competitions between a number of teams, the outcome of which determines the relative strength or rank of each team. In many cases, the strength of a team in the tournament is given by a score. Perhaps, the most striking…
In this paper we prove that the cohomology of smooth projective tropical varieties verify the tropical analogs of three fundamental theorems which govern the cohomology of complex projective varieties: Hard Lefschetz theorem, Hodge-Riemann…
Given a pure, full-dimensional, locally strongly connected polyhedral complex C with convex support, we characterize, by a local codimension-2 condition, polyhedral complexes that coarsen C. The proof of the characterization draws upon a…
The numbers game is a one-player game played on a finite simple graph with certain ``amplitudes'' assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…
A tournament is an orientation of a graph. Each edge represents a match, directed towards the winner. The score sequence lists the number of wins by each team. Landau (1953) characterized score sequences of the complete graph. Moon (1963)…
We study the cohomology ring of the Bott--Samelson variety. We compute an explicit presentation of this ring via Soergel's result, which implies that it is a purely combinatorial invariant. We use the presentation to introduce the…
On being told that a piece of work he thought was his discovery had duplicated an earlier mathematician's work, Larry Shepp once replied "Yes, but when {\em I} discovered it, it {\em stayed} discovered". In this spirit we give discussion…
Braid groups may be defined for every Coxeter diagram. Artin's braid group is of type A. Analogs of Temperley-Lieb, Hecke and Birman-Wenzl algebras exist for B-type. Our general hypothethis is that the braid group of B-type replaces Artin's…
It was conjectured by Gorsky, Hogancamp, Mellit, and Nakagane that the left and right adjoints of the parabolic induction functor between homotopy categories of Soergel bimodules associated to a finite Coxeter group are related by the…
We prove the Hard Lefschetz theorem and Hodge-Riemann relations for certain rings which resemble the cohomology rings of projectivizations of globally generated vector bundles over toric varieties. This proves new cases of the standard…
In this paper we present a new proof of a proposition presented in the article: Complexes of tournaments, directionality filtrations and persistent homology. This paper is part of Joaqu\'in Casta\~neda's undergraduate thesis.
We study in detail the Jordan forms of the Coxeter transformations and prove shearing formulas due to Subbotin and Sumin for the characteristic polynomials of the Coxeter transformations. Using shearing formulas we calculate characteristic…
Given a system of coverings of k-graphs, we show that the cohomology of the resulting (k+1)-graph is isomorphic to that of any one of the k-graphs in the system. We then consider Bratteli diagrams of 2-graphs whose twisted C*-algebras are…
Given a graph G, we construct a simple, convex polytope whose face poset is based on the connected subgraphs of G. This provides a natural generalization of the Stasheff associahedron and the Bott-Taubes cyclohedron. Moreover, we show that…
Nearly-doubly-regular tournaments have played significant roles in extremal graph theory. In this note, we construct new cyclotomic nearly-doubly-regular tournaments and determine their spectrum by establishing a new connection between…
We introduce the notion of weighted Coxeter graph and associate to it a certain generalization of the standard geometric representation of a Coxeter group. We prove sufficient conditions for faithfulness and non-faithfulness of such a…