Related papers: A Combinatorial Problem from Group Theory
Horn's conjecture, which given the spectra of two Hermitian matrices describes the possible spectra of the sum, was recently settled in the affirmative. In this survey we discuss one of the many steps in this, which required us to introduce…
We extend the study of \emph{melonic} quartic tensor models to models with arbitrary quartic interactions. This extension requires a new version of the loop vertex expansion using several species of intermediate fields and iterated…
We extend the formalism of Conjectural Variations games to Stackelberg games involving multiple leaders and a single follower. To solve these nonconvex games, a common assumption is that the leaders compute their strategies having perfect…
We describe an explicit chain map from the standard resolution to the minimal resolution for the finite cyclic group Z_k of order k. We then demonstrate how such a chain map induces a "Z_k-combinatorial Stokes theorem", which in turn…
We investigate properties of families $F$ of subsets of a finite set in a situation where subsets are incomparable by the binary inclusion relation and a) for any $A\notin F$, there is such set $A'\in F$ that either $A\subset A'$ or…
C. Bonnaf{\'e}, M. Geck, L. Iancu, and T. Lam have conjectured a description of one-sided cells in unequal parameter Hecke algebras of type $B$ which is based on domino tableaux of arbitrary rank. In the integer case, this generalizes the…
Although mixed extensions of finite games always admit equilibria, this is not the case for countable games, the best-known example being Wald's pick-the-larger-integer game. Several authors have provided conditions for the existence of…
The main goal of this paper is to settle a conceptual framework for cooperative game theory in which the notion of composition/aggregation of games is the defining structure. This is done via the mathematical theory of algebraic operads: we…
This work shows that the formation of a finite number of coalitions in a nonatomic network congestion game benefits everyone. At the equilibrium of the composite game played by coalitions and individuals, the average cost to each coalition…
We give a new criterion for solvability of group equations, providing proofs of various generalizations of the Kervaire-Laudenbach conjecture for Connes-embeddable groups.
The Jacobian Conjecture has been reduced to the symmetric homogeneous case. In this paper we give an inversion formula for the symmetric case and relate it to a combinatoric structure called the Grossman-Larson Algebra. We use these tools…
An unresolved conjecture by Graham Higman states that for all $n\geq 1$ the number of conjugacy classes of the group of $n \times n$ unitriangular matrices with entries in the finite field $\mathbb{F}_q$ is a polynomial in $q$. In this…
Cooperative interval games are a generalized model of cooperative games in which the worth of every coalition corresponds to a closed interval representing the possible outcomes of its cooperation. Selections are all possible outcomes of…
We introduce the convex combinatorial optimization problem, a far reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and…
Combinatorial Game Theory has also been called `additive game theory', whenever the analysis involves sums of independent game components. Such {\em disjunctive sums} invoke comparison between games, which allows abstract values to be…
If a measure of voting power assigns players greater voting power because they no longer effectively cooperate, then it displays the quarrelling paradox and violates the quarrel postulate. However, we prove that certain types of quarrel…
The Frankl conjecture (called also union-closed sets conjecture) is one of the famous unsolved conjectures in combinatorics of finite sets. In this short note, we introduce and to some extent justify some variants of the Frankl conjecture.
A cluster algebra is an algebraic structure generated by operations of a quiver (a directed graph) called the mutations and their associated simple birational mappings. By using a graph-combinatorial approach, we present a systematic way to…
We show that the well-known Konig's Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, can be proven in the first order theory $\LA$ with induction restricted to $\Sigma_1^B$ formulas. This is an improvement over…
In earlier work with C.~Monical, we introduced the notion of a K-crystal, with applications to K-theoretic Schubert calculus and the study of Lascoux polynomials. We conjectured that such a K-crystal structure existed on the set of…