On Certain Schur Rings of Dimension 4

In this paper, we consider Schur rings on a finite group G of ordern(n-1) suchthat G has a partition with . Then Gis characterized as follows. (a) G has subgroups E andH of order n andn-1 respectively, and , or(b)G has subgroupsK andH( K) of order 2(n-1) and n-1 respectively,and . In addition assume that G has a subsetR of sizen-1 satisfying in the groupalgebraC[G]. Then G is characterized as a collineation groupof a projective plane of order n such that G has five orbits ofpoints of lengthsn(n-1), n, n-1, 1 and 1. In particular, we characterize projective planesof ordern admitting a quasiregular collineation group of order n(n-1)as the case that E and H are normal subgroups ofG.     

The Maximum Size Of Graphs With A Unique<Emphasis Type="Italic">k</Emphasis>- Factor

For suitable positive integers n and k let m(n, k) denote the maximum number of edges in a graph of order n which has a unique k-factor. In 1964, Hetyei and in 1984, Hendry proved for even n and , respectively. Recently, Johann confirmed the following conjectures of Hendry: for and kn even and for n = 2kq, where q is a positive integer. In this paper we prove for and kn even, and we determine m(n, 3).     

Sums of Five, Seven and Nine Squares

Let r _k(n) denote the number of representations of an integer n as a sum of k squares. We prove that

Matching Polynomials And Duality

Let G be a simple graph on n vertices. An r-matching in G is a set of r independent edges. The number of r-matchings in G will be denoted by p(G, r). We set p(G, 0) = 1 and define the matching polynomial of G by and the signless matching polynomial of G by .It is classical that the matching polynomials of a graph G determine the matching polynomials of its complement . We make this statement more explicit by proving new duality theorems by the generating function method for set functions. In particular, we show that the matching functions and are, up to a sign, real Fourier transforms of each other.Moreover, we generalize Foatas combinatorial proof of the Mehler formula for Hermite polynomials to matching polynomials. This provides a new short proof of the classical fact that all zeros of µ(G, x) are real. The same statement is also proved for a common generalization of the matching polynomial and the rook polynomial.     

A Representation of the Lorentz Spin Group and Its Application

For an integer m ≥ 4, we define a set of 2[m/2] × 2[m/2] matrices γj （m）, （j = 0, 1,..., m - 1） which satisfy γj （m）γk （m） ＋γk （m）γj （m） = 2ηjk （m）I[m/2], where （ηjk （m）） 0≤j,k≤m-1 is a diagonal matrix, the first diagonal element of which is 1 and the others are -1, I[m/2] is a 2[m/1] × 2[m/2] identity matrix with [m/2] being the integer part of m/2. For m = 4 and 5, the representation （m） of the Lorentz Spin group is known. For m≥ 6, we prove that （i） when m = 2n, （n ≥ 3）, （m） is the group generated by the set of matrices {T｜T=1/√ξ（（I＋k） 0 ＋ 0 I-K） （ U 0 0 U）, （ii） when m = 2n ＋ 1 （n≥ 3）, （m） is generated by the set of matrices {T｜T=1/√ξ（I -k^- k I）U,U∈ （m-1）,ξ=1-m-2 ∑k,j=0 ηkja^k a^j〉0, K=i[m-3 ∑j=0 a^j γj（m-2）＋a^（m-2） In],K^-=i[m-3∑j=0 a^j γj（m-2）-a^（m-2） In]}     

The Weight Distribution of C 5(1, n)

In [2] the codes C _q (r,n) over were introduced. These linear codes have parameters , can be viewed as analogues of the binary Reed-Muller codes and share several features in common with them. In [2], the weight distribution of C ₃(1,n) is completely determined.In this paper we compute the weight distribution of C ₅(1,n). To this end we transform a sum of a product of two binomial coefficients into an expression involving only exponentials an Lucas numbers. We prove an effective result on the set of Lucas numbers which are powers of two to arrive to the complete determination of the weight distribution of C ₅(1,n). The final result is stated as Theorem 2.     

The polynomial degree of the Grassmannian G(1,n,q) of lines in finite projective space PG(n, q)

Let G: = G(1,n,q) denote the Grassmannian of lines in PG(n,q), embedded as a point-set in PG(N, q) with For n = 2 or 3 the characteristic function of the complement of G is contained in the linear code generated by characteristic functions of complements of n-flats in PG(N, q). In this paper we prove this to be true for all cases (n, q) with q = 2 and we conjecture this to be true for all remaining cases (n, q). We show that the exact polynomial degree of is for δ: = δ(n, q) = 0 or 1, and that the possibility δ = 1 is ruled out if the above conjecture is true. The result deg( for the binary cases (n,2) can be used to construct quantum codes by intersecting G with subspaces of dimension at least      

Degenerate Principal Series Representations of U(p, q) and Spin0(p, q)

Let p>q and let G be the group U(p, q) or Spin₀(p, q). Let P=LN be the maximal parabolic subgroup of G with Levi subgroup where

A Limit Result for U-Statistics of Binary Variables

Define , where is a symmetric U-type statistic, H _k() is the Hermite polynomial of degree k, and {X, X _n, n1} are independent identically distributed binary random variables with Pr(X{–1, 1}})=1. We show that according as EX=0 or EX0, respectively.     

Free Subgroups in Certain Generalized Triangle Groups of Type (2, m, 2)

A generalized triangle group is a group that can be presented in the form where p,q,r ≥ 2 and w(x,y) is a cyclically reduced word of length at least 2 in the free product . Rosenberger has conjectured that every generalized triangle group G satisfies the Tits alternative. It is known that the conjecture holds except possibly when the triple (p,q,r) is one of (3, 3, 2), (3, 4, 2), (3, 5, 2), or (2, m, 2) where m=3, 4, 5, 6, 10, 12, 15 , 20, 30, 60. In this paper, we show that the Tits alternative holds in the cases (p,q,r)=(2, m, 2) where m=6, 10, 12, 15, 20, 30, 60.     

Eigenvalues of the adjacency matrix of tetrahedral graphs

A tetrahedral graph is defined to be a graphG, whose vertices are identified with the unordered triplets onn symbols, such that vertices are adjacent if and only if the corresponding triplets have two symbols in common. Ifn ₂ (x) denotes the number of verticesy, which are at distance 2 fromx andA(G) denotes the adjacency matrix ofG, thenG has the following properties: P₁) the number of vertices is . P₂)G is connected and regular. P₃)n ₂ (x) = 3/2(n–3)(n–4) for allx inG. P₄) the distinct eigenvalues ofA(G) are –3, 2n–9,n–7, 3(n–3). We show that, ifn > 16, then any graphG (with no loops and multiple edges) having the properties P₁)–P₄) must be a tetrahedral graph. An alternative characterization of tetrahedral graphs has been given by the authors in [1].This research was supported by the National Science Foundation Grant No. GP-5790, and the Army Research Office (Durham) Grant No. DA-ARO-D-31-12-G910. (Institute of Statistics Mimeo Series No. 571, March 1968.)     

