On symplectic polar spaces over non-perfect fields of characteristic 2

Given a field 𝕂 of characteristic 2 and an integer n ≥ 2, let W(2n ? 1, 𝕂) be the symplectic polar space defined in PG(2n ? 1, 𝕂) by a non-degenerate alternating form of V(2n, 𝕂) and let Q(2n, 𝕂) be the quadric of PG(2n, 𝕂) associated to a non-singular quadratic form of Witt index n. In the literature it is often claimed that W(2n ? 1, 𝕂) ? Q(2n, 𝕂). This is true when 𝕂 is perfect, but false otherwise. In this article, we modify the previous claim in order to obtain a statement that is correct for any field of characteristic 2. Explicitly, we prove that W(2n ? 1, 𝕂) is indeed isomorphic to a non-singular quadric Q, but when 𝕂 is non-perfect the nucleus of Q has vector dimension greater than 1. So, in this case, Q(2n, 𝕂) is a proper subgeometry of W(2n ? 1, 𝕂). We show that, in spite of this fact, W(2n ? 1, 𝕂) can be embedded in Q(2n, 𝕂) as a subgeometry and that this embedding induces a full embedding of the dual DW(2n ? 1, 𝕂) of W(2n ? 1, 𝕂) into the dual DQ(2n, 𝕂) of Q(2n, 𝕂).     

Cohen–Macaulayness and Limit Behavior of Depth for Powers of Cover Ideals

Let 𝕂 be a field, and let R = 𝕂[x ₁,…, x _n ] be the polynomial ring over 𝕂 in n indeterminates x ₁,…, x _n . Let G be a graph with vertex-set {x ₁,…, x _n }, and let J be the cover ideal of G in R. For a given positive integer k, we denote the kth symbolic power and the kth bracket power of J by J ^(k) and J ^[k], respectively. In this paper, we give necessary and sufficient conditions for R/J ^k , R/J ^(k), and R/J ^[k] to be Cohen–Macaulay. We also study the limit behavior of the depths of these rings.     

Reflection sieve obstructions in finite groups of type dn

In [4] we constructed certain homology representations of a finite group G of type A_n, B_n or C_n, and showed that these representations can be used to sift out the reflection compound characters of G. In the present note, we show that for a group G of type D_n, each reflection compound character π^(k), 2 k n − 2, determines a unique “obstruction” character θ^(k), which occurs with positive multiplicity in every homology representation containing π^(k).     

Reductivity of the Lie Algebra of a Bilinear Form

Let f: V × V → F be a totally arbitrary bilinear form defined on a finite dimensional vector space V over a field F, and let L(f) be the subalgebra of 𝔤𝔩(V) of all skew-adjoint endomorphisms relative to f. Provided F is algebraically closed of characteristic not 2, we determine all f, up to equivalence, such that L(f) is reductive. As a consequence, we find, over an arbitrary field, necessary and sufficient conditions for L(f) to be simple, semisimple or isomorphic to 𝔰𝔩(n) for some n.     

On the L convergence of Lagrange interpolating entire functions of exponential type

Let f: be a continuous, 2π-periodic function and for each n ε let t_n(f; ·) denote the trigonometric polynomial of degree n interpolating f in the points 2kπ/(2n + 1) (k = 0, ±1, …, ±n). It was shown by J. Marcinkiewicz that lim_{n → ∞} ∝₀^2π¦f(θ) − t_n(f θ)¦^p dθ = 0 for every p > 0. We consider Lagrange interpolation of non-periodic functions by entire functions of exponential type τ > 0 in the points kπ/τ (k = 0, ± 1, ± 2, …) and obtain a result analogous to that of Marcinkiewicz.     

Graphs with unavoidable subgraphs with large degrees

Let ??(n, m) denote the class of simple graphs on n vertices and m edges and let G ∈ ?? (n, m). There are many results in graph theory giving conditions under which G contains certain types of subgraphs, such as cycles of given lengths, complete graphs, etc. For example, Turan's theorem gives a sufficient condition for G to contain a K_{k + 1} in terms of the number of edges in G. In this paper we prove that, for m = αn², α > (k - 1)/2k, G contains a K_{k + 1}, each vertex of which has degree at least f(α)n and determine the best possible f(α). For m = ?n²/4? + 1 we establish that G contains cycles whose vertices have certain minimum degrees. Further, for m = αn², α > 0 we establish that G contains a subgraph H with δ(H) ≥ f(α, n) and determine the best possible value of f(α, n).     

Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time

