Related papers: RSK and Quantum Symmetric Functions: A Combinatori…
Many emerging commercial services are based on the sharing or pooling of resources for common use with the aim of reducing costs. Businesses such as delivery-, mobility-, or transport-as-a-service have become standard in many parts of the…
Motivated from the theory of quantum error correcting codes, we investigate a combinatorial problem that involves a symmetric $n$-vertices colourable graph and a group of operations (colouring rules) on the graph: find the minimum sequence…
Schur's $Q$-functions with reduced variables are discussed by employing a combinatorics of strict partitions. They are called reduced $Q$-functions. We give a description of the linear relations among reduced $Q$-functions.
We show that normalized quantum K-theoretic vertex functions for cotangent bundles of partial flag varieties are the eigenfunctions of quantum trigonometric Ruijsenaars-Schneider (tRS) Hamiltonians. Using recently observed relations between…
A novel approach is proposed to analyze a rather vast counter-rotating Hamiltonian interaction in the context of cavity quantum electrodynamics. The method relies upon the supersymmetric mapping of the corresponding rotating interaction and…
We review some connections between quantum information and statistical mechanics. We focus on three sets of results for classical spin models. First, we show that the partition function of all classical spin models (including models in…
This is a comprehensive review of the random-matrix approach to the theory of phase-coherent conduction in mesocopic systems. The theory is applied to a variety of physical phenomena in quantum dots and disordered wires, including universal…
Quantum neural networks (QNNs) are an analog of classical neural networks in the world of quantum computing, which are represented by a unitary matrix with trainable parameters. Inspired by the universal approximation property of classical…
We introduce a classical-quantum hybrid approach to computation, allowing for a quadratic performance improvement in the decision process of a learning agent. In particular, a quantum routine is described, which encodes on a quantum…
This article aims to bring quantum computing to robotics. A quantum algorithm is developed to minimize the distance travelled in warehouses and distribution centres where order picking is applied. For this, a proof of concept is proposed…
Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the…
In recent years, quantum computing has drawn significant interest within the field of high-energy physics. We explore the potential of quantum algorithms to resolve the combinatorial problems in particle physics experiments. As a concrete…
We consider a filtration of the symmetric function space given by $\Lambda^{(k)}_t$, the linear span of Hall-Littlewood polynomials indexed by partitions whose first part is not larger than $k$. We introduce symmetric functions called the…
We systematically study wreath product Schur functions and give a combinatorial construction using colored partitions and tableaux. The Pieri rule and the Littlewood-Richardson rule are studied. We also discuss the connection with…
Many combinatorial generating functions can be expressed as combinations of symmetric functions, or extracted as sub-series and specializations from such combinations. Gessel has outlined a large class of symmetric functions for which the…
Given an elliptic curve C, we study here $N_k = #C(F_{q^k})$, the number of points of C over the finite field F_{q^k}. This sequence of numbers, as k runs over positive integers, has numerous remarkable properties of a combinatorial flavor…
The main purpose of this paper is the study of a~new class of summing multilinear operators acting from the product of Banach lattices with some nontrivial lattice convexity. A~mixed Pietsch-Maurey-Rosenthal type factorization theorem for…
Parking functions are a widely studied class of combinatorial objects, with connections to several branches of mathematics. On the algebraic side, parking functions can be identified with the standard monomials of $M_n$, a certain monomial…
We prove an identity about partitions involving new combinatorial coefficients. The proof given is using a generating function. As an application we obtain the explicit expression of two shifted symmetric functions, related with Jack…
The Robinson-Schensted-Knuth (RSK) algorithm maps an integer matrix to a pair of semi-standard Young tableaux (SSYTs) whose underlying shape has the same integer partition. We study the set of matrices associated with a given partition…