Zobrazeno 1 - 10
of 87
pro vyhledávání: '"Reinhard Laue"'
More than 20 years of experience in molecular structure generation, from conceptualization through to applications Innovative, interdisciplinary text demonstrating example queries with software packages such as MOLGEN-online Detailed explanations on
Publikováno v:
Advances in Mathematics of Communications. 13:165-170
Based on the existence of designs for the derived and residual parameters of admissible parameter sets of designs over finite fields we obtain a new infinite series of designs over finite fields for arbitrary prime powers \begin{document}$q$\end{docu
Publikováno v:
Journal of Combinatorial Theory, Series A. 147:155-185
In this article, three types of joins are introduced for subspaces of a vector space. Decompositions of the Grasmannian into joins are discussed. This framework admits a generalization of large set recursion methods for block designs to subspace desi
Autor:
Reinhard Laue
Publikováno v:
Group Theory, Combinatorics, and Computing. :89-120
In this article, we show the existence of large sets $${\text {LS}}_2[3](2,k,v)$$ for infinitely many values of k and v. The exact condition is $$v \ge 8$$ and $$0 \le k \le v$$ such that for the remainders $$\bar{v}$$ and $$\bar{k}$$ of v and k modu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9decee486f11f15fb6b1d1c761b1265b
http://arxiv.org/abs/1603.06976
http://arxiv.org/abs/1603.06976
Autor:
Apurba K. Bhattacharjee, José Luis Villaveces, Lakshminarasimhan Rajagopalan, Jorge Galvez, Shereena M. Arif, Axel Kohnert, Ralf Gugisch, Subhabrata Majumdar, Subhash C. Basak, Matthias Dehmer, Marjan Vračko, Debesh R. Roy, Christoph Rücker, Ramón García-Domenech, Maria Galvez-Llompart, Hariharan Rajesh, Nenad Trinajstić, Ivan Sović, Markus Meringer, Reinhard Laue, Danail Bonchev, John D. Holliday, Ray Hefferlin, Guillermo Restrepo, Lavanya Sivakumar, Pratim Kumar Chattaraj, Adalbert Kerber, Vellarkad N. Viswanadhan, Peter Willett, Alfred Wassermann, Bono Lučić
Publikováno v:
Advances in Mathematical Chemistry and Applications Volume 1 (Revised Edition)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ba85c77e6dfda62d280bbcb41951ad1
https://doi.org/10.2174/97816810819771150101
https://doi.org/10.2174/97816810819771150101
Autor:
Daniela Nikolova-Popova, Reinhard Laue
Publikováno v:
Journal of Combinatorial Designs. 20:1-22
Representing a design graphically can make certain properties of a design obvious that otherwise would require tedious reasoning. This holds for symmetries, resolvability, and subdesign inclusion in appropriate cases. We describe how a graphical repr
Publikováno v:
Journal of Combinatorial Theory, Series A. 118(3):1072-1085
In this paper we present a construction of 3-designs by using a 3-design with resolvability. The basic construction generalizes a well-known construction of simple 3-(v,4,3) designs by Jungnickel and Vanstone (1986). We investigate the conditions und
Autor:
Alfred Wassermann, Reinhard Laue
Publikováno v:
Discrete Mathematics. 308:166-174
We show the existence of simple 8-(31,12,3080), 8-(40,12,16200) and 8-(40,12,16520) designs and list for each parameter set one example in full detail. The designs are constructed with a prescribed group of automorphisms PSL(3,5) or PSL(4,3) using th