For a given undirected graphG = (V, E, c_G) with edges weighted by nonnegative realsc_G:E → R ⁺ , let Λ_G(k) stand for the minimum amount of weights which needs to be added to makeG k-edge-connected, and letG*(k) be the resulting graph obtained fromG. This paper first shows that function Λ_Gover the entire rangek [0, +∞] can be computed inO(nm + n² log n) time, and then shows that allG*(k) in the entire range can be obtained fromO(n log n) weighted cycles, and such cycles can be computed inO(nm + n² log n) time, wherenandmare the numbers of vertices and edges, respectively.     

A new domination conception

Let f be an integer valued function defined on the vertex set V(G) of a simple graph G. We call a subset D_f of V(G) a f-dominating set of G if |N(x, G) ∩ D_f| ≥ f(x) for all x ∈ V(G) — D_f, where N(x, G) is the set of neighbors of x. D_f is a minimum f-dominating set if G has no f-dominating set D′_f with |D_f| < |D_f|. If j, k ∈ N₀ = {0,1,2,…} with j ≤ k, then we define the integer valued function f_j,k on V(G) by . By μ_j,k(G) we denote the cardinality of a minimum f_j,k-dominating set of G. A set D ? V(G) is j-dominating if every vertex, which is not in D, is adjacent to at least j vertices of D. The j-domination number γ_j(G) is the minimum order of a j-dominating set in G. In this paper we shall give estimations of the new domination number μ_j,k(G), and with the help of these estimations we prove some new and some known upper bounds for the j-domination number. © 1993 John Wiley & Sons, Inc.     

A degree condition for the circumference of a graph

