Related papers: The Andrews-Olsson identity and Bessenrodt inserti…
Recently, Banderier et. al. considered Young tableaux with walls, which are similar to standard Young tableaux, except that local decreases are allowed at some walls. We count the numbers $\overline{f}_m(n)$ of Young tableaux of shape…
Recently, a universal formula for a non-holomorphic modular completion of the generating functions of refined BPS indices in various theories with $N=2$ supersymmetry has been suggested. It expresses the completion through the holomorphic…
We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…
Recent work by Elmasry et al. (STACS 2015) and Asano et al. (ISAAC 2014), reconsidered classical fundamental graph algorithms focusing on improving the space complexity. We continue this line of work focusing on space. Our first result is a…
In this paper we obtain the weak type (1,1) boundedness of Calderon-Zygmund operators acting over operator-valued functions. Our main tools for its solution are a noncommutative form of Calderon-Zygmund decomposition in conjunction with a…
We take initial steps towards a general framework for constructing logical gates in general quantum CSS codes. Viewing CSS codes as cochain complexes, we observe that cohomology invariants naturally give rise to diagonal logical gates. We…
We present a quantum algorithm for multiplying two $n$-bit integers with overall circuit depth and $T$-depth both bounded by $O(\log^{2} n)$, while using $O(n^{2})$ gates and ancillary qubits. Our construction generates partial products via…
Decomposing unitary operations into native gates is an essential step for implementing quantum algorithms. For qubit-based devices, where native gates are typically single- and two-qubit operations, a range of decomposition techniques have…
In these two companion papers, we give infinite families of partition identities which generalise Primc's and Capparelli's identities, and study their consequences on the theory of crystal bases of the affine Lie algebra $A_{n-1}^{(1)}.$ In…
Let $\mathcal{A}=(a_i)_{i=1}^\infty$ be a non-decreasing sequence of positive integers and let $k\in\mathbb{N}_+$ be fixed. The function $p_\mathcal{A}(n,k)$ counts the number of partitions of $n$ with parts in the multiset…
We establish several results concerning tensor products, q-characters, and the block decomposition of the category of finite-dimensional representations of quantum affine algebras in the root of unity setting. In the generic case, a Weyl…
We consider the isomorphism problem for groups specified by their multiplication tables. Until recently, the best published bound for the worst-case was achieved by the n^(log_p n + O(1)) generator-enumeration algorithm. In previous work…
Presented are polynomial identities which imply generalizations of Euler and Rogers--Ramanujan identities. Both sides of the identities can be interpreted as generating functions of certain restricted partitions. We prove the identities by…
We explore some connections between vectors of integers and integer partitions seen as bi-infinite words. This methodology enables us to give a combinatorial interpretation of the Macdonald identities for affine root systems of the seven…
The number of distinguishable inherent structures of a liquid is the key component to understanding the thermodynamics of glass formers. In the case of hard potential systems such as hard discs, spheres and ellipsoids, an inherent structure…
For the renormalised sums of the random $\pm 1$-colouring of the connected components of $\mathbb Z$ generated by the coalescing renewal processes in the "power law P\'olya's urn" of Hammond and Sheffield we prove functional convergence…
The 3D Bondi-Metzner-Sachs (BMS$_3$) algebra that is the asymptotic symmetry algebra at null infinity of the $1+2$D asymptotically flat space-time is isomorphic to the $1+1$D Carrollian conformal algebra. Building on this connection,…
The crystals for finite dimensional representations of sl(n+1) can be realized using Young tableaux. The infinity crystal on the other hand is naturally realized using multisegments, and there is a simple description of the embedding of…
We provide an integral combinatorial characterization of pseudo-Anosov maps on closed oriented surfaces of genus g > 1. We show that an orientation-preserving pseudo-Anosov homeomorphism with orientable foliations and fixing all critical…
Quantum algorithms for solving linear systems of equations have generated excitement because of the potential speed-ups involved and the importance of solving linear equations in many applications. However, applying these algorithms can be…