相关论文: Coxeter tournaments
We prove the `integrality of Taylor coefficients of mirror maps' conjecture for Greene--Plesser mirror pairs as a natural byproduct of an arithmetic refinement of homological mirror symmetry. We also prove homological mirror symmetry for…
We extend the results we obtained in an earlier work. The cocommutative case of rooted ladder trees is generalized to a full Hopf algebra of (decorated) rooted trees. For Hopf algebra characters with target space of Rota-Baxter type, the…
This paper presents a generalization of the Kostant game, a combinatorial framework originally for generating positive roots in Lie algebras. By introducing an arbitrary multi-vertex modification, we prove that the resulting game…
We introduce a new Hermitian metric on the cohomology ring of compact K\"ahlerian manifolds with a pair $(v,w)$ satisfying certain Hodge-Riemann relations. An Hermitian metric on the exterior algebra of the cotangent bundle is also defined…
Game-theoretic probability uses the structure of gambles to define a concept like probability, but which is more flexible and robust. We show that results in game-theoretic probability can be thought of as minimax theorems for specific…
We consider the permutation analogue of Penney's game for words. Two players, in order, each choose a permutation of length $k\ge3$; then a sequence of independent random values from a continuous distribution is generated, until the…
We examine the complexity of the ``Texas Hold'em'' variant of poker from a topological perspective. We show that there exists a natural simplicial complex governing the multi-way winning probabilities between various hands, and that this…
We study a game first introduced by Martin (actually we use a slight variation of this game) which plays a role for measure analogous to the Banach-Mazur game for category. We first present proofs for the basic connections between this game…
A theory of (co)homologies related to set-theoretic $n$-simplex relations is constructed in analogy with the known quandle and Yang--Baxter (co)homologies, with emphasis made on the tetrahedron case. In particular, this permits us to…
Understanding the likelihood for an election to be tied is a classical topic in many disciplines including social choice, game theory, political science, and public choice. Despite a large body of literature and the common belief that ties…
The dual Kontsevich cycles in the double dual of associative graph homology correspond to polynomials in the Miller-Morita-Mumford classes in the integral cohomology of mapping class groups. I explain how the coefficients of these…
Inspired by the work of Cordero-Erausquin, McCann and Schmuckenschl\"ager [{\it Invent. Math.,} 2001], we derive an explicit expression for the Jacobian determinant of the normal exponential map on a submanifold, establishing a relationship…
Properties of relative traces and symmetrizing forms on chains of cyclotomic and affine Hecke algebras are studied. The study relies on a use of bases of these algebras which generalize a normal form for elements of the complex reflection…
The Bradley-Terry model assigns probabilities for the outcome of paired comparison experiments based on strength parameters associated with the objects being compared. We consider different proposed choices of prior parameter distributions…
A very nice result of B\'ar\'any and Lehel asserts that every finite subset $X$ or $\mathbb R^d$ can be covered by $f(d)$ $X$-boxes (i.e. each box has two antipodal points in $X$). As shown by Gy\'arf\'as and P\'alv\H{o}lgyi this result…
We prove the hard Lefschetz theorem and the Hodge-Riemann relations for a commutative ring associated to an arbitrary matroid M. We use the Hodge-Riemann relations to resolve a conjecture of Heron, Rota, and Welsh that postulates the…
We introduce a game on graphs. By a theorem of Zermelo, each instance of the game on a finite graph is determined. While the general decision problem on which player has a winning strategy in a given instance of the game is unsolved, we…
As a directed analog of Sidorenko's conjecture in extremal graph theory, Fox, Himwich, Zhou, and the second author defined an oriented graph $H$ to be tournament Sidorenko (anti-Sidorenko) if the random tournament asymptotically minimizes…
We study the Hopf monoid of convex geometries, which contains partial orders as a Hopf submonoid, and investigate the combinatorial invariants arising from canonical characters. Each invariant consists of a pair: a polynomial and a more…
In this paper we review the asymptotic matching conjectures for $r$-regular bipartite graphs, and their connections in estimating the monomer-dimer entropies in $d$-dimensional integer lattice and Bethe lattices. We prove new rigorous upper…