Related papers: Computational Complexity in Algebraic Combinatoric…
Spinor structure and internal symmetries are considered within one theoretical framework based on the generalized spin and abstract Hilbert space. Complex momentum is understood as a generating kernel of the underlying spinor structure. It…
This article belongs to a series on geometric complexity theory (GCT), an approach to the P vs. NP and related problems through algebraic geometry and representation theory. The basic principle behind this approach is called the flip. In…
The representation theory of the symmetric groups S_n is intimately related to combinatorics: combinatorial objects such as Young tableaux and combinatorial algorithms such as Murnaghan-Nakayama rule. In the limit as n tends to infinity,…
We construct real and complex matrices in terms of Kronecker products of a Witt basis of 2n null vectors in the geometric algebra over the real and complex numbers. In this basis, every matrix is represented by a unique sum of products of…
Geometric complexity theory (GCT) is an approach towards separating algebraic complexity classes through algebraic geometry and representation theory. Originally Mulmuley and Sohoni proposed (SIAM J Comput 2001, 2008) to use occurrence…
It is known that reflection coefficients for bulk fields of a rational conformal field theory in the presence of an elementary boundary condition can be obtained as representation matrices of irreducible representations of the classifying…
In the traditional approaches to Clifford algebras, the Clifford product is evaluated by recursive application of the product of a one-vector (span of the generators) on homogeneous i.e. sums of decomposable (Grassmann), multivectors and…
A numerical algorithm that computes the decomposition of any finite-dimen\-sio\-nal unitary reducible representation of a compact Lie group is presented. The algorithm, which does not rely on an algebraic insight on the group structure, is…
The syntactic nature of logic and computation separates them from other fields of mathematics. Nevertheless, syntax has been the only way to adequately capture the dynamics of proofs and programs such as cut-elimination, and the finiteness…
Bi-partite ribbon graphs arise in organising the large $N$ expansion of correlators in random matrix models and in the enumeration of observables in random tensor models. There is an algebra $\mathcal{K}(n)$, with basis given by bi-partite…
We investigate the representation theory of domestic group schemes $\mathcal{G}$ over an algebraically closed field of characteristic $p > 2$. We present results about filtrations of induced modules, actions on support varieties, Clifford…
This is an expanded version of the notes of my three lectures at a NATO Advanced Study Institute ``Symmetric functions 2001: surveys of developments and perspectives" (Isaac Newton Institute for Mathematical Sciences, Cambridge, UK; June…
The critical point between varieties A and B of algebras is defined as the least cardinality of the semilattice of compact congruences of a member of A but of no member of B, if it exists. The study of critical points gives rise to a whole…
While Kronecker coefficients $g(\lambda,\mu,\nu)$ with bounded rows are polynomial-time computable via lattice-point methods, no explicit closed-form formulas have been obtained for genuinely three-row cases in the 87 years since…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are…
In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…
We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…
In this article we study some algebraic aspects of multicomplex numbers $\mathbb M_n$. For $n\geq 2$ a canonical representation is defined in terms of the multiplication of $n-1$ idempotent elements. This representation facilitates…
The new approach to the theory of complex representrations of the finite symmetric groups which based on the notions of Coxeter generators., Gelfand-Zetlin algebras, Hecke algebra, Young-Jucys-Murphi generators and which hardly used…