一类Z-矩阵的置换结构

利用图论方法并结合Z－矩阵的本身特点，讨论了对角元全为零的Z－矩阵的伴随有向图性质，并由给出了对角元全为零的非奇异Z－矩阵的置换结构。     

The Number of Permutation Polynomials of a Given Degree Over a Finite Field

We relate the number of permutation polynomials in F_q[x] of degree d≤q−2 to the solutions (x₁,x₂,…,x_q) of a system of linear equations over F_q, with the added restriction that x_i≠0 and x_i≠x_j whenever i≠j. Using this we find an expression for the number of permutation polynomials of degree p−2 in F_p[x] in terms of the permanent of a Vandermonde matrix whose entries are the primitive pth roots of unity. This leads to nontrivial bounds for the number of such permutation polynomials. We provide numerical examples to illustrate our method and indicate how our results can be generalised to polynomials of other degrees.     

置换矩阵的组合合成及其图表示

考察了有向圈或圈并的r级合成图,分别确定了它们的所有圈长和圈数;用图论方法完全刻画了置换矩阵的组合合成。     

On the Movement of Transitive Permutation p-Groups

Let G be a transitive permutation group on a set and m a positive integer. If | – | m for every subset of and all g G, then || 2mp/(p – 1) where p is the least odd prime dividing |G|. It was shown by Mann and Praeger [13] that, for p = 3, the 3-groups G which attain this bound have exponent p. In this paper we will show a generalization of this result for any odd primes.AMS Subject Classification (2000), 20BXX     

On the Toughness of Cycle Permutation Graphs

Motivated by the conjectures in [11], we introduce the maximal chains of a cycle permutation graph, and we use the properties of maximal chains to establish the upper bounds for the toughness of cycle permutation graphs. Our results confirm two conjectures in [11].     

On Subordination Chains with Normalization Given by a Time-dependent Linear Operator

In this paper we are concerned with solutions, in particular with univalent solutions, of the Loewner differential equation associated with non-normalized subordination chains on the Euclidean unit ball B ⁿ in \mathbbCⁿ{\mathbb{C}^n}. The main result is a generalization to higher dimensions of a well known result due to Becker. Various particular cases of this result have been recently obtained for subordination chains with normalization Df(0,t)=e^tI_n{Df(0,t)=e^tI_n} or Df(0, t) = e ^tA , t ≥ 0, where A ? L(\mathbbCⁿ,\mathbbCⁿ){A\in L(\mathbb{C}^n,\mathbb{C}^n)}. We also determine the form of the standard solutions to the Loewner differential equation associated with generalized spirallike mappings. In the last section we obtain the form of the solution in the presence of coefficient bounds.     

Enumeration of Decomposable Combinatorial Structures with Restricted Patterns

Decomposable combinatorial structures are studied with restricted patterns. We focus on the decomposable structures in the exp-log class. Using the method of analysis of singularities introduced by Flajolet and Odlyzko [5], we provide an estimate for the probability that a decomposable structure of size n has a given restricted pattern. We exemplify with several decomposable structures like permutations and polynomials over finite fields.      

由给定的子空间构造新的子空间

本给出并证明了若干个子空间的并以及两个子空间的基构成子空间的充要条件，从而本质地揭示了除子空间的交与和是构造新的予空间的方法外，集合的其它运算不能构造新的子空间，最后分析了子空间直和的两种不同定义的优缺点，指出了张禾瑞教材中子空间直和定义推广时应注意的一个问题。     

On the Dimension of Coinvariants of Permutation Representations

Let be a univariate, separable polynomial of degree n with roots x ₁,…,x _n in some algebraic closure of the ground field . It is a classical problem of Galois theory to find all the relations between the roots. It is known that the ideal of all such relations is generated by polynomials arising from G-invariant polynomials, where G is the Galois group of f(Z). Namely: The action of G on the ordered set of roots induces an action on by permutation of the coordinates and each defines a relation P − P(x ₁,…,x _n ) called a G-invariant relation. These generate the ideal of all relations. In this note we show that the ideal of relations admits an H-basis of G-invariant relations if and only if the algebra of coinvariants has dimension ‖G‖ over . To complete the picture we then show that the coinvariant algebra of a transitive permutation representation of a finite group G has dimension ‖G‖ if and only if G = Σ _n acting via the tautological permutation representation.     

On Some Properties of Permutation Tableaux

