DISCRETA

swMATH5937MaRDI QIDQ18076FDOQ18076

Author name not available (Why is that?)

Official website: http://www.mathe2.uni-bayreuth.de/discreta/

Described by source

• A Steiner \(5\)-design on 36 points

Cited In (45)

• Isomorphism classification of \(t\)-designs with group theoretical localisation techniques applied to some Steiner quadruple systems on 20 points
• Search for combinatorial objects using lattice algorithms -- revisited
• A construction of designs on \(n+1\) points from multiply homogeneous permutation groups of degree \(n\)
• Simple \(8\)-designs with small parameters
• On the number of mutually disjoint cyclic designs and large sets of designs
• On the large sets of \(t\)-designs of size nine
• Simple non-trivial designs with an arbitrary automorphism group
• 3-spontaneous emission error designs from \(\mathrm{PSL}(2,q)\) or \(\mathrm{PGL}(2,q)\)
• Simple \(8\)-\((31,12,3080)\), \(8\)-\((40,12,16200)\) and \(8\)-\((40,12,16520)\) designs from \(\mathrm{PSL}(3,5)\) and \(\mathrm{PSL}(4,3)\)
• 3-designs from \(\text{PSL}(2,q)\)
• Large sets of \(t\)-designs through partitionable sets: a survey
• Graphical \(t\)-designs via polynomial Kramer-Mesner matrices
• New \(t\)-designs and large sets of \(t\)-designs
• Some infinite families of large sets of \(t\)-designs
• Title not available (Why is that?)
• Mutually disjoint designs and new 5-designs derived from groups and codes
• GRAPE
• libagf
• DISCRETAQ
• ROptEst
• MarPlex
• DESIGN
• ifs
• CANONIK
• libexact
• Hypergraphical \(t\)-designs
• Siamese combinatorial objects via computer algebra experimentation
• Link-Level Aspects
• images
• YIELDS
• EulerCurves
• More on block intersection polynomials and new applications to graphs and block designs
• Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
• Large sets of \(t\)-designs over finite fields
• On a theorem of Wielandt for finite primitive permutation groups
• 3-designs with block size 6 from \(\mathrm{PSL}(2,q)\) and their large sets
• Combinatorial designs for authentication and secrecy codes
• Block transitive resolutions of \(t\)-designs and Room rectangles
• More mutually disjoint Steiner systems \(S(5,8,24)\)
• PAG
• Examples of computer experimentation in algebraic combinatorics
• A recursive construction for simple \(t\)-designs using resolutions
• Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
• Steiner systems with automorphism groups \(PSL(2,71)\), \(PSL(2,83)\), and \(P\Sigma L(2,3^5)\)
• Schrödinger wave functional in quantum Yang-Mills theory from precanonical quantization

This page was built for software: DISCRETA