Equations arising from Jordan *-derivation pairs

Summary. We study certain functional equations derived from the definition of a Jordan *-derivation pair. More precisely, if A is a complex *-algebra and M is a bimodule over A, having the structure of a complex vector space compatible with the structure of A, such that implies m = 0 and implies m = 0 and if are unknown additive mappings satisfying then E and F can be represented by double centralizers. The obtained result implies that one of the equations in the definition of a Jordan *-derivation pair is redundant. Furthermore, a remark on the extension of this result to unknown additive mappings such that is given in a special case.     

On the Upper Bounds of the Numbers of Perfect Matchings in Graphs with Given Parameters

Let φ(G),κ(G),α(G),χ(G),cl(G),diam(G)denote the number of perfect matchings,connectivity,independence number,chromatic number,clique number and diameter of a graph G,respectively.In this note,by constructing some extremal graphs,the following extremal problems are solved:1.max{φ(G):|V(G)|=2n,κ(G)≤k}=k[(2n-3)!!],2.max{φ(G):|V(G)|=2n,α(G)≥k}=[multiply from i=0 to k-1(2n-k-i)[(2n-2k-1)!!],3.max{φ(G):|V(G)|=2n,χ(G)≤k}=φ(T_(k,2n))T_(k,2n)is the Turán graph,that is a complete k-partite graphon 2n vertices in which all parts are as equal in size as possible,4.max{φ(G):|V(G)|=2n,cl(G)=2}=n1,5.max{φ(G):|V(G)|=2n,diam(G)≥2}=(2n-2)(2n-3)[(2n-5)!!],max{φ(G):|V(G)|=2n,diam(G)≥3}=(n-1)~2[(2n-5)!!].     

A characterization ofL n (q) by the normalizers' orders of their sylow subgroups

LetG be a finite group. If for every primer, whereR ₁ Syl _r G andR ₂ Syl _r (L _n (q)), thenG L _n (q).     

On the set visited once by a random walk

Summary In this paper we prove the following statement. Given a random walk ,n=1, 2, ... where ₁, ₂ ... are i.i.d. random variables, let (n) denote the number of points visited exactly once by this random walk up to timen. We show that there exists some constantC, 0 <C < , such that with probability 1. The proof applies some arguments analogous to the techniques of the large deviation theory.Research supported by the Hungarian National Foundation for Scientific Research, Grant N^o # 819/1     

A representation theorem for weak automorphisms of a universal algebra

Given a group G and a descending chainG ₀,G ₁,...,G _n, of normal subgroups ofG, we prove that there exists a universal algebra , such that the chain ...W_n( )...W₁( }) W₀( )W( ) is isomorphic to the chain ...G _n ...G ₁G ₀G, where W( ) is the group of weak automorphisms of , and W_n( ) is the group of weak automorphisms of that leaves alln-ary operations fixed.We also prove that there are an infinite number of non-isomorphic algebras that satisfy the above.These results are a generalization of those proved by J. Sichler, in the special case when G=G₀, and G₁=G₂=...=G_n=....Presented by J. Mycielski.This paper comprises part of the author's doctoral dissertation at the University of Notre Dame in 1983. The author wishes to express her deep gratitude to Professor Abraham Goetz for suggesting this problem, for being extremely generous with his time and experience, and for giving her his constant encouragement. The author also thanks the reviewer for his helpful comments.     

Diameter of the set of midpoints of chords of a bounded closed set

The estimate is obtained for the diameter d(S_n(a)) of the set S_n(a) of midpoints of chords of length ≥a(0n, namely $$d(S_n (a)) \leqslant \left\{ \begin{gathered} 1 - a^2 /2, n = 2, \hfill \\ \sqrt {1 - a^2 /2,} n \geqslant 3, \hfill \\ \end{gathered} \right.$$ and it is shown that the inequality cannot be improved.     

Sharp Constants in Inequalities for Intermediate Derivatives (the Gabushin Case)

We solve Tikhomirov's problem on the explicit computation of sharp constants in the Kolmogorov type inequalities

Incidence Structures of Type (p, n)

Every incidence structure (understood as a triple of sets (G, M, I), I G×M) admits for every positive integer p an incidence structure where G ^p (M ^p) consists of all independent p-element subsets in G (M) and I ^p is determined by some bijections. In the paper such incidence structures are investigated the 's of which have their incidence graphs of the simple join form. Some concrete illustrations are included with small sets G and M.