Related papers: Kochen-Specker sets and Hadamard matrices
We design a class of Chudnovsky-type algorithms multiplying k elements of a finite extension of order n a finite field K. We prove that these algorithms give a tensor decomposition of the k-multiplication for which the rank is linear in n…
There are several well-known methods that one can use to construct Hadamard matrices from base sequences BS(m,n). In view of the recent classification of base sequences BS(n+1,n) for n <= 30, it may be of interest to show on an example how…
Kochen-Specker theorem rules out the non-contextual assignment of values to physical magnitudes. Here we enrich the usual orthomodular structure of quantum mechanical propositions with modal operators. This enlargement allows to refer…
We present an elementary proof of a reduced version of Gleason's theorem and the Kochen-Specker theorem to provide a novel perspective on the relation between both theorems. The proof is based on a set of linear equations for the values of…
In the proposed matrix primes, through which one can readily generate a sequence of primes. The paper also proposes a number of theorems proved by which an infinite number of prime numbers twins
For a given selection of rows and columns from a Fourier matrix, we give a number of tests for whether the resulting submatrix is Hadamard based on the primitive sets of those rows and columns. In particular, we demonstrate that whether a…
We exhibit explicitly the intertwiner operator for the monodromy matrices of the recent proposed SU(N) Hubbard model [5]. This produces a new family of non-additive R-matrices and generalizes an earlier result by Shastry [2].
We study combinatorial inequalities for various classes of set systems: matroids, polymatroids, poset antimatroids, and interval greedoids. We prove log-concavity inequalities for counting certain weighted feasible words, which generalize…
The set of 60 real rays in four dimensions derived from the vertices of a 600-cell is shown to possess numerous subsets of rays and bases that provide basis-critical parity proofs of the Bell-Kochen-Specker (BKS) theorem (a basis-critical…
First examples of symmetric Hadamard matrices of orders 508 and 764 are constructed. The method used is known as the propus construction. A conjecture regarding this method is formally proposed but it appears implicitly in three previous…
We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…
Given a bialgebra $H$ such that the associated trivial topological bialgebra $H[[\hbar]]$ admits a quasitriangular structure $\tilde{\mathcal{R}}=\mathcal{R}(1\otimes 1+\hbar\chi+\mathcal{O}(\hbar^2))$, one gets a distinguished element…
Several types of nonclassical structures within the $N$-qubit Pauli group that can be seen as fundamental resources for quantum information processing are presented and discussed. Identity Products (IDs), structures fundamentally related to…
We analyze the set of real and complex Hadamard matrices with additional symmetry constrains. In particular, we link the problem of existence of maximally entangled multipartite states of $2k$ subsystems with $d$ levels each to the set of…
In this paper, we consider the set of partitions $pend(n)$ which enumerates the number of partitions of $n$ wherein the even parts are not allowed to be distinct. Using a result of Newman, we prove a few infinite families of congruences…
In a celebrated paper of 1893, Hadamard established the maximal determinant theorem, which establishes an upper bound on the determinant of a matrix with complex entries of norm at most $1$. His paper concludes with the suggestion that…
Balancedly splittable Hadamard matrices are introduced and studied. A connection is made to the Hadamard diagonalizable strongly regular graphs, maximal equiangular lines set, and unbiased Hadamard matrices. Several construction methods are…
The conflict between classical and quantum physics can be identified through a series of yes-no tests on quantum systems, without it being necessary that these systems be in special quantum states. Kochen-Specker (KS) sets of yes-no tests…
We consider the problem of determining whether the union of two infinite matroids is a matroid. We introduce a superclass of the finitary matroids, the nearly finitary matroids, and prove that the union of two nearly finitary matroids is a…
Consider the set of scalars $\alpha$ for which the $\alpha$th Hadamard power of any $n\times n$ positive semi-definite (p.s.d.) matrix with non-negative entries is p.s.d. It is known that this set is of the form $\{0, 1, \dots, n-3\}\cup…