On Primitive Representations of Finite Alternating and Symmetric Groups with a 2-Transitive Subconstituent

In this paper we analyse primitive permutation representations of finite alternating and symmetric groups which have a 2-transitive subconstituent. We show that either the representation belongs to an explicit list of known examples, or the point stabiliser is a known almost-simple 2-transitive group and acts primitively in the natural representation of the associated alternating or symmetric group.     

On congruences of m-groups

We indicate a way for constructing m-congruences of an arbitrary m-transitive representation, introduce the notions of m-2-transitive and m-primitive representations, and describe the m-transitive primitive representations in terms of stabilizers. Also we give necessary and sufficient conditions for m-2-transitivity and study some properties of these representations.     

完全图分拆为带两条弦的6-长圈

In this paper, we discuss the G-decomposition of λKv into 6-circuits with two chords. We construct some holey G-designs using sharply 2-transitive group, and present the recursive structure by PBD. We also give a unified method to construct G-designs when the index equals the edge number of the discussed graph. Finally, the existence of G-GDλ（v） is given.     

6-Transitive graphs

A connected graph is n-transitive if, whenever two n-tuples are isometric, there is an automorphism mapping the first to the second. It is shown that a 6-transitive graph is complete multipartite, or complete bipartite with a matching deleted, or a cycle, or one of three special graphs on 9, 12 and 20 vertices. These graphs are n-transitive for all n; but there are graphs (the smallest on 56 vertices) which are 5- but not 6-transitive.     

Over the non-existence of sharply 3-transitive permutation sets containing sharply 2-transitive permutation subsets

The following results are proved: Let E be a finite set, ¦E¦>4, and let G be a sharply 3-transitive permutation set on E. Then G contains no subset which is a sharply 2-transitive permutation set on E (Theorem 1). In the case when G is a sharply 3-transitive permutation group which is also planar, the finiteness condition on E can be dropped (Theorem 2).Dedicated to G. Zappa on his 70th birthdayResearch done within the activity of GNSAGA of CNR, supported by the 40% grants of MPI.     

Each Invertible Sharply d-Transitive Finite Permutation Set with d ≥ 4 is a Group

All known finite sharply 4-transitive permutation sets containing the identity are groups, namely S ₄, S ₅, A ₆ and the Mathieu group of degree 11. We prove that a sharply 4-transitive permutation set on 11 elements containing the identity must necessarily be the Mathieu group of degree 11. The proof uses direct counting arguments. It is based on a combinatorial property of the involutions in the Mathieu group of degree 11 (which is established here) and on the uniqueness of the Minkowski planes of order 9 (which had been established before): the validity of both facts relies on computer calculations. A permutation set is said to be invertible if it contains the identity and if whenever it contains a permutation it also contains its inverse. In the geometric structure arising from an invertible permutation set at least one block-symmetry is an automorphism. The above result has the following consequences. i) A sharply 5-transitive permutation set on 12 elements containing the identity is necessarily the Mathieu group of degree 12. ii) There exists no sharply 6-transitive permutation set on 13 elements. For d 6 there exists no invertible sharply d-transitive permutation set on a finite set with at least d + 3 elements. iii) A finite invertible sharply d-transitive permutation set with d 4 is necessarily a group, that is either a symmetric group, an alternating group, the Mathieu group of degree 11 or the Mathieu group of degree 12.     

A Classification of Countable Lower 1-transitive Linear Orders

This paper contains a classification of countable lower 1-transitive linear orders. This is the first step in the classification of countable 1-transitive trees given in Chicot and Truss (2009): the notion of lower 1-transitivity generalises that of 1-transitivity for linear orders, and it is essential for the structure theory of 1-transitive trees. The classification is given in terms of coding trees, which describe how a linear order is fabricated from simpler pieces using concatenations, lexicographic products and other kinds of construction. We define coding trees and show that a coding tree can be constructed from a lower 1-transitive linear order \((X, \leqslant )\) by examining all the invariant partitions on X. Then we show that a lower 1-transitive linear order can be recovered from a coding tree up to isomorphism.     

On construction of vertex-transitive partitions of the <Emphasis Type="Italic">n</Emphasis>-cube into perfect codes

Two methods are presented to construct some vertex-transitive and 2-transitive partitions of the n-cube into perfect codes. Some lower bounds are given on the number of transitive, vertex-transitive, and 2-transitive partitions of the n-cube into perfect codes.     

Wreath products of the groups of monotone permutations

We introduce the concept of wreath product of the m-groups of permutations and prove that an m-transitive group of permutations with an m-congruence is embeddable into the wreath product of the suitable m-transitive m-groups of permutations. This implies that an arbitrary m-transitive group in the product of two varieties of m-groups embeds into the wreath product of the suitable m-transitive groups of these varieties.     

Arc-transitive distance-regular covers of cliques with <Emphasis Type="Italic">λ</Emphasis> = µ

