相关论文: The Computational Complexity of Rules for the Char…

We use a variety of computational tools to obtain a degree-$\binom{m + n - 2}{m - 1}$ polynomial equation conjecturally satisfied by the top-left entry of the Sinkhorn limit of a positive $m \times n$ matrix. The degree of this equation has…

In this paper, we consider the secret-string-learning problem in the teacher-student setting: the teacher has a secret string $s\in {{\{0,1\}}^{n}}$, and the student wants to learn the secret $s$ by question-answer interactions with the…

Quantum computing enables the efficient resolution of complex problems, often outperforming classical methods across various applications. In 2009, Harrow, Hassidim and Lloyd proposed an algorithm for solving linear systems of equations,…

The generalized Kazhdan-Lusztig polynomials for the finite dimensional irreducible representations of the general linear superalgebra are computed explicitly. Using the result we establish a one to one correspondence between the set of…

Littlewood-Richardson, Kronecker and plethysm coefficients are fundamental multiplicities of interest in Representation Theory and Algebraic Combinatorics. Determining a combinatorial interpretation for the Kronecker and plethysm…

We investigate the computational properties of basic mathematical notions pertaining to $\mathbb{R}\rightarrow \mathbb{R}$-functions and subsets of $\mathbb{R}$, like finiteness, countability, (absolute) continuity, bounded variation,…

In the oracle identification problem, we are given oracle access to an unknown N-bit string x promised to belong to a known set C of size M and our task is to identify x. We present a quantum algorithm for the problem that is optimal in its…

Let $N$ be a normal subgroup of a finite group $G$. From a result due to Brauer, it can be derived that the character table of $G$ contains square submatrices which are induced by the $G$-conjugacy classes of elements in $N$ and the…

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…

We generalize the Robinson-Schensted-Knuth algorithm to the insertion of two row arrays of multisets. This generalization leads to new enumerative results that have representation theoretic interpretations as decompositions of centralizer…

The quest for quantum computers is motivated by their potential for solving problems that defy existing, classical, computers. The theory of computational complexity, one of the crown jewels of computer science, provides a rigorous…

Finding the k-medianin a network involves identifying a subset of k vertices that minimize the total distance to all other vertices in a graph. This problem has been extensively studied in computer science, graph theory, operations…

We propose a quantum algorithm for inferring the molecular nuclear spin Hamiltonian from time-resolved measurements of spin-spin correlators, which can be obtained via nuclear magnetic resonance (NMR). We focus on learning the anisotropic…

Clustering is one of the most important tools for analysis of large datasets, and perhaps the most popular clustering algorithm is Lloyd's algorithm for $k$-means. This algorithm takes $n$ vectors $V=[v_1,\dots,v_n]\in\mathbb{R}^{d\times…

In the rapidly evolving field of quantum computing, quantifying circuit complexity remains a critical challenge. This paper introduces Character Complexity, a novel measure that bridges Group-theoretic concepts with practical quantum…

We develop Pieri type as well as Murnaghan--Nakayama type formulas for equivariant Chern--Schwartz--MacPherson classes of Schubert cells in the classical flag variety. These formulas include as special cases many previously known…

We combinatorially describe entries of the transition matrices which relate monomial bases of the zero-weight space of the quantum matrix bialgebra. This description leads to a combinatorial rule for evaluating induced sign characters of…

Simulating the time evolution of a physical system at quantum mechanical levels of detail -- known as Hamiltonian Simulation (HS) -- is an important and interesting problem across physics and chemistry. For this task, algorithms that run on…

The notion of branch numbers of a linear transformation is crucial for both linear and differential cryptanalysis. The number of non-zero elements in a state difference or linear mask directly correlates with the active S-Boxes. The…

For a regular $2n$-gon there are $(2n-1)!!$ ways to match and glue the $2n$ sides. The Harer-Zagier bivariate generating function enumerates the gluings by $n$ and the genus $g$ of the attendant surface and leads to a recurrence equation…