相关论文: Generalized binary arrays from quasi-orthogonal co…
We study the connection between mutually unbiased bases and mutually orthogonal extraordinary supersquares, a wider class of squares which does not contain only the Latin squares. We show that there are four types of complete sets of…
A Hadamard matrix $H$ of order $n$ is a square matrix with entries $\pm 1$ satisfying $HH^T = nI_n$, where $I_n$ is the identity matrix of order $n$. A circulant Hadamard matrix is a Hadamard matrix whose rows are cyclic shifts of one…
A binary triangle of size $n$ is a triangle of zeroes and ones, with $n$ rows, built with the same local rule as the standard Pascal triangle modulo $2$. A binary triangle is said to be balanced if the absolute difference between the…
We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Opposite (GPO) Algorithm, and its modifications. By identifying specific feedback functions and initial states, we demonstrate that most…
A half a century ago, George Bergman introduced stunning machinery which would realise any commutative conical monoid as the non-stable $K$-theory of a ring. The ring constructed is ``minimal" or ``universal". Given the success of graded…
Mutually unbiased bases are an important tool in many applications of quantum information theory. We present a new algorithm for finding the mutually unbiased bases for two-qubit systems. We derive a system of four equations in the Galois…
Z-complementary code sets (ZCCSs) are used in multicarrier code-division multiple access (MC-CDMA) systems, for interference-free communication over multiuser and quasi-asynchronous environments. In this letter, we propose three new…
For every regular cardinal kappa there exists a simple complete Boolean algebra with kappa generators.
In this paper, we consider partially commutative metabelian Lie algebras whose defining graphs are cycles. We show that such algebras are universally equivalent iff the corresponding cycles have the same length. Moreover, we give an example…
We present a construction for complementary pairs of arrays that exploits a set of mutually-unbiased bases, and enumerate these arrays as well as the corresponding set of complementary sequences obtained from the arrays by projection. We…
Good integers introduced in 1997 form an interesting family of integers that has been continuously studied due to their rich number theoretical properties and wide applications. In this paper, we have focused on classes of $2^\beta$-good…
Mutually unbiased bases that can be cyclically generated by a single unitary operator are of special interest, since they can be readily implemented in practice. We show that, for a system of qubits, finding such a generator can be cast as…
Generalized numberings are an extension of Ershov's notion of numbering, based on partial combinatory algebra (pca) instead of the natural numbers. We study various algebraic properties of generalized numberings, relating properties of the…
Subspace codes are collections of subspaces of a projective space such that any two subspaces satisfy a pairwise minimum distance criterion. Recent results have shown that it is possible to construct optimal $(5,3)$ subspace codes from…
New generalized cyclotomic binary sequences of period $p^2$ are proposed in this paper, where $p$ is an odd prime. The sequences are almost balanced and their linear complexity is determined. The result shows that the proposed sequences…
In this article, we define a doubling procedure for the bialgebra of specified Feynman graphs introduced in a previous paper \cite {DMB}. This is the vector space generated by the pairs $(\bar \Gamma, \bar \gamma)$ where $\bar \Gamma$ is a…
We here both unify and generalize nonassociative structures on typed binary trees, that is to say plane binary trees which edges are decorated by elements of a set $\Omega$. We prove that we obtain such a structure, called an…
We introduce the conception of matched pairs of $(H, \beta)$-Lie algebras, construct an $(H, \beta)$-Lie algebra through them. We prove that the cocycle twist of a matched pair of $(H, \beta)$-Lie algebras can also be matched.
In this note we extend the notion of greedy bases developed by Lee, Li, and Zelevinsky to rank two generalized cluster algebras, i.e. binomial exchange relations are replaced by polynomial exchange relations. In the process we give a…
Let $\Lambda$ be a finite-dimensional associative algebra over a field. A semibrick pair is a finite set of $\Lambda$-modules for which certain Hom- and Ext-sets vanish. A semibrick pair is completable if it can be enlarged so that a…