Related papers: Combinatorics of $F$-polynomials
We investigate the representation theory of the rational and trigonometric Cherednik algebra of type $GL_n$ by means of combinatorics on periodic (or cylindrical) skew diagrams. We introduce and study standard tableaux and plane partitions…
This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…
Many (if not most) of convex polytopes, important for combinatorial and algebraic geometry, are closely related to secondary polytopes of point configurations, or base polytopes of submodular functions, or their numerous variations and…
We prove that every supersymmetric Schur polynomial has a saturated Newton polytope (SNP). Our approach begins with a tableau-theoretic description of the support, which we encode as a polyhedron with a totally unimodular constraint matrix.…
The rings of symmetric polynomials form an inverse system whose limit, the ring of symmetric functions, is the model for the bosonic Fock space representation of the affine Lie algebra. We categorify this construction by considering an…
We show how Seifert surfaces, so useful for the understanding of the Alexander polynomial \Delta_L(t), can be generalized in order to study the multivariable Alexander polynomial \Delta_L(t_1,...,t_\mu). In particular, we give an elementary…
To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way…
We investigate the representation and complete representation classes for algebras of partial functions with the signature of relative complement and domain restriction. We provide and prove the correctness of a finite equational…
This paper develops the fundamentals of modular representation theory for finite monoids, introducing the decomposition matrix and exploring its connection to Brauer characters. We define modular characteristic and explain how the…
We study a wide range of homologically-defined representations of surface braid groups and of mapping class groups of surfaces, including the Lawrence-Bigelow representations of the classical braid groups. These representations naturally…
In this paper, we study multiplication formula of $F$-polynomial of representations of Hernandez and Leclerc's quivers with potentials. Since the truncated $q$-characters of some real simple modules over a quantum affine group…
Combinatorial interpretation of the fibonomial coefficients as a number of choices of specific finite subsets of an infinite partially ordered set of not binomial type is proposed. This partially ordered set is here defined via…
Orbit portraits were introduced by Milnor as a combinatorial tool to describe the patterns of all periodic dynamical rays landing on a periodic cycle of a quadratic polynomial. This encodes information about the dynamics and the parameter…
It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…
In the theory of the moduli-stacks of n-pointed stable curves, there are two fundamental functors, contraction and stabilization. These functors are constructed in [4], where they are used to show that the various \bar{M_{g,n}}'s are…
We give some closed formulas for certain vectors of the canonical bases of the Fock space representation of U_v(sl^_n). As a result, a combinatorial description of certain parabolic Kazhdan-Lusztig polynomials for affine type A is obtained.
Let $\A$ be an algebra and let $f(x_1,...,x_d)$ be a multilinear polynomial in noncommuting indeterminates $x_i$. We consider the problem of describing linear maps $\phi:\A\to \A$ that preserve zeros of $f$. Under certain technical…
Lattice polytope representation of natural numbers is introduced based on the fundamental theorem of arithmetic. The combinatorial and geometric properties of the polytopes are studied using Polymake and Qhull software. The volume of the…
Coverings in the representation theory of algebras were introduced for the Auslander-Reiten quiver of a representation finite algebra by Riedtmann and later for finite dimensional algebras by Bongartz and Gabriel, R. Martinez-Villa and de…
We explicate the combinatorial/geometric ingredients of Arthur's proof of the convergence and polynomiality, in a truncation parameter, of his non-invariant trace formula. Starting with a fan in a real, finite dimensional, vector space and…