Related papers: Crystal isomorphisms and Mullineux involution II
We define a set of operations called crystal operations on matrices with entries either in {0,1} or in N. There are horizontal and vertical crystal operations, giving rise to two commuting structures of a crystal graph on these matrices.…
We consider heuristic algorithm for solving graph isomorphism problem. The algorithm based on a successive splitting of the eigenvalues of the matrices which are modifications (to positive defined) of graphs' adjacency matrices.…
We apply our previous work on cluster characters for Hom-infinite cluster categories to the theory of cluster algebras. We give a new proof of Conjectures 5.4, 6.13, 7.2, 7.10 and 7.12 of Fomin and Zelevinsky's Cluster algebras IV for…
What might a combinatorial interpretation of the Kronecker coefficients even look like? We introduce a class of combinatorial objects called bitableaux, which we believe are a natural candidate, and we formulate a purely combinatorial…
The Isomorphism Conjecture is a conceptional approach towards a calculation of the algebraic K-theory of a group ring RG, where G is an infinite group. In this paper we prove the conjecture in dimensions n<2 for fundamental groups of closed…
We define three combinatorial models for \hat{sl(n)} crystals, parametrized by partitions, configurations of beads on an `abacus', and cylindric plane partitions, respectively. These are reducible, but we can identify an irreducible…
In this paper, we introduce novel fast matrix inversion algorithms that leverage triangular decomposition and recurrent formalism, incorporating Strassen's fast matrix multiplication. Our research places particular emphasis on triangular…
We provide a procedure for generating the irreducible representations of crystallography groups in any dimension. We also furnish a strategy to investigate the topology of the unitary dual of a crystallography group using sequences of…
Let $\mathcal{C}$ be a Hom-finite triangulated 2-Calabi-Yau category with a cluster tilting object. Under some constructibility assumptions on $\mathcal{C}$ which are satisfied for instance by cluster categories, by generalized cluster…
In this paper I present a conjecture for a recursive algorithm that finds each permutation of combining two sets of objects (AKA the Shuffle Product). This algorithm provides an efficient way to navigate this problem, as each atomic…
We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…
A combinatorial construction is used to analyze the properties of polyhedral products and generalized moment-angle complexes with respect to certain operations on CW pairs including exponentiation. This allows for the construction of…
We study the homogeneous involutions on the full square matrices over an algebraically closed field endowed with a division grading with commutative support. We obtain the classification of the isomorphism and equivalence classes for the…
We present an algorithm to compute the Brauer group of involution surface bundles over rational surfaces.
Cluster algebras are a class of commutative algebras whose generators are defined by a recursive process called mutation. We give a brief introduction to cluster algebras, and explain how discrete integrable systems can appear in the…
We revisit Haiman's conjecture on the relations between characters of Kazdhan-Lusztig basis elements of the Hecke algebra over the symmetric group. The conjecture asserts that, for purposes of character evaluation, any Kazhdan-Lusztig basis…
We consider quivers/skew-symmetric matrices under the action of mutation (in the cluster algebra sense). We classify those which are isomorphic to their own mutation via a cycle permuting all the vertices, and give families of quivers which…
A combinatorial construction of a Gelafand model for the symmetric group and its Iwahori-Hecke algebra is presented.
We present a versatile formulation of the convolution operation that we term a "mapped convolution." The standard convolution operation implicitly samples the pixel grid and computes a weighted sum. Our mapped convolution decouples these…
We describe an algorithm, which - given the characters of tilting modules and assuming that Donkin's tilting conjecture is true - computes the characters of simple modules for an algebraic group in any characteristic.