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.     

Extension of Multiply Transitive Permutation Sets

Let G be a k-transitive permutation set on E and let E* = E∪{∞},∞ ? E; if G* is a (k: + 1)-transitive permutation set on E*, G* is said to be an extension of G whenever G _∝ ^* =G. In this work we deal with the problem of extending (sharply) k- transitive permutation sets into (sharply) (k + 1)-transitive permutation sets. In particular we give sufficient conditions for the extension of such sets; these conditions can be reduced to a unique one (which is a necessary condition too) whenever the considered set is a group. Furthermore we establish necessary and sufficient conditions for a sharply k- transitive permutation set (k ≥ 3) to be a group. Math. Subj. Class.: 20B20 Multiply finite transitive permutation groups 20B22 Multiply infinite transitive permutation groups     

Multiplicity-Free Products of Schur Functions

. We classify all multiplicity-free products of Schur functions and all multiplicity-free products of characters of SL(n, C).     

An Edge-Isoperimetric Problem for Powers of the Petersen Graph

In this paper we introduce a new order on the set of n-dimensional tuples and prove that this order preserves nestedness in the edge isoperimetric problem for the graph Pⁿ, defined as the nth cartesian power of the well-known Petersen graph. The cutwidth and wirelength of Pⁿ are also derived. These results are then generalized for the cartesian product of Pⁿ and the m-dimensional binary hypercube.     

The lattice of congruence lattices of algebras on a finite set

The congruence lattices of all algebras defined on a fixed finite set A ordered by inclusion form a finite atomistic lattice \(\mathcal {E}\). We describe the atoms and coatoms. Each meet-irreducible element of \(\mathcal {E}\) being determined by a single unary mapping on A, we characterize completely those which are determined by a permutation or by an acyclic mapping on the set A. Using these characterisations we deduce several properties of the lattice \(\mathcal {E}\); in particular, we prove that \(\mathcal {E}\) is tolerance-simple whenever \(|A|\ge 4\).     

The semigroup of singular endomorphisms

Let V be a vector space of dimension n over a field K. Here we denote by Sn the set of all singular endomorphisms of V. Erdos [5], Dawlings [4] and Thomas J. Laffey [6] have shown that Sn is an idempotent generated regular semigroup. In this paper we apply the theory of inductive groupoids, in particular the construction of the idempotent generated regular semigroup given in §6 of [8] to detemine some combinatorial properties of the semigroup Sn.     

Centralizers and Central Idempotents of Semigroup Rings

. Let A be a nonempty subset of an associative ring R . Call the subring CR(A)={r] R\mid ra=ar \quadfor all\quad a] A} of R the centralizer of A in R . Let S be a semigroup. Then the subsemigroup S'= {s] S\mid sa=sb \quador\quad as=bs \quadimplies\quad a=b \quadfor all a,b] S} of S is called the C -subsemigroup. In this paper, the centralizer CR[S](R[M]) for the semigroup ring R[S] will be described, where M is any nonempty subset of S' . An non-zero idempotent e is called the central idempotent of R[S] if e lies in the center of R[S] . Assume that S\backslash S' is a commutative ideal of S and Annl(R)=0 . Then we show that the supporting subsemigroup of any central idempotent of R[S] must be finite.     

Optimal estimates for lower and upper bounds of approximation errors in the p-version of the finite element method in two dimensions

Dedicated to Prof. O. Widlund on the occasion of his 60th birthday Correspondence to: B. Guo Summary. This paper will analyze the lower and upper error bounds of the finite element solution of the p-version for linear elliptic problems in polygonal domains. The optimal rate of convergence is rigorously proved based on the sharp estimates of lower and upper bounds of the approximation error.     

Non-nudgable subgroups of permutations

Motivated by a problem from behavioral economics, we study subgroups of permutation groups that have a certain strong symmetry. Given a fixed permutation, consider the set of all permutations with disjoint inversion sets. The group is called non-nudgable if the cardinality of this set always remains the same when replacing the initial permutation with its inverse. It is called nudgable otherwise. We show that all full permutation groups, standard dihedral groups, half of the alternating groups, and any abelian subgroup are non-nudgable. In the right probabilistic sense, it is thus quite likely that a randomly generated subgroup is non-nudgable. However, the other half of the alternating groups are nudgable. We also construct a smallest possible nudgable group, a 6-element subgroup of the permutation group on 4 elements.     

On the relational complexity of a finite permutation group

The relational complexity \(\rho (X,G)\) of a finite permutation group is the least k for which the group can be viewed as an automorphism group acting naturally on a homogeneous relational system whose relations are k-ary (an explicit permutation group theoretic version of this definition is also given). In the context of primitive permutation groups, the natural questions are (a) rough estimates, or (preferably) precise values for \(\rho \) in natural cases; and (b) a rough determination of the primitive permutation groups with \(\rho \) either very small (bounded) or very large (much larger than the logarithm of the degree). The rough version of (a) is relevant to (b). Our main result is an explicit characterization of the binary (\(\rho =2\)) primitive affine permutation groups. We also compute the precise relational complexity of \({{\mathrm{Alt}}}_n\) acting on k-sets, correcting (Cherlin in Sporadic homogeneous structures. In: The Gelfand Mathematical Seminars, 1996–1999, pp. 15–48, Birkhäuser 2000, Example 5).     

The Classification of Certain Four-Weight Spin Models

In this paper we show that if one of the matrices {Wi, 1 h i h 4} of a four-weight spin model (X, W1, W2, W3, W4; D) is equivalent to the matrix of a Potts model or a cyclic model as type II matrix and |X| S 5, then the spin model is gauge equivalent to a Potts model or a cyclic model up to simultaneous permutations on rows and columns. Using this fact and Nomura's result [12] we show that every four-weight spin model of size |X| = 5 is gauge equivalent to either a Potts model or a cyclic model up to simultaneous permutations on rows and columns.     

