Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Spyros S. Magliveras"'
Publikováno v:
Rendiconti di Matematica e delle Sue Applicazioni, Vol 30, Iss 1, Pp 121-144 (2010)
In this paper we discuss methods that might be employed in determining the subgroup structure of a finite group G. These methods have a particularly combinatorial flavor connected with graphs, designs and the combinatorial nature of presentations of
Externí odkaz:
https://doaj.org/article/7b2f7974c7f949feb6785cd7094e26e7
Publikováno v:
Designs, Codes and Cryptography. 87:831-839
We show that there are exactly 2624 isomorphism classes of Steiner triple systems on 27 points having 3-rank 24, all of which are actually resolvable. More generally, all Steiner triple systems on $$3^n$$ points having 3-rank at most $$3^n-n$$ are re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7829358521f7c6a5f287e5769263dca1
https://doi.org/10.1007/s10623-018-0502-5
https://doi.org/10.1007/s10623-018-0502-5
Publikováno v:
50 Years of Combinatorics, Graph Theory, and Computing ISBN: 9780429280092
50 Years of Combinatorics, Graph Theory, and Computing
50 Years of Combinatorics, Graph Theory, and Computing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13c7608db248f47e13ad0209d36e307f
https://doi.org/10.1201/9780429280092-16
https://doi.org/10.1201/9780429280092-16
Publikováno v:
Mathematical Aspects of Computer and Information Sciences ISBN: 9783319724522
MACIS
MACIS
It was proved recently by Jungnickel and Tonchev (2017) that for every integer \(v=3^{m-1}w\), \(m\ge 2\), and \(w\equiv 1,3 \pmod 6\), there is a ternary linear \([v,v-m]\) code C, such that every Steiner triple system \({{\mathrm{STS}}}(v)\) on v p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e005193adac07f2a33893256f5414517
https://doi.org/10.1007/978-3-319-72453-9_24
https://doi.org/10.1007/978-3-319-72453-9_24
Autor:
Emre Kolotoğlu, Spyros S. Magliveras
Publikováno v:
Discrete Mathematics. 313:2247-2252
In 1850, Cayley (1850) [4] proved by a brief argument that a large set of Fano planes does not exist. In 1978, Magliveras conjectured that a large set of projective planes of order n will exist for all n ≥ 3 , provided that n is the order of a proj
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b6b8035e920a36d13ae26e216a3a546
https://doi.org/10.1016/j.disc.2013.06.002
https://doi.org/10.1016/j.disc.2013.06.002
Autor:
Emre Kolotoğlu, Spyros S. Magliveras
Publikováno v:
Journal of Combinatorial Designs. 22:495-505
A Steiner system is called a Steiner quintuple systems of order v. The smallest order for which the existence, or otherwise, of a Steiner quintuple system is unknown is 21. In this article, we prove that, if an S(4, 5, 21) exists, the order of its fu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0cbbaff0cdf3eb07a170a724aa8d1db0
https://doi.org/10.1002/jcd.21370
https://doi.org/10.1002/jcd.21370
Publikováno v:
Journal of Algebra Combinatorics Discrete Structures and Applications, Vol 3, Iss 3 (2016)
Let $V$ be an $n$-dimensional vector space over $\F_q$. By a {\textit {geometric}} $t$-$[q^n,k,\lambda]$ design we mean a collection $\mathcal{D}$ of $k$-dimensional subspaces of $V$, called blocks, such that every $t$-dimensional subspace $T$ of $V$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::98b7cc00c01ecfd67cdeba77a191b61b
https://doi.org/10.13069/jacodesmath.40139
https://doi.org/10.13069/jacodesmath.40139
Autor:
Michael Epstein, Spyros S. Magliveras
Publikováno v:
Journal of Algebra Combinatorics Discrete Structures and Applications, Vol 3, Iss 3 (2016)
A finite cover $\mathcal{C}$ of a group $G$ is a finite collection of proper subgroups of $G$ such that $G$ is equal to the union of all of the members of $\mathcal{C}$. Such a cover is called {\em minimal} if it has the smallest cardinality among al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f6754e9a593d2badc07c27cacabd7f50
http://dergipark.ulakbim.gov.tr/jacodesmath/article/view/5000198238
http://dergipark.ulakbim.gov.tr/jacodesmath/article/view/5000198238
Autor:
Spyros S. Magliveras, Cafer Caliskan
Publikováno v:
Journal of Geometry. 97:17-27
We determine orbit representatives of all proper subplanes generated by quadrangles of a Veblen-Wedderburn (VW) plane Π of order 112 and the Hughes plane Σ of order 112 under their full collineation groups. In Π, there are 13 orbits of Baer subpla
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32789afbb955c643e1d49231e2a486a9
https://doi.org/10.1007/s00022-010-0039-x
https://doi.org/10.1007/s00022-010-0039-x
Publikováno v:
Journal of Cryptology. 24:148-156
At CRYPTO ’94, Tillich and Zemor proposed a family of hash functions, based on computing a suitable matrix product in groups of the form $SL_{2}(\mathbb{F}_{2^{n}})$. We show how to construct collisions between palindromic bit strings of length 2n+
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::134a716eb4ae6f4f558889f21bbb4dab
https://doi.org/10.1007/s00145-010-9063-0
https://doi.org/10.1007/s00145-010-9063-0