Related papers: Crystal isomorphisms and Mullineux involution II
We study the existence of unitriangular basic sets for the symmetric group which behave nicely with respect to the Mullineux involution. Such sets give a natural labelling for the modular irreducible representations. We show that, for any…
Group convolutions and cross-correlations, which are equivariant to the actions of group elements, are commonly used in mathematics to analyze or take advantage of symmetries inherent in a given problem setting. Here, we provide efficient…
The geometric crystal operators and geometric $R$-matrices (or geometric Weyl group actions) give commuting actions on the field of rational functions in $mn$ variables. We study the invariants of various combinations of these actions,…
Matrix mutation appears in the definition of cluster algebras of Fomin and Zelevinsky. We give a representation theoretic interpretation of matrix mutation, using tilting theory in cluster categories of hereditary algebras. Using this, we…
Combinatorics is a powerful tool for dealing with relations among objectives mushroomed in the past century. However, an more important work for mathematician is to apply combinatorics to other mathematics and other sciences not merely to…
The variety of complete quadrics is the wonderful compactification of $GL_n/O_n$ and admits a cell decomposition into Borel orbits indexed by combinatorial objects called $\mu$-involutions. We study Coxeter-theoretic properties of…
We provide an algorithm for detecting the involutions leaving a surface defined by a polynomial parametrization invariant. As a consequence, the symmetry axes, symmetry planes and symmetry center of the surface, if any, can be determined…
Given a unitary representation of a finite group on a finite-dimensional Hilbert space, we show how to find a state whose translates under the group are distinguishable with the highest probability. We apply this to several quantum oracle…
Let F be the field of two elements and G a finite abelian 2-group with an involutory automorphism. The extension of this automorphism to the group algebra FG is called an involutory involution. This determines the groups of unitary and…
We give a realization of crystal graphs for basic representations of the quantum affine algebra $U_q(C_2^{(1)})$ in terms of new combinatorial objects called the Young walls.
Prediction of stable crystal structures at given pressure-temperature conditions, based only on the knowledge of the chemical composition, is a central problem of condensed matter physics. This extremely challenging problem is often termed…
Clusters of genes that have evolved by repeated segmental duplication present difficult challenges throughout genomic analysis, from sequence assembly to functional analysis. Improved understanding of these clusters is of utmost importance,…
We show that the Poincar\'e lemma we proved elsewhere in the context of crystalline cohomology of higher level behaves well with regard to the Hodge filtration. This allows us to prove the Poincar\'e lemma for transversal crystals of level…
The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic…
In this note, we present an algorithm that yields many new methods for constructing doubly stochastic and symmetric doubly stochastic matrices for the inverse eigenvalue problem. In addition, we introduce new open problems in this area that…
We propose a new framework for categorifying skew-symmetrizable cluster algebras. Starting from an exact stably 2-Calabi-Yau category C endowed with the action of a finite group G, we construct a G-equivariant mutation on the set of maximal…
For coherent families of crystals of affine Lie algebras of type B^{(1)}_n, D^{(1)}_n, A^{(2)}_{2n} and D^{(2)}_{n+1} we describe the combinatorial R matrix using column insertion algorithms for B,C,D Young tableaux.
We present a new methodology for utilising machine learning technology in symbolic computation research. We explain how a well known human-designed heuristic to make the choice of variable ordering in cylindrical algebraic decomposition may…
We study a class of evolutionary partial differential systems with two components related to second order (in time) non-evolutionary equations of odd order in spatial variable. We develop the formal diagonalisation method in symbolic…
In this work, we investigate a novel approach to the Combinatorial Invariance Conjecture of Kazhdan--Lusztig polynomials for the symmetric group. Using the new concept of flipclasses, we introduce some combinatorial invariants of intervals…