-
1تقرير
المؤلفون: Kwiatkowski, Mariusz, Matraś, Andrzej, Pankov, Mark, Tyc, Adam
مصطلحات موضوعية: Mathematics - Combinatorics
الوصف: We consider the induced subgraph of the corresponding Grassmann graph formed by $q$-ary simplex codes of dimension $2$, $q\ge 5$. This graph contains precisely two types of maximal cliques. If $q=5$, then for any two maximal cliques of the same type there is a monomial linear automorphism transferring one of them to the other. Examples concerning the cases $q=7,11$ finish the note.
الوصول الحر: http://arxiv.org/abs/2402.05848Test
-
2تقرير
المؤلفون: Kwiatkowski, Mariusz, Pankov, Mark
مصطلحات موضوعية: Mathematics - Combinatorics
الوصف: The induced subgraph of the corresponding Grassmann graph formed by simplex codes is considered. We show that this graph, as the Grassmann graph, contains two types of maximal cliques. For any two cliques of the first type there is a monomial linear automorphism transferring one of them to the other. Cliques of the second type are more complicated and can contain different numbers of elements.
الوصول الحر: http://arxiv.org/abs/2308.06109Test
-
3
المؤلفون: Bazuń, Dorota (Red.), Bitkova, Tatiana, Bretschneider, Uta, Burešova, Karolína, Bąbka, Jarosław, Dogan, Duygu, Dubrow, Joshua Kjerulf, Friedreich, Sönke, Frątczak-Müller, Joanna, Gheondea-Eladi, Alexandra, Hermaszewski, Jarosław, Kasikova, Hana, Kleinmann, Sarah, Kołodziej, Tomasz, Kwiatkowski, Mariusz (Red.), Lisowski, Krzysztof, Merkulova, Tamara, Mielczarek-Żejmo, Anna, Nyćkowiak, Justyna, Pavlov, Ivan, Sarnowska, Justyna, Serrano Díaz, Noemí, Sokuryanska, Ludmyla, Spieker, Ira, Szaban, Dorota, Valenta, Josef, Vincejova, Eva, Zielińska, Maria
-
4
المؤلفون: Bazuń, Dorota (Red.), Bielecka-Prus, Joanna, Bochno, Ewa, Bochno, Ireneusz, Frątczak-Müller, Joanna, Gheondea-Eladi, Alexandra, Hajda, Agata, Hermaszewski, Jarosław, Kwiatkowski, Mariusz (Red.), Marciniak, Mateusz, Małczyński, Piotr, Messerschmidt, Nadia, Narkiewicz-Niedbalec, Ewa, Pławiak-Mowna, Anna, Zielińska, Maria
-
5
المؤلفون: Bazuń, Dorota, Chałubiński, Mirosław, Frątczak-Müller, Joanna (Red.), Janicka, Krystyna, Kaźmierczak-Kałużna, Izabela, Koniusz, Janusz, Kwiatkowski, Mariusz, Leszkowicz-Baczyńska, Żywia, Lisowski, Krzysztof, Mielczarek-Żejmo, Anna (Red.), Narkiewicz-Niedbalec, Ewa, Papiór, Elżbieta, Sakson, Andrzej, Szaban, Dorota, Szczegóła, Lech (Red.), Szczepański, Marek, Słomczyński, Kazimierz, Trzop, Beata, Wachowiak, Anna, Wojnicki, Jacek, Zielińska, Maria, Ślęzak-Tazbir, Weronika
-
6تقرير
المؤلفون: Cardinali, Ilaria, Giuzzi, Luca, Kwiatkowski, Mariusz
المصدر: Finite Fields Appl. 75 (2021) 101895
مصطلحات موضوعية: Mathematics - Combinatorics, Computer Science - Discrete Mathematics, 51E22, 94B27
الوصف: Let $\Gamma(n,k)$ be the Grassmann graph formed by the $k$-dimensional subspaces of a vector space of dimension $n$ over a field $\mathbb F$ and, for $t\in \mathbb{N}\setminus \{0\}$, let $\Delta_t(n,k)$ be the subgraph of $\Gamma(n,k)$ formed by the set of linear $[n,k]$-codes having minimum dual distance at least $t+1$. We show that if $|{\mathbb F}|\geq{n\choose t}$ then $\Delta_t(n,k)$ is connected and it is isometrically embedded in $\Gamma(n,k)$. This generalizes some results of [M. Kwiatkowski, M. Pankov, "On the distance between linear codes", Finite Fields Appl. 39 (2016), 251--263] and [M. Kwiatkowski, M. Pankov, A. Pasini, "The graphs of projective codes" Finite Fields Appl. 54 (2018), 15--29].
Comment: 13 pages/final versionالوصول الحر: http://arxiv.org/abs/2005.04402Test
-
7تقرير
المؤلفون: Kwiatkowski, Mariusz, Pankov, Mark
مصطلحات موضوعية: Mathematics - Combinatorics
الوصف: We give a complete description of the distance relation on the graph of $4$-ary simplex codes of dimension $2$. This is a connected graph of diameter $3$. For every vertex we determine the sets of all vertices at distance $i\in\{1,2,3\}$ and describe their symmetries.
الوصول الحر: http://arxiv.org/abs/1908.03703Test
-
8تقرير
المؤلفون: Kwiatkowski, Mariusz, Pankov, Mark, Tyc, Adam
مصطلحات موضوعية: Mathematics - Combinatorics
الوصف: We investigate zigzags in triangulations of connected closed $2$-dimensional surfaces and show that there is a one-to-one correspondence between triangulations with homogeneous zigzags and closed $2$-cell embeddings of directed Eulerian graphs in surfaces. A triangulation is called $z$-knotted if it has a single zigzag. We construct a family of tree structured $z$-knotted spherical triangulations whose zigzags are homogeneous.
الوصول الحر: http://arxiv.org/abs/1902.10788Test
-
9كتاب
مصطلحات موضوعية: Others in education
الوصف: This book draws on work undertaken by colleagues involved with the Erasmus+ project called SoMoveED, or Social Education on the Move. The broader aim of the project is to develop, implement, and disseminate innovation in the form of a model of mobile social education in higher education, of which this book makes up one small part.The project draws together institutions and organizations from ten European countries (Croatia, the Czech Republic, France, Italy, the Netherlands, Poland, Portugal, Romania, Turkey, and the United Kingdom), including eight universities, two non-governmental organizations and one social enterprise. Approximately 40 people are working on the project, including academic teachers and researchers, entrepreneurs, and social activists. The project’s main objective is to explore and develop ways in which the teaching process can be organized in motion, outside the university walls, with the participation of stakeholders from outside the academic community (citizens, representatives of institutions and organizations, activists, people at risk of marginalization). This model incorporates three important features into the educational process: (1) mobility; (2) participation; and (3) inclusion.
وصف الملف: application/pdf
العلاقة: https://clok.uclan.ac.uk/48078/1/SoMoveEd-Knowledge-on-the-move-ebook.pdfTest; Roy, Alastair Neil orcid iconorcid:0000-0002-4807-7352 , Tankut Gülhan, Sinan, Bazuń, Dorota and Kwiatkowski, Mariusz (2023) Knowledge on the Move: Studies on Mobile Social Education. Oficyna Naukowa, Warsaw. ISBN 978-83-67557-12-2
-
10تقرير
المؤلفون: Kwiatkowski, Mariusz, Pankov, Mark, Pasini, Antonio
مصطلحات موضوعية: Mathematics - Combinatorics, Mathematics - Algebraic Geometry
الوصف: Consider the Grassmann graph formed by $k$-dimensional subspaces of an $n$-dimensional vector space over the field of $q$ elements ($1
الوصول الحر: http://arxiv.org/abs/1712.10198Test