Monoids for Which Condition (P) Acts are Projective

A characterisation of monoids for which all right S-acts satisfying conditions (P) are projective is given. We also give a new characterisation of those monoids for which all cyclic right S-acts satisfying condition (P) are projective, similar in nature to recent work by Kilp [6]. In addition we give a sufficient condition for all right S-acts that satisfy condition (P) to be strongly flat and show that the indecomposable acts that satisfy condition (P) are the locally cyclic acts.     

Multiple positive solutions for a nonlinear Schr?dinger equation

We are interested in positive entire solutions of the nonlinear Schrödinger equation -Du+(la(x)+1)u = u^p-\Delta u+(\lambda a(x)+1)u = u^p where a ≤ 0 has a potential well and p > 1 is subcritical. Using variational methods we prove the existence of multiple positive solutions which localize near the potential well int(a^-1(0)) for l\lambda large.     

Invariant characters and coprime actions on finite nilpotent groups

Abstract. Let S be a subgroup of SLn(R), where R is a commutative ring with identity and n \geqq 3n \geqq 3. The order of S, o(S), is the R-ideal generated by x_ij, x_ii - x_jj (i 1 j)x_{ij},\ x_{ii} - x_{jj}\ (i \neq j), where (x_ij) ? S(x_{ij}) \in S. Let En(R) be the subgroup of SLn(R) generated by the elementary matrices. The level of S, l(S), is the largest R-ideal \frak q\frak {q} with the property that S contains all the \frak q\frak {q}-elementary matrices and all conjugates of these by elements of En(R). It is clear that l(S) \leqq o(S)l(S) \leqq o(S). Vaserstein has proved that, for all R and for all n \geqq 3n \geqq 3, the subgroup S is normalized by En(R) if and only if l(S) = o(S)     

Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees

. Leaf-labelled trees are widely used to describe evolutionary relationships, particularly in biology. In this setting, extant species label the leaves of the tree, while the internal vertices correspond to ancestral species. Various techniques exist for reconstructing these evolutionary trees from data, and an important problem is to determine how "far apart" two such reconstructed trees are from each other, or indeed from the true historical tree. To investigate this question requires tree metrics, and these can be induced by operations that rearrange trees locally. Here we investigate three such operations: nearest neighbour interchange (NNI), subtree prune and regraft (SPR), and tree bisection and reconnection (TBR). The SPR operation is of particular interest as it can be used to model biological processes such as horizontal gene transfer and recombination. We count the number of unrooted binary trees one SPR from any given unrooted binary tree, as well as providing new upper and lower bounds for the diameter of the adjacency graph of trees under SPR and TBR. We also show that the problem of computing the minimum number of TBR operations required to transform one tree to another can be reduced to a problem whose size is a function just of the distance between the trees (and not of the size of the two trees), and thereby establish that the problem is fixed-parameter tractable.     

L p Norms of Eigenfunctions in the Completely Integrable Case

The eigenfunctions e^iál,x? e^{i\langle\lambda,x\rangle} of the Laplacian on a flat torus have uniformly bounded L^p norms. In this article, we prove that for every other quantum integrable Laplacian, the L^p norms of the joint eigenfunctions blow up at least at the rate || j_k || L^p 3 C(e)l_k^{[(p-2)/(4p)]-e} \| \varphi_k \| L^{p} \geq C(\epsilon)\lambda_{k}^{{p-2\over4p}-\epsilon} when p > 2. This gives a quantitative refinement of our recent result [TZ1] that some sequence of eigenfunctions must blow up in L^p unless (M,g) is flat. The better result in this paper is based on mass estimates of eigenfunctions near singular leaves of the Liouville foliation.     

On the Resolution of the Heat Equation with Discontinuous Coefficients

We give in this work some results about the existence and uniqueness with optimal regularity for solutions of a parabolic equation in nondivergence form in L^q(0,T;L^p(Omega)) where 1 < p,q < infinity in two cases. We use Lamberton's results (cf. [9]) in the first case and Dore-Venni's results (cf. [6]) in the second case.     

Dense graphs and edge reconstruction

By a well-known result of Nash-Williams if a graphG is not edge reconstructible, then for all ,|A||E(G)| mod 2 we have a permutation ofV(G) such thatE(G)E(G)=A. Here we construct infinitely many graphsG having this curious property and more than edges.Research (partially) supported by Hungarian National Foundation for Scientific Research Grant No.T016389.     

Some remarks on permutation designs

A definition of isomorphism of two permutation designs is proposed, which differs from the definition in Bandt [J. Combinatorial Theory Ser. A21 (1976), 384–392]. The proposed definition has the (generally required) property that the allowed permutations always transform a permutation design into a permutation design. It is shown that the n permutation designs coming from the partitioning of S_n into permutation designs, as constructed in Bandt [J. Combinatorial Theory Ser. A21 (1976), 384–392] are all isomorphic. Further we find that this modified definition does not increase the number of nonisomorphic (6, 4) permutation designs. The same investigation showed that one of the designs, claimed to be a (6, 4) permutation design in [J. Combinatorial Theory Ser. A21 (1976), 384–392], is actually not a (6, 4) permutation design.     

On the reconstruction index of permutation groups: semiregular groups

Summary. The reconstruction index of all semiregular permutation groups is determined. We show that this index satisfies 3 ￡ r(G, W) ￡ 5 3 \leq \rho(G, \Omega) \leq 5 and we classify the groups in each case.