English
Related papers

Related papers: Signed group orthogonal designs and their applicat…

200 papers

Hadamard matrices are $(-1, +1)$ square matrices with mutually orthogonal rows. The Hadamard conjecture states that Hadamard matrices of order $n$ exist whenever $n$ is $1$, $2$, or a multiple of $4$. However, no construction is known that…

Combinatorics · Mathematics 2023-06-30 Matteo Cati , Dmitrii V. Pasechnik

Hadamard matrices are square $n\times n$ matrices whose entries are ones and minus ones and whose rows are orthogonal to each other with respect to the standard scalar product in $\Bbb R^n$. Each Hadamard matrix can be transformed to a…

Combinatorics · Mathematics 2021-05-05 Ruslan Sharipov

Let $\mathbb{P}_G([0,\infty))$ and $\mathbb{P}_G^{'}([0,\infty))$ be the sets of positive semidefinite and positive definite matrices of order $n$, respectively, with nonnegative entries, where some positions of zero entries are restricted…

Combinatorics · Mathematics 2022-02-09 Veer Singh Panwar , A. Satyanarayana Reddy

Let $R$ be a (not necessarily commutative) ring whose additive group is finitely generated and let $U_n(R) \subset GL_n(R)$ be the group of upper-triangular unipotent matrices over $R$. We study how the homology groups of $U_n(R)$ vary with…

Algebraic Topology · Mathematics 2020-03-18 Andrew Putman , Steven V Sam , Andrew Snowden

Signed difference sets have interesting applications in communications and coding theory. A $(v,k,\lambda)$-difference set in a finite group $G$ of order $v$ is a subset $D$ of $G$ with $k$ distinct elements such that the expressions…

Combinatorics · Mathematics 2023-06-12 Zhiwen He , Tingting Chen , Gennian Ge

In computer experiments, it has become a standard practice to select the inputs that spread out as uniformly as possible over the design space. The resulting designs are called space-filling designs and they are undoubtedly desirable…

Methodology · Statistics 2025-05-06 Guangzhou Chen , Yuanzhen He , C. Devon Lin , Fasheng Sun

One of the main goals of design theory is to classify, characterize and count various combinatorial objects with some prescribed properties. In most cases, however, one quickly encounters a combinatorial explosion and even if the complete…

Combinatorics · Mathematics 2012-04-24 Ferenc Szöllősi

Let $\mathcal{T}_n$ be the set of ribbon $L$-shaped $n$-ominoes for some $n\ge 4$ even, and let $\mathcal{T}_n^+$ be $\mathcal{T}_n$ with an extra $2\times 2$ square. We investigate signed tilings of rectangles by $\mathcal{T}_n$ and…

Combinatorics · Mathematics 2016-03-01 Kenneth Gill , Viorel Nitica

A $(v,k,\lambda)$ difference set in a group $G$ of order $v$ is a subset $\{d_1, d_2, \ldots,d_k\}$ of $G$ such that $D=\sum d_i$ in the group ring $\mathbb{Z}[G]$ satisfies $$D D^{-1} = n + \lambda G,$$ where $n=k-\lambda$. If $D=\sum s_i…

Combinatorics · Mathematics 2022-12-22 Daniel M. Gordon

We present a guiding principle for designing fermionic Hamiltonians and quantum Monte Carlo (QMC) methods that are free from the infamous sign problem by exploiting the Lie groups and Lie algebras that appear naturally in the Monte Carlo…

Strongly Correlated Electrons · Physics 2015-12-23 Lei Wang , Ye-Hua Liu , Mauro Iazzi , Matthias Troyer , Gergely Harcos

We study the signature pair for certain group-invariant Hermitian polynomials arising in CR geometry. In particular, we determine the signature pair for the finite subgroups of $SU(2)$. We introduce the asymptotic positivity ratio and…

Complex Variables · Mathematics 2010-04-13 Dusty Grundmeier

A Formal Orthogonal Pair is a pair $(A,B)$ of symbolic rectangular matrices such that $AB^T=0$. It can be applied for the construction of Hadamard and Weighing matrices. In this paper we introduce a systematic way for constructing such…

Combinatorics · Mathematics 2020-06-03 Assaf Goldberger , Ilias Kotsireas

We construct orthogonal arrays OA$_{\lambda} (k,n)$ (of strength two) having a row that is repeated $m$ times, where $m$ is as large as possible. In particular, we consider OAs where the ratio $m / \lambda$ is as large as possible; these…

Combinatorics · Mathematics 2018-12-14 Charles J. Colbourn , Douglas R. Stinson , Shannon Veitch

Motivated in part by a problem of combinatorial optimization and in part by analogies with quantum computations, we consider approximations of orthogonal matrices U by ``non-commutative convex combinations'' A of permutation matrices of the…

Functional Analysis · Mathematics 2007-05-23 Alexander Barvinok

In 2005 J.L. Waldspurger proved the following theorem: given a finite real reflection group $W$, the closed positive root cone is tiled by the images of the open weight cone under the action of the linear transformations $id-w$. Shortly…

Combinatorics · Mathematics 2017-09-05 James McKeown

Orthogonal sets of idempotents are used to design sets of unitary matrices, known as constellations, such that the modulus of the determinant of the difference of any two distinct elements is greater than $0$. It is shown that unitary…

Information Theory · Computer Science 2017-02-07 Ted Hurley

Square COD (complex orthogonal design) with size $[n, n, k]$ is an $n \times n$ matrix $\mathcal{O}_z$, where each entry is a complex linear combination of $z_i$ and their conjugations $z_i^*$, $i=1,\ldots, k$, such that $\mathcal{O}_z^H…

Information Theory · Computer Science 2013-03-19 Yuan Li

The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…

Combinatorics · Mathematics 2021-10-12 Pepijn Wissing , Edwin R. van Dam

We introduce and develop a theory of orthogonality with respect to Sobolev inner products on the real line for sequences of functions with a tridiagonal, skew-Hermitian differentiation matrix. While a theory of such L2-orthogonal systems is…

Classical Analysis and ODEs · Mathematics 2022-06-16 Arieh Iserles , Marcus Webb

Let A be an n by n matrix with determinant 1. We show that for all n > 2 there exist dimensional strictly positive constants C_n such that the average over the orthogonal group of log rho(A X) d X > C_n log ||A||, where ||A|| denotes the…

Dynamical Systems · Mathematics 2007-05-23 Igor Rivin