Related papers: Switching for 2-designs
In this article we study how a subshift can simulate another one, where the notion of simulation is given by operations on subshifts inspired by the dynamical systems theory (factor, projective subaction...). There exists a correspondence…
We show that in a complex d-dimensional vector space, one can find O(d) bases whose elements form a 2-design. Such vector sets generalize the notion of a maximal collection of mutually unbiased bases (MUBs). MUBs have manifold applications…
We show that the stability problem and the problem of constructing Barabanov norms can be resolved for planar linear switching systems in an explicit form. This can be done for every compact control set of $2 \times 2$ matrices. If the…
We show the optimal coherence of $2d$ lines in $\mathbb{C}^{d}$ is given by the Welch bound whenever a skew Hadamard of order $d+1$ exists. Our proof uses a variant of Hadamard doubling that converts any equiangular tight frame of size…
The notion of unbiased orthogonal designs is introduced as a generalization among unbiased Hadamard matrices, unbiased weighing matrices and quasi-unbiased weighing matrices. We provide upper bounds and several constructions for mutually…
Recently, it has been shown [arXiv:1106.3482] that the two-Higgs-doublet-model potential may exhibit a maximum of 13 distinct accidental symmetries. Such a classification is based on a six-dimensional bilinear scalar field formalism…
We show that any multiple-valued function can be represented by a linear lambda term typed in a second-order polymorphic type system, using two distinct styles. The first is a circuit style, which mimics combinational circuits in switching…
In this article, we investigate symmetric 2-designs of prime order admitting a flag-transitive automorphism group G. Recently, the authors proved that the automorphism group G of this type of designs must be point-primitive, and is of…
An exact analytical diagonalization is used to solve the two dimensional Extended Hubbard Model for system with finite size. We have considered an Extended Hubbard Model (EHM) including on-site and off-site interactions with interaction…
There are few exact results for the Hubbard model on bipartite lattices of spatial dimension $d>1$. Nevertheless, the Hubbard model with transfer integral $t$ and onsite repulsion $U$ on bipartite lattices with $N_a$ sites, such as the…
We present a new method for constructing affine families of complex Hadamard matrices in every even dimension. This method has an intersection with the Di\c{t}\u{a} construction and it generalizes the Sz\"oll\H{o}si's method. We reproduce…
We compare different permutation tests and some parametric counterparts that are applicable to unbalanced designs in two by two designs. First the different approaches are shortly summarized. Then we investigate the behavior of the tests in…
This paper completes the classification of quasi-symmetric 2-$(64,24,46)$ designs of Blokhuis-Haemers type supported by the dual code $C^{\perp}$ of the binary linear code $C$ spanned by the lines of $AG(3,2^2)$ initiated in \cite{bgr-vdt}.…
New types of designs called nested space-filling designs have been proposed for conducting multiple computer experiments with different levels of accuracy. In this article, we develop several approaches to constructing such designs. The…
In this article, we study $2$-designs with $\lambda=2$ admitting a flag-transitive almost simple automorphism group with socle a finite simple exceptional group of Lie type, and we prove that such a $2$-design does not exist. In conclusion,…
We introduce Hadamard matrices whose entries are quaternionic. We then go on to provide classification of quaternionic Hadamard matrices of circulant core of orders 2 through 5. We also introduce quaternionic Hadamard matrices of Butson…
We define and enumerate two new two-parameter permutation families, namely, placements of a maximum number of non-attacking rooks on $k$ chained-together $n\times n$ chessboards, in either a circular or linear configuration. The linear case…
A relative t-design in the binary Hamming association schemes H(n,2) is equivalent to a weighted regular t-wise balanced design, i.e., certain combinatorial t-design which allow different sizes of blocks and a weight function on blocks. In…
We present an efficient scheme which couples any designated pair of spins in heteronuclear spin systems. The scheme is based on the existence of Hadamard matrices. For a system of $n$ spins with pairwise coupling, the scheme concatenates…
Finding four six-dimensional mutually unbiased bases (MUBs) containing the identity matrix is a long-standing open problem in quantum information. We show that if they exist, then the $H_2$-reducible matrix in the four MUBs has exactly nine…