Related papers: Butson Hadamard matrices, bent sequences, and sphe…
Upon introducing a one-parameter quadratic deformation of the q-boson algebra and a diagonal perturbation at the end point, we arrive at a semi-infinite q-boson system with a two-parameter boundary interaction. The eigenfunctions are shown…
There has been a lot of effort to construct good quantum codes from the classical error correcting codes. Constructing new quantum codes, using Hermitian self-orthogonal codes, seems to be a difficult problem in general. In this paper,…
We study non-autonomous conformal iterated function systems, with finite or countably infinite alphabet alike. These differ from the usual (autonomous) iterated function systems in that the contractions applied at each step in time are…
Given $n$ distinct points $\mathbf{x}_1, \ldots, \mathbf{x}_n$ in $\mathbb{R}^d$, let $K$ denote their convex hull, which we assume to be $d$-dimensional, and $B = \partial K $ its $(d-1)$-dimensional boundary. We construct an explicit…
We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. The…
The tight-binding model of quantum particles on a honeycomb lattice is investigated in the presence of homogeneous magnetic field. Provided the magnetic flux per unit hexagon is rational of the elementary flux, the one-particle Hamiltonian…
We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…
We study spherical quadrilaterals whose angles are odd multiples of pi/2, and the equivalent accessory parameter problem for the Heun equation. We obtain a classification of these quadrilaterals up to isometry. For given angles, there are…
We develop the quantum inverse scattering method for the one-dimensional Hubbard model on the infinite line at zero density. This enables us to diagonalize the Hamiltonian algebraically. The eigenstates can be classified as scattering…
Rank-metric codes, defined as sets of matrices over a finite field with the rank distance, have gained significant attention due to their applications in network coding and connections to diverse mathematical areas. Initially studied by…
Base sequences BS(m,n) are quadruples (A;B;C;D) of {+1,-1}-sequences, A and B of length m and C and D of length n, the sum of whose non-periodic auto-correlation functions is zero. Base sequences and some special subclasses of BS(n+1,n)…
An analytical method for getting new complex Hadamard matrices by using mutually unbiased bases and a nonlinear doubling formula is provided. The method is illustrated with the n=4 case that leads to a rich family of eight-dimensional…
The construction of self-dual codes over small fields such that their minimum distances are as large as possible is a long-standing challenging problem in the coding theory. In 2009, a family of binary self-dual cyclic codes with lengths…
Quantum signal processing is a powerful framework in quantum algorithms, playing a central role in Hamiltonian simulation and related applications. The sequence of polynomials implemented at each step of this protocol provides a polynomial…
This paper describes new, simple, recursive methods of construction for orientable sequences, i.e. periodic binary sequences in which any n-tuple occurs at most once in a period in either direction. As has been previously described, such…
We show that given an instance of a bivariate bicycle (BB) code, it is possible to generate an infinite sequence of new BB codes using increasingly large covering graphs of the original code's Tanner graph. When a BB code has a Tanner graph…
A new construction of complex Hadamard matrices of composite order d=pq, with primes p,q, is presented which is based on pairs of mutually unbiased bases containing only product states. For product dimensions d < 100, we illustrate the…
Certain simplicial complexes are used to construct a subset $D$ of $\mathbb{F}_{2^n}^m$ and $D$, in turn, defines the linear code $C_{D}$ over $\mathbb{F}_{2^n}$ that consists of $(v\cdot d)_{d\in D}$ for $v\in \mathbb{F}_{2^n}^m$. Here we…
In this work we construct a sequence of Riemannian metrics on the three-sphere with scalar curvature greater than or equal to $6$ and arbitrarily large widths. Our procedure is based on the connected sum construction of positive scalar…
Let $A_q(n,d)$ be the maximum order (maximum number of codewords) of a $q$-ary code of length $n$ and Hamming distance at least $d$. And let $A(n,d,w)$ that of a binary code of constant weight $w$. Building on results from algebraic graph…