Skip to main content

All Questions

Filter by
Sorted by
Tagged with
5 votes
2 answers
189 views

Bisymmetric Hadamard matrices

Definitions: An $n\times n$ Hadamard matrix is a matrix whose entries are either $1$ or $−1$ and whose rows are mutually orthogonal. A symmetric matrix is a square matrix that is equal to its own ...
user369335's user avatar
1 vote
1 answer
136 views

3-partition of a special set

$S_5$ is a set consisting of the following 5-length sequences $s$: (1) each digit of $s$ is $a$, $b$, or $c$; (2) $s$ has and only has one digit that is $c$. $T_5$ is a set consisting of the following ...
4869's user avatar
  • 47
3 votes
0 answers
148 views

Linear combinations of special matrices

I am a hobby computer scientist and I have a problem to which I am searching an efficient algorithm. Given an integer n, we want to combine some square input-matrices of size n in a way that is ...
BenBar's user avatar
  • 73
2 votes
2 answers
802 views

Minimally intersecting subsets of fixed size

The question I have, is how to generate the following collection of subsets: Given a set $S$ of size $n$. I want to find a sequence of $k$ subsets of fixed size $m$, $0<m<n$, such that at each ...
Jim's user avatar
  • 145
11 votes
4 answers
5k views

Constructing Steiner Triple Systems Algorithmically

I want to create STS(n) algorithmically. I know there are STS(n)s for $n \cong 1,3 \mod 6$. But it is difficult to actually construct the triples. For STS(7) it is pretty easy and but for larger n I ...
JarvisP's user avatar
  • 133