We study antipodal distance-regular graphs of diameter 3 such that their automorphism group acts transitively on the set of pairs (a, b), where {a, b} is an edge of the graph. Since the automorphism group of such graphs acts 2-transitively on the set of antipodal classes, the classification of 2-transitive permutation groups can be used. We classify arc-transitive distance-regular graphs of diameter 3 in which any two vertices at distance at most two have exactly µ common neighbors.     

Primitive Limit Algebras and C-Envelopes

In this paper, we study irreducible representations of regular limit subalgebras of AF-algebras. The main result is twofold: every closed prime ideal of a limit of direct sums of nest algebras (NSAF) is primitive, and every prime regular limit algebra is primitive. A key step is that the quotient of an NSAF algebra by any closed ideal has an AF C^*-envelope, and this algebra is exhibited as a quotient of a concretely represented AF-algebra. When the ideal is prime, the C^*-envelope is primitive. The GNS construction is used to produce algebraically irreducible (in fact n-transitive for all n1) representations for quotients of NSAF algebras by closed prime ideals. Thus the closed prime ideals of NSAF algebras coincide with the primitive ideals. Moreover, these representations extend to *-representations of the C^*-envelope of the quotient, so that a fortiori these algebras are also operator primitive. The same holds true for arbitrary limit algebras and the {0} ideal.     

A ½-transitive graph of valency 4 with a nonsolvable group of automorphisms

A graph X is said to be ½-transitive if its automorphism group acts transively on the sets of its vertices and edges but intransitively on the set of its arcs. A construction of a ½-transitive graph of valency 4 and girth 6 with a nonsolvable group of automorphism is given. © 1997 John Wiley & Sons, Inc. J Graph Theory 25, 1: 133–138, 1997     

On 2-transitive 3-nets

A 3-net is said to be 2-transitive if it admits a group of direction-preserving automorphisms fixing one of the transversal lines and acting 2-transitively on its points. We classify the 2-transitive finite 3-nets which do not admit a proper 2-transitive 3-subnet, except, possibly, for a subnet of order 2. The result is then extended under a weaker assumption.To Prof. Walter Benz and Prof. Jakob Joussen on their 60^th birthdaywork done within the activity of GNSAGA of CNR and supported by the Italian Ministry for Research and Technology.     

The nonexistence of 8-transitive graphs

We prove that the inequalitys≦7 holds for finites-transitive graphs assuming that the list of known 2-transitive permutation groups is complete.     

A generalized Green's formula for elliptic problems in domains with edges

The usual Green's formula connected with the operator of a boundary-value problem fails when both of the solutions u and v that occur in it have singularities that are too strong at a conic point or at an edge on the boundary of the domain. We deduce a generalized Green's formula that acquires an additional bilinear form in u and v and is determined by the coefficients in the expansion of solutions near singularities of the boundary. We obtain improved asymptotic representations of solutions in a neighborhood of an edge of positive dimension, which together with the generalized Green's formula makes it possible, for example, to describe the infinite-dimensional kernel of the operator of an elliptic problem in a domain with edge. Bibliography: 14 titles. Translated fromProblemy Matematicheskogo Analiza, No. 13, 1992, pp. 106–147.     

Partial differential equations and finite-difference methods in image processing,part 1: Image representation

Stochastic representation of discrete images by partial differential equation operators is considered. It is shown that these representations can fit random images, with nonseparable, isotropic covariance functions, better than other common covariance models. Application of these models in image restoration, data compression, edge detection, image synthesis, etc., is possible.Different representations based on classification of partial differential equations are considered. Examples on different images show the advantages of using these representations. The previously introduced notion of fast Karhunen-Loeve transform is extended to images with nonseparable or nearly isotropic covariance functions, or both.     

On polynomial representations of strange Lie superalgebras of <Emphasis Type="Italic">Q</Emphasis>-type

In this paper, both canonical and noncanonical polynomial representations of Lie superalgebara of Q-type are investigated. It turns out that not all these representations are completely reducible. Moreover, the representation spaces has only two proper submodules when it is completely reducible, and has a unique composition series when it is not completely reducible.     

On Polynomial Representations of Strange Lie Superalgebras of Q-Type

In this paper,both canonical and noncanonical polynomial representations of Lie superalgebara of Q-type are investigated.It turns out that not all these representations are completely reducible.Moreover,the representation spaces has only two proper submodules when it is completely reducible,and has a unique composition series when it is not completely reducible.     

1-transitive cyclic orderings

We give a classification of all the countable 1-transitive cyclic orderings, being those on which the automorphism group acts singly transitively. We also classify all the countable 1-transitive coloured cyclic orderings, where these are countable cyclic orderings in which each point is assigned a member of a set C, thought of as its ‘colour’, and by ‘1-transitivity’ we now mean that the automorphism group acts singly transitively on each set of points coloured by a fixed colour. We conclude by giving constructions of some uncountable cyclic orderings whose automorphism groups enjoy certain special properties.