English
Related papers

Related papers: Two-level Cretan Matrices Constructed Theoreticall…

200 papers

Two matrices with elements taken from the set {-1,1} are Hadamard equivalent if one can be converted into the other by a sequence of permutations of rows and columns, and negations of rows and columns. In this paper we summarize what is…

Combinatorics · Mathematics 2007-06-13 William P. Orrick

An efficient method is proposed for computing the structure of Jordan blocks of a matrix of integers or rational numbers by exact computation. We have given a method for computing Jordan chains of a matrix with exact computation. However,…

Symbolic Computation · Computer Science 2025-10-06 Shinichi Tajima , Katsuyoshi Ohara , Akira Terui

The joint use of counting functions, Hilbert basis and Markov basis allows to define a procedure to generate all the fractions that satisfy a given set of constraints in terms of orthogonality. The general case of mixed level designs,…

Methodology · Statistics 2009-06-18 Roberto Fontana , Giovanni Pistone

In this paper, a recent method to construct complementary sequence sets and complete complementary codes by Hadamard matrices is deeply studied. By taking the algebraic structure of Hadamard matrices into consideration, our main result…

Information Theory · Computer Science 2020-05-13 Zilong Wang , Guang Gong

Hermite interpolation property is desired in applied and computational mathematics. Hermite and vector subdivision schemes are of interest in CAGD for generating subdivision curves and in computational mathematics for building Hermite…

Numerical Analysis · Mathematics 2024-08-12 Bin Han

Bent functions, or equivalently, Hadamard difference sets in the elementary Abelian group $(\gf(2^{2m}), +)$, have been employed to construct symmetric and quasi-symmetric designs having the symmetric difference property. The main objective…

Combinatorics · Mathematics 2019-04-26 Cunsheng Ding , Akihiro Munemasa , Vladimir Tonchev

We construct new, previously unknown parametric families of complex conference matrices and of complex Hadamard matrices of square orders and related them to complex equiangular tight frames.

Combinatorics · Mathematics 2014-09-22 Boumediene Et-Taoui

We provide a method to construct $t$-designs from weighing matrices and association schemes. One instance of our method can produce a $3$-design from any (symmetric or skew-symmetric) conference matrix, thereby providing a partial answer to…

Combinatorics · Mathematics 2026-04-14 Gary Greaves , Sho Suda

Let $R$ be a finite commutative ring with unity $1_R$ and $k \in R$. Properties of one-sided $k$-orthogonal $n \times n$ matrices over $R$ are presented. When $k$ is idempotent, these matrices form a semigroup structure. Consequently new…

Information Theory · Computer Science 2021-03-11 Virgilio P. Sison , Charles R. Repizo

It is shown that a normalized complex Hadamard matrix of order $6$ having three distinct columns, each containing at least one $-1$ entry necessarily belongs to the transposed Fourier family, or to the family of $2$-circulant complex…

Combinatorics · Mathematics 2024-10-07 Ákos K. Matszangosz , Ferenc Szöllősi

We devise a method that reduces the problem of classifying systems of forms and linear mappings to the problem of classifying systems of linear mappings. Canonical matrices of (i) bilinear or sesquilinear forms, (ii) pairs of symmetric,…

Representation Theory · Mathematics 2008-01-08 Vladimir V. Sergeichuk

We construct $(2n)^2\times (2n)^2$ unitary braid matrices $\hat{R}$ for $n\geq 2$ generalizing the class known for $n=1$. A set of $(2n)\times (2n)$ matrices $(I,J,K,L)$ are defined. $\hat{R}$ is expressed in terms of their tensor products…

Quantum Algebra · Mathematics 2008-11-26 B. Abdesselam , A. Chakrabarti , V. K. Dobrev , S. G. Mihov

A Bohemian matrix family is a set of matrices all of whose entries are drawn from a fixed, usually discrete and hence bounded, subset of a field of characteristic zero. Originally these were integers -- hence the name, from the acronym…

Symbolic Computation · Computer Science 2022-05-25 Robert M. Corless , George Labahn , Dan Piponi , Leili Rafiee Sevyeri

All generalized Hadamard matrices of order 18 over a group of order 3, H(6,3), are enumerated in two different ways: once, as class regular symmetric (6,3)-nets, or symmetric transversal designs on 54 points and 54 blocks with a group of…

Combinatorics · Mathematics 2012-05-28 Masaaki Harada , Clement Lam , Akihiro Munemasa , Vladimir D. Tonchev

We study structurable algebras of skew-dimension one. We present two different equivalent constructions for such algebras: one in terms of non-linear isotopies of cubic norm structures, and one in terms of hermitian cubic norm structures.…

Rings and Algebras · Mathematics 2017-12-05 Tom De Medts

A new family of asymmetric matrices of Walsh-Hadamard type is introduced. We study their properties and, in particular, compute their determinants and discuss their eigenvalues. The invertibility of these matrices implies that certain…

Combinatorics · Mathematics 2014-11-20 Ron M. Adin , Yuval Roichman

We produce a family of complexes called trimming complexes and explore applications. We study how trimming complexes can be used to deduce the Betti table for the minimal free resolution of the ideal generated by subsets of a generating set…

Commutative Algebra · Mathematics 2020-09-18 Keller VandeBogert

We have extended the Paley constructions for Hadamard matrices and obtained some series of Hadamard matrices. Especially Paley construction-II is applicable for odd prime power q is congruent to 1(mod 4) however our method is applicable for…

Combinatorics · Mathematics 2019-12-24 Shipra Kumari , Hrishikesh Mahato

Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…

Rings and Algebras · Mathematics 2018-09-19 Jason Gaddis

We give explicit constructions for incomplete pairwise balanced designs IPBD$((v;w),K)$, or, equivalently, edge-decompositions of a difference of two cliques $K_v \setminus K_w$ into cliques whose sizes belong to the set $K$. Our…

Combinatorics · Mathematics 2018-09-24 Peter J. Dukes , Esther R. Lamken
‹ Prev 1 4 5 6 7 8 10 Next ›