Related papers: Constructions for orthogonal designs using signed …
We investigate polynomials, called m-polynomials, whose generator polynomial has coefficients that can be arranged as a matrix, where q is a positive integer greater than one. Orthogonality relations are established and coefficients are…
We study a class of Labelled Oriented Graph (LOG) group where the underlying graph is a tadpole graph. We show that such a group is the natural HNN extension of a cyclically presented group and investigate the relationship between the LOG…
We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…
The circulant real and complex matrices are used to find new real and complex conference matrices. With them we construct Sylvester inverse orthogonal matrices by doubling the size of inverse complex conference matrices. When the free…
We give a finite presentation by generators and relations for the group O_n(Z[1/2]) of n-dimensional orthogonal matrices with entries in Z[1/2]. We then obtain a similar presentation for the group of n-dimensional orthogonal matrices of the…
Orthogonal and quasi-orthogonal matrices have a long history of use in digital image processing, digital and wireless communications, cryptography and many other areas of computer science and coding theory. The practical benefits of using…
We construct infinitely many signed graphs having symmetric spectrum, by using the NEPS and rooted product of signed graphs. We also present a method for constructing large cospectral signed graphs. Although the obtained family contains…
In a recent article, D. Kazhdan and A. Yom Din conjectured the validity of an asymptotic form of Schur's orthogonality for tempered irreducible unitary representations of semisimple groups defined over local fields. In the non-Archimedean…
In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…
We construct new symmetric Hadamard matrices of orders $92,116$, and $172$. While the existence of those of order $92$ was known since 1978, the orders $116$ and $172$ are new. Our construction is based on a recent new combinatorial array…
In contrast to many known results concerning periodic tilings of the Euclidean plane with pentagons, here tilings with rotational symmetry are investigated. A certain class of convex pentagons is introduced. It can be shown that for any…
Compliance control is an increasingly employed technique used in the robotic field. It is known that various mechanical properties can be reproduced depending on the design of the stiffness matrix, but the design theory that takes advantage…
This article focuses on a combinatorial structure specific to triangulated plane graphs with quadrangular outer face and no separating triangle, which are called irreducible triangulations. The structure has been introduced by Xin He under…
We present a procedure which enables the computation and the description of structures of isotropy subgroups of the group of complex orthogonal matrices with respect to the action of *congruence on Hermitian matrices. A key ingredient in…
An Orthogonally resolvable Matching Design OMD$(n, k)$ is a partition of the edges the complete graph $K_n$ into matchings of size $k$, called blocks, such that the blocks can be resolved in two different ways. Such a design can be…
We study the existence and construction of circulant matrices $C$ of order $n\geq2$ with diagonal entries $d\geq0$, off-diagonal entries $\pm1$ and mutually orthogonal rows. These matrices generalize circulant conference ($d=0$) and…
A complex orthogonal (geometric) structure on a complex manifold is a geometric structure locally modelled on a non-degenerate quadric. One of the first examples of such a structure on a compact manifold of dimension three was constructed…
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…
A combinatorial construction is used to analyze the properties of polyhedral products and generalized moment-angle complexes with respect to certain operations on CW pairs including exponentiation. This allows for the construction of…
A new notion of bent sequence related to Hadamard matrices was introduced recently, motivated by a security application ( Sol\'e et al, 2021). We study the self dual class in length at most $196.$ We use three competing methods of…