On the number of resolvable Steiner triple systems of small 3-rank

06/29/2019
by   Minjia Shi, et al.
0

In a recent work, Jungnickel, Magliveras, Tonchev, and Wassermann derived an overexponential lower bound on the number of nonisomorphic resolvable Steiner triple systems (STS) of order v, where v=3^k, and 3-rank v-k. We develop an approach to generalize this bound and estimate the number of isomorphism classes of STS(v) of rank v-k-1 for an arbitrary v of form 3^kT.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/03/2020

On tensor rank and commuting matrices

Obtaining superlinear lower bounds on tensor rank is a major open proble...
research
05/17/2023

Quadratic Lower bounds on the Approximate Stabilizer Rank: A Probabilistic Approach

The approximate stabilizer rank of a quantum state is the minimum number...
research
11/15/2018

Secretary Ranking with Minimal Inversions

We study a twist on the classic secretary problem, which we term the sec...
research
10/06/2021

A Theory of Tournament Representations

Real world tournaments are almost always intransitive. Recent works have...
research
07/23/2018

Ideal Preconditioners for Saddle Point Systems with a Rank-Deficient Leading Block

We consider the iterative solution of symmetric saddle point systems wit...
research
06/30/2022

On the Number of Quantifiers as a Complexity Measure

In 1981, Neil Immerman described a two-player game, which he called the ...
research
09/27/2018

Spanoids - an abstraction of spanning structures, and a barrier for LCCs

We introduce a simple logical inference structure we call a spanoid (gen...

Please sign up or login with your details

Forgot password? Click here to reset