相关论文: The Computational Complexity of Rules for the Char…
We compute the character table of $\text{GL}_n(\mathbb{F}_q)\rtimes\!<\!\sigma\!>\!$, $\sigma$ being an order 2 exterior automorphism.
The problem of computing the characters of the finite dimensional irreducible representations of the Lie superalgebra $\mathfrak{gl}(m|n)$ over $\C$ was solved a few years ago by V. Serganova. In this article, we present an entirely…
We describe an algorithm for computing Schur indices of irreducible characters of a finite group $G$, based on computations within $G$ and its subgroups and with their character tables. The algorithm has been implemented within \Magma\ and…
Motivated by notions of quantum heuristics and by average-case rather than worst-case algorithmic analysis, we define quantum computational advantage in terms of individual problem instances. Inspired by the classical notions of Kolmogorov…
In computer algebra there are different ways of approaching the mathematical concept of functions, one of which is by defining them as solutions of differential equations. We compare different such approaches and discuss the occurring…
We develop a classical model of computation (the S model) which captures some important features of quantum computation, and which allows to design fast algorithms for solving specific problems. In particular, we show that Deutsch's problem…
Let $H$ be the Iwahori--Hecke algebra associated with $S_n$, the symmetric group on $n$ symbols. This algebra has two important bases: the Kazhdan--Lusztig basis and the Murphy basis. While the former admits a deep geometric interpretation,…
The currently fastest algorithm for regular expression pattern matching and membership improves the classical O(nm) time algorithm by a factor of about log^{3/2}n. Instead of focussing on general patterns we analyse homogeneous patterns of…
Finding upper bounds for character ratios is a fundamental problem in asymptotic group theory. Previous bounds in the symmetric group have led to remarkable applications in unexpected domains. The existing approaches predominantly relied on…
The plethystic Murnaghan-Nakayama rule describes how to decompose the product of a Schur function and a plethysm of the form $p_r\circ h_m$ as a sum of Schur functions. We provide a short, entirely combinatorial proof of this rule using the…
An algorithm for answering conjunctive queries over SHIQ knowledge bases that is coNP in data complexity is given. The algorithm is based on the tableau algorithm for reasoning with individuals in SHIQ. The blocking conditions of the…
We describe two aspects of the behaviour of entries of Young tableaux during the application of the Novelli-Pak-Stoyanovskii algorithm. We derive two theorems which both contain a generalized version of a conjecture by Krattenthaler and…
Quantum computers are known for their potential to achieve up-to-exponential speedup compared to classical computers for certain problems. To exploit the advantages of quantum computers, we propose quantum algorithms for linear stochastic…
We describe a cluster algebra algorithm for calculating q-characters of Kirillov-Reshetikhin modules for any untwisted quantum affine algebra. This yields a geometric q-character formula for tensor products of Kirillov-Reshetikhin modules.…
We present recent developments of the NTChem program for performing large scale hybrid Density Functional Theory calculations on the supercomputer Fugaku. We combine these developments with our recently proposed Complexity Reduction…
Computational complexity is a core theory of computer science, which dictates the degree of difficulty of computation. There are many problems with high complexity that we have to deal, which is especially true for AI. This raises a big…
In this work we introduce a quantum sorting algorithm with adaptable requirements of memory and circuit depth, and then use it to develop a new quantum version of the classical machine learning algorithm known as k-nearest neighbors (k-NN).…
A promising approach to achieve computational supremacy over the classical von Neumann architecture explores classical and quantum hardware as Ising machines. The minimisation of the Ising Hamiltonian is known to be NP-hard problem for…
In this paper I present a new and unified method of proving character formulas for discrete series representations of connected Lie groups by applying a Chern character-type construction to the matrix factorizations of [FT] and [FHT3]. In…
We axiomatize and study the matrices of type $H\in M_N(A)$, having unitary entries, $H_{ij}\in U(A)$, and whose rows and columns are subject to orthogonality type conditions. Here $A$ can be any $C^*$-algebra, for instance $A=\mathbb C$,…