Related papers: Weyl Groups and the Modified Kostant Game
We formulate and prove examples of a conjecture which describes the W-algebras in type A as successive quantum Hamiltonian reductions of affine vertex algebras associated with several hook-type nilpotent orbits. This implies that the affine…
The equivariant $\mathcal{W}$-algebra of a simple Lie algebra $\mathfrak{g}$ is a BRST reduction of the algebra of chiral differential operators on the Lie group of $\mathfrak{g}$. We construct a family of vertex algebras $A[\mathfrak{g},…
The main ambition of this thesis is to contribute to the development of cooperative game theory towards combinatorics, algorithmics and discrete geometry. Therefore, the first chapter of this manuscript is devoted to highlighting the…
Suppose that W is a finite, unitary, reflection group acting on the complex vector space V and X is a subspace of V. Define N to be the setwise stabilizer of X in W, Z to be the pointwise stabilizer, and C=N/Z. Then restriction defines a…
We obtain new bounds on short Weil sums over small multiplicative subgroups of prime finite fields which remain nontrivial in the range the classical Weil bound is already trivial. The method we use is a blend of techniques coming from…
In this paper we consider a network of boolean agents that compete for a limited resource. The agents play the so called Generalized Minority Game where the capacity level is allowed to vary externally. We study the properties of such a…
Game theory is playing more and more important roles in understanding complex systems and in investigating intelligent machines with various uncertainties. As a starting point, we consider the classical two-player zero-sum linear-quadratic…
The Weyl group of the Cuntz algebra O_n, with n finite, is investigated. This is (isomorphic to) the group of polynomial automorphisms of O_n, namely those induced by unitaries that can be written as finite sums of words in the canonical…
Pebble games are a powerful tool in the study of finite model theory, constraint satisfaction and database theory. Monads and comonads are basic notions of category theory which are widely used in semantics of computation and in modern…
The weak Jacobi forms of integral weight and integral index associated to an even positive definite lattice form a bigraded algebra. In this paper we prove a criterion for this type of algebra being free. As an application, we give an…
A natural partial ordering exists on the set of all weighted games and, more broadly, on all linear games. We describe several properties of the partially ordered sets formed by these games and utilize this perspective to enumerate proper…
Let $\frak g$ be a finite dimensional complex semi-simple Lie algebra with Weyl group $W$ and simple reflections $S$. For $I\subseteq S$ let $\frak g_I$ be the corresponding semi-simple subalgebra of $\frak g$. Denote by $W_I$ the Weyl…
We study the subclass of singleton congestion games with identical and increasing cost functions, i.e., each agent tries to utilize from the least crowded resource in her accessible subset of resources. Our main contribution is a novel…
We show that an element $w$ of a finite Weyl group $W$ is rationally smooth if and only if the hyperplane arrangement $I$ associated to the inversion set of $w$ is inductively free, and the product $(d_1+1) \cdots (d_l+1)$ of the…
We investigate the algebra generated by the operators $x$ and $\mathrm{I} = \int_0^x$, which satisfy the commutation relation \[ [\mathrm{I},x] = \mathrm{I}x - x\mathrm{I} = - \mathrm{I}^2. \] We develop a combinatorial framework for the…
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…
The combinatorics of reduced words and commutation classes plays an important role in geometric representation theory. A string polytope is a lattice polytope associated to each reduced word of the longest element $w_0$ in the symmetric…
This paper presents State Algebra, a novel framework designed to represent and manipulate propositional logic using algebraic methods. The framework is structured as a hierarchy of three representations: Set, Coordinate, and Row…
We study zero-sum games, a variant of the classical combinatorial Subtraction games (studied for example in the monumental work "Winning Ways", by Berlekamp, Conway and Guy), called Cumulative Subtraction (CS). Two players alternate in…
We introduce string diagrams as a formal mathematical, graphical language to represent, compose, program and reason about games. The language is well established in quantum physics, quantum computing and quantum linguistic with the…