We consider the relations between various permutation statistics and properties of permutation tableaux. We answer some of the open problems of Steingrímsson and Williams [8], in particular, on the distribution of the bistatistic of numbers of rows and essential ones in permutation tableaux. We also consider and enumerate sets of permutation tableaux related to some pattern restrictions on permutations. Research supported in part by the NSA Young Investigator Grant H98230-06-1-0037.     

On a Combinatorial Framework for Fault Characterization

Covering arrays have been widely used to detect the presence of faults in large software and hardware systems. Indeed, finding failures that result from faulty interactions requires that all interactions that may cause faults be covered by a test case. However, finding the actual faults requires more, because the failures resulting from two potential sets of faults must not be the same. The combinatorial requirements on test suites to enable a tester to locate the faults are developed, and set in the context of similar combinatorial search questions. Test suites known as locating and detecting arrays to locate faults both in principle and in practice generalize covering arrays, thereby addressing combinatorial fault characterization. In common with covering arrays, these locating and detecting arrays scale logarithmically in size with the number of factors, but unlike covering arrays they support complete characterization of the interactions that underlie faults.     

On Permutation Groups of Degree a Product of Two Prime-Powers

We determine finite simple groups which have a subgroup of index with exactly two distinct prime divisors. Then from this we derive a classification of primitive permutation groups of degree a product of two prime-powers.     

On Finite Groups with a Given Number of Centralizers

For a finite group G, let Cent(G) denote the set of centralizers of single elements of G and #Cent(G) = |Cent(G)|. G is called an n-centralizer group if #Cent(G) = n, and a primitive n-centralizer group if #Cent(G) = #Cent(G/Z(G)) = n. In this paper, we compute #Cent(G) for some finite groups G and prove that, for any positive integer n 2, 3, there exists a finite group G with #Cent(G) = n, which is a question raised by Belcastro and Sherman [2]. We investigate the structure of finite groups G with #Cent(G) = 6 and prove that, if G is a primitive 6-centralizer group, then G/Z(G) A₄, the alternating group on four letters. Also, we prove that, if G/Z(G) A₄, then #Cent(G) = 6 or 8, and construct a group G with G/Z(G) A₄ and #Cent(G) = 8.This research was in part supported by a grant from IPM.2000 Mathematics Subject Classification: 20D99, 20E07     

On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer

If m(n, l) denotes the maximum number of subsets of an n-element set such that the intersection of any two of them has cardinality divisible by l, then a trivial construction shows that

$m(n,l)\ge 2^{[n/l]}$

For l= 2, this was known to be essentially best possible. For l ? 3, we show by construction that m(n, l)2^?[n/l] grows exponentially in n, and we provide upper bounds.     

On Efficient Solutions with Trade-Offs Bounded by Given Values

In this article, efficient solutions of multiple objective optimization problems with trade-offs, bounded by prespecified lower and upper bounds, are investigated. It is shown that one of the existing techniques to obtain these solutions does not work correctly. Furthermore, a new approach is given to approximate the set of such solutions. In addition to theoretical discussions, some clarifying examples are given.     

On the Diffraction by Biperiodic Anisotropic Structures

This article studies the scattering of electromagnetic waves by a nonmagnetic biperiodic structure. The structure consists of anisotropic optical materials and separates two regions with constant dielectric coefficients. The time harmonic Maxwell equations are transformed to an equivalent strongly elliptic variational problem for the magnetic field in a bounded biperiodic cell with nonlocal boundary conditions. This guarantees the existence of quasiperiodic magnetic fields in H 1 and electric fields in H (curl) solving Maxwell's equations. The uniqueness is proved for all frequencies excluding possibly a discrete set. The analytic dependence of these solutions on frequency and incident angles is studied.     

On Combinatorial Properties of the Knapsack Problem

Computational Mathematics and Mathematical Physics - The knapsack problem with Boolean variables and a single constraint is studied. In the general case, this problem is NP-hard; for this reason,...     

On the Congruences of Some Combinatorial Numbers

In this paper, we apply Lucas' theorem to evaluate the congruences of several combinatorial numbers, including the central Delannoy numbers and a class of Apéry-like numbers, the numbers of noncrossing connected graphs, the numbers of total edges of all noncrossing connected graphs on n vertices, etc. One of these results verifies a conjecture given by Deutsch and Sagan recently. In the end, we use an automaton to explain the idea of our approach.