We present a new condition on the degree sums of a graph that implies the existence of a long cycle. Let c(G) denote the length of a longest cycle in the graph G and let m be any positive integer. Suppose G is a 2-connected graph with vertices x₁,…,x_n and edge set E that satisfies the property that, for any two integers j and k with j < k, x_jx_k ? E, d(x_i) ? j and d(x_k) ? K - 1, we have (1) d(x_i) + d(x_k ? m if j + k ? n and (2) if j + k < n, either m ? n or d(x_j) + d(x_k) ? min(K + 1,m). Then c(G) ? min(m, n). This result unifies previous results of J.C. Bermond and M. Las Vergnas, respectively.     

Multiple vertex coverings by specified induced subgraphs

Given graphs H₁,…, H_k, let f(H₁,…, H_k) be the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove constructively that f(H₁, H₂) ≤ 2(n(H₁) + n(H₂) − 2); equality holds when H₁ = H ₂ = K_n. We prove that f(H₁, K _n) = n + 2√δ(H₁)n + O(1) as n → ∞. We also determine f(K_{1, m −1}, K _n) exactly. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 180–190, 2000     

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 Sharp Threshold for k‐Colorability

Let k be a fixed integer and f_k(n, p) denote the probability that the random graph G(n, p) is k‐colorable. We show that for k≥3, there exists d_k(n) such that for any ϵ>0, (1) As a result we conclude that for sufficiently large n the chromatic number of G(n, d/n) is concentrated in one value for all but a small fraction of d>1. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 14, 63–70, 1999     

On Enomoto’s problems in a bipartite graph

In this paper, we obtain the following result: Let k, n ₁ and n ₂ be three positive integers, and let G = (V ₁,V ₂;E) be a bipartite graph with |V1| = n ₁ and |V ₂| = n ₂ such that n ₁ ⩾ 2k + 1, n ₂ ⩾ 2k + 1 and |n ₁ − n ₂| ⩽ 1. If d(x) + d(y) ⩾ 2k + 2 for every x ∈ V ₁ and y ∈ V ₂ with xy $ \notin $ \notin E(G), then G contains k independent cycles. This result is a response to Enomoto’s problems on independent cycles in a bipartite graph.     

Tensor Product Representations of the Lie Superalgebra 𝔭(n) and Their Centralizers

Abstract

We construct an associative algebra A _k and show that there is a representation of A _k on V ^?k , where V is the natural 2n-dimensional representation of the Lie superalgebra 𝔭(n). We prove that A _k is the full centralizer of 𝔭(n) on V ^?k , thereby obtaining a “Schur-Weyl duality” for the Lie superalgebra 𝔭(n). This result is used to understand the representation theory of the Lie superalgebra 𝔭(n). In particular, using A _k we decompose the tensor space V ^?k , for k = 2 or 3, and show that V ^?k is not completely reducible for any k ≥ 2.     

On the rank spread of graphs

For a simple graph G?=?(𝒱, ?) with vertex-set 𝒱?=?{1,?…?,?n}, let 𝒮(G) be the set of all real symmetric n-by-n matrices whose graph is G. We present terminology linking established as well as new results related to the minimum rank problem, with spectral properties in graph theory. The minimum rank mr(G) of G is the smallest possible rank over all matrices in 𝒮(G). The rank spread r _v (G) of G at a vertex v, defined as mr(G)???mr(G???v), can take values ??∈?{0,?1,?2}. In general, distinct vertices in a graph may assume any of the three values. For ??=?0 or 1, there exist graphs with uniform r _v (G) (equal to the same integer at each vertex v). We show that only for ??=?0, will a single matrix A in 𝒮(G) determine when a graph has uniform rank spread. Moreover, a graph G, with vertices of rank spread zero or one only, is a λ-core graph for a λ-optimal matrix A in 𝒮(G). We also develop sufficient conditions for a vertex of rank spread zero or two and a necessary condition for a vertex of rank spread two.     

Isometric embeddings of Johnson graphs in Grassmann graphs

Let V be an n-dimensional vector space (4≤n<∞) and let G_k(V){\mathcal{G}}_{k}(V) be the Grassmannian formed by all k-dimensional subspaces of V. The corresponding Grassmann graph will be denoted by Γ _k (V). We describe all isometric embeddings of Johnson graphs J(l,m), 1<m<l−1 in Γ _k (V), 1<k<n−1 (Theorem 4). As a consequence, we get the following: the image of every isometric embedding of J(n,k) in Γ _k (V) is an apartment of G_k(V){\mathcal{G}}_{k}(V) if and only if n=2k. Our second result (Theorem 5) is a classification of rigid isometric embeddings of Johnson graphs in Γ _k (V), 1<k<n−1.     

Graded Polynomial Identities for Tensor Products by the Grassmann Algebra

Abstract

Let 𝕂 be a field of characteristic zero, and R be a G-graded 𝕂-algebra. We consider the algebra R ? E, then deduce its G × ?₂-graded polynomial identities starting from the G-graded polynomial identities of R. As a consequence, we describe a basis for the ? _n  × ?₂-graded identities of the algebras M _n (E). Moreover we give the graded cocharacter sequence of M ₂(E), and show that M ₂(E) is PI-equivalent to M _1,1(E) ? E. This fact is a particular case of a more general result obtained by Kemer.     

On three zero-sum Ramsey-type problems

For a graph G whose number of edges is divisible by k, let R(G,Z_k) denote the minimum integer r such that for every function f: E(K_r) ? Z_k there is a copy G¹ of G in K_r so that Σe∈E(G¹) f(e) = 0 (in Z_k). We prove that for every integer k₁ R(K_n, Z_k) ≤ n + O(k³ log k) provided n is sufficiently large as a function of k and k divides (). If, in addition, k is an odd prime-power then R(K_n, Z_k) ≤ n + 2k - 2 and this is tight if k is a prime that divides n. A related result is obtained for hypergraphs. It is further shown that for every graph G on n vertices with an even number of edges R(G,Z₂) ≤ n + 2. This estimate is sharp. © 1993 John Wiley & Sons, Inc.     

Large Monotone Paths in Graphs with Bounded Degree

 We prove that for every ε>0 and positive integer r, there exists Δ₀=Δ₀(ε) such that if Δ>Δ₀ and n>n(Δ,ε,r) then there exists a packing of K _n with ⌊(n−1)/Δ⌋ graphs, each having maximum degree at most Δ and girth at least r, where at most εn ² edges are unpacked. This result is used to prove the following: Let f be an assignment of real numbers to the edges of a graph G. Let α(G,f) denote the maximum length of a monotone simple path of G with respect to f. Let α(G) be the minimum of α(G,f), ranging over all possible assignments. Now let α_Δ be the maximum of α(G) ranging over all graphs with maximum degree at most Δ. We prove that Δ+1≥α_Δ≥Δ(1−o(1)). This extends some results of Graham and Kleitman [6] and of Calderbank et al. [4] who considered α(K _n ). Received: March 15, 1999?Final version received: October 22, 1999