@article{50299,
  abstract     = {{A finite classical polar space of rank $n$ consists of the totally isotropic
subspaces of a finite vector space over $\mathbb{F}_q$ equipped with a
nondegenerate form such that $n$ is the maximal dimension of such a subspace. A
$t$-$(n,k,\lambda)$ design in a finite classical polar space of rank $n$ is a
collection $Y$ of totally isotropic $k$-spaces such that each totally isotropic
$t$-space is contained in exactly $\lambda$ members of $Y$. Nontrivial examples
are currently only known for $t\leq 2$. We show that $t$-$(n,k,\lambda)$
designs in polar spaces exist for all $t$ and $q$ provided that
$k>\frac{21}{2}t$ and $n$ is sufficiently large enough. The proof is based on a
probabilistic method by Kuperberg, Lovett, and Peled, and it is thus
nonconstructive.}},
  author       = {{Weiß, Charlene}},
  journal      = {{Des. Codes Cryptogr.}},
  pages        = {{971 -- 981}},
  title        = {{{Nontrivial $t$-designs in polar spaces exist for all $t$}}},
  doi          = {{10.1007/s10623-024-01471-1}},
  volume       = {{93}},
  year         = {{2025}},
}

@article{50298,
  abstract     = {{A finite classical polar space of rank $n$ consists of the totally isotropic subspaces of a finite vector space equipped with a nondegenerate form such that $n$ is the maximal dimension of such a subspace. A $t$-Steiner system in a finite classical polar space of rank $n$ is a collection $Y$ of totally isotropic $n$-spaces such that each totally isotropic $t$-space is contained in exactly one member of $Y$. Nontrivial examples are known only for $t=1$ and $t=n-1$. We give an almost complete classification of such $t$-Steiner systems, showing that such objects can only exist in some corner cases. This classification result arises from a more general result on packings in polar spaces.}},
  author       = {{Schmidt, Kai-Uwe and Weiß, Charlene}},
  journal      = {{Combinatorial Theory}},
  number       = {{1}},
  title        = {{{Packings and Steiner systems in polar spaces}}},
  doi          = {{10.5070/c63160424}},
  volume       = {{3}},
  year         = {{2023}},
}

@article{50297,
  abstract     = {{We show that there exist ordered orthogonal arrays, whose sizes deviate from the Rao bound by a factor that is polynomial in the parameters of the ordered orthogonal array. The proof is nonconstructive and based on a probabilistic method due to Kuperberg, Lovett and Peled.}},
  author       = {{Schmidt, Kai‐Uwe and Weiß, Charlene}},
  journal      = {{Journal of Combinatorial Designs}},
  number       = {{9}},
  pages        = {{422--431}},
  publisher    = {{Wiley}},
  title        = {{{Existence of small ordered orthogonal arrays}}},
  doi          = {{10.1002/jcd.21903}},
  volume       = {{31}},
  year         = {{2023}},
}

@phdthesis{50300,
  abstract     = {{Digital communications relies heavily on the usage of different types of codes. Prominent codes nowadays are rank-metric codes and subspace codes - the q-analogs of binary codes and binary codes with constant weight. All these codes can be viewed as subsets of classical association schemes. A central coding-theoretic problem is to derive upper bounds for the size of codes. This thesis investigates Delsartes powerful linear program whose optimum is precisely such a bound for codes in association schemes. The linear programs for binary codes and binary constant-weight codes have been extensively studied since the 1970s, but their optimum is still unknown. We determine in a unified way the optimum of the linear program in several ordinary q-analogs as well as in their affine counterparts. In particular, bounds and constructions for codes in polar spaces are established, where the bounds are sharp up to a constant factor in many cases. Moreover, based on these results, an almost complete classification of Steiner systems in polar spaces is provided by showing that they could only exist in some corner cases.}},
  author       = {{Weiß, Charlene}},
  title        = {{{Linear programming bounds in classical association schemes}}},
  doi          = {{10.17619/UNIPB/1-1672}},
  year         = {{2023}},
}

@techreport{52127,
  abstract     = {{This report documents the program and the outcomes of Dagstuhl Seminar 23161 "Pushing the Limits of Computational Combinatorial Constructions". In this Dagstuhl Seminar, we focused on computational methods for challenging problems in combinatorial construction. This includes algorithms for construction of combinatorial objects with prescribed symmetry, for isomorph-free exhaustive generation, and for combinatorial search. Examples of specific algorithmic techniques are tactical decomposition, the Kramer-Mesner method, algebraic methods, graph isomorphism software, isomorph-free generation, clique-finding methods, heuristic search, SAT solvers, and combinatorial optimization. There was an emphasis on problems involving graphs, designs and codes, also including topics in related fields such as finite geometry, graph decomposition, Hadamard matrices, Latin squares, and q-analogs of designs and codes.}},
  author       = {{Moura, Lucia and Nakic, Anamari and Östergård, Patric and Wassermann, Alfred and Weiß, Charlene}},
  keywords     = {{automorphism groups, combinatorial algorithms, finite geometries, subspace designs}},
  pages        = {{40--57}},
  publisher    = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}},
  title        = {{{Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161)}}},
  doi          = {{10.4230/DagRep.13.4.40}},
  volume       = {{13, Issue 4}},
  year         = {{2023}},
}