Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 10 / 19
First pagePrevious page12Next pageLast page
1.
2.
3.
4.
r-regular families of graph automorphisms
Robert Jajcay, Gareth A. Jones, 2019, original scientific article

Keywords: graph automorphism, permutation, vertex-transitive
Published in RUP: 30.07.2019; Views: 1030; Downloads: 232
URL Link to full text

5.
On derivatives of planar mappings and their connections to complete mappings
Amela Muratović-Ribić, Enes Pašalić, 2018, original scientific article

Abstract: Given are necessary conditions for a permutation polynomial to be the derivative of a planar mapping. These conditions are not sufficient and there might exist permutation polynomials which are not derivatives of some planar mapping satisfying these conditions. For the first time we show that there is a close connection between two seemingly unrelated structures, namely planar and complete mappings. It is shown that any planar mapping induces a sequence of complete mappings having some additional interesting properties. Furthermore, a class of almost planar mappings over extension fields is introduced having the property that its derivatives are permutations in most of the cases. This class of functions then induces many infinite classes of complete mappings (permutations) as well.
Keywords: planar mapping, derivatives, complete mappings, permutation polynomials
Published in RUP: 19.12.2018; Views: 2061; Downloads: 243
URL Link to full text

6.
Odd extensions of transitive groups via symmetric graphs - The cubic case
Klavdija Kutnar, Dragan Marušič, 2018, original scientific article

Abstract: When dealing with symmetry properties of mathematical objects, one of the fundamental questions is to determine their full automorphism group. In this paper this question is considered in the context of even/odd permutations dichotomy. More precisely: when is it that the existence of automorphisms acting as even permutations on the vertex set of a graph, called even automorphisms, forces the existence of automorphisms that act as odd permutations, called odd automorphisms. As a first step towards resolving the above question, complete information on the existence of odd automorphisms in cubic symmetric graphs is given.
Keywords: automorphism group, arc-transitive, even permutation, odd permutation, cubic symmetric graph
Published in RUP: 19.11.2018; Views: 1975; Downloads: 198
URL Link to full text

7.
Imprimitive permutations in primitive groups
Joao Araújo, J. P. Araújo, Peter J. Cameron, Edward Dobson, A. Hulpke, P. Lopes, 2017, original scientific article

Keywords: primitive groups, imprimitive groups, GAP, permutation type
Published in RUP: 21.02.2018; Views: 2864; Downloads: 251
URL Link to full text
This document has more files! More...

8.
Odd automorphisms in vertex-transitive graphs
Ademir Hujdurović, Klavdija Kutnar, Dragan Marušič, 2016, original scientific article

Abstract: An automorphism of a graph is said to be even/odd if it acts on the set of vertices as an even/odd permutation. In this article we pose the problem of determining which vertex-transitive graphs admit odd automorphisms. Partial results for certain classes of vertex-transitive graphs, in particular for Cayley graphs, are given. As a consequence, a characterization of arc-transitive circulants without odd automorphisms is obtained.
Keywords: graph, vertex-transitive, automorphism group, even permutation, odd permutation
Published in RUP: 15.11.2017; Views: 2154; Downloads: 100
.pdf Full text (281,25 KB)

9.
10.
Minimal normal subgroups of transitive permutation groups of square-free degree
Edward Dobson, Aleksander Malnič, Dragan Marušič, Lewis A. Nowitz, 2007, original scientific article

Abstract: It is shown that a minimal normal subgroup of a transitive permutation group of square-free degree in its induced action is simple and quasiprimitive, with three exceptions related to ▫$A_5$▫, ▫$A_7$▫, and PSL(2,29). Moreover, it is shown that a minimal normal subgroup of a 2-closed permutation group of square-free degree in its induced action is simple. As an almost immediate consequence, it follows that a 2-closed transitive permutation group of square-free degree contains a semiregular element of prime order, thus giving a partial affirmative answer to the conjecture that all 2-closed transitive permutation groups contain such an element (see [D. Marušic, On vertex symmetric digraphs,Discrete Math. 36 (1981) 69-81; P.J. Cameron (Ed.), Problems from the fifteenth British combinatorial conference, Discrete Math. 167/168 (1997) 605-615]).
Keywords: mathematics, graph theory, transitive permutation group, 2-closed group, square-free degree, semiregular automorphism, vertex-transitive graph
Published in RUP: 03.04.2017; Views: 2320; Downloads: 89
URL Link to full text

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica