On A(X) → TC(X) for some X

Let X be a connected based space and p be a two-regular prime number. If the fundamental group of X has order p, we compute the two-primary homotopy groups of the homotopy fiber of the trace map A(X) → TC(X) relating algebraic K-theory of spaces to topological cyclic homology. The proof uses a theorem of Dundas and an explicit calculation of the cyclotomic trace map K(ℤ[C_p])→ TC(ℤ[C_p]).     

A generalization of line graphs: (X,Y)-intersection graphs

Given a pair (X, Y) of fixed graphs X and Y, the (X, Y)-intersection graph of a graph G is a graph whose vertices correspond to distinct induced subgraphs of G that are isomorphic to Y, and where two vertices are adjacent iff the intersection of their corresponding subgraphs contains an induced subgraph isomorphic to X. This generalizes the notion of line graphs, since the line graph of G is precisely the (K₁, K₂)-intersection graph of G. In this paper, we consider the forbidden induced subgraph characterization of (X, Y)-intersection graphs for various (X, Y) pairs; such consideration is motivated by the characterization of line graphs through forbidden induced subgraphs. For this purpose, we restrict our attention to hereditary pairs (a pair (X, Y) is hereditary if every induced subgraph of any (X, Y)-intersection graph is also an (X, Y)-intersection graph), since only for such pairs do (X, Y)-intersection graphs have forbidden induced subgraph characterizations. We show that for hereditary 2-pairs (a pair (X, Y) is a 2-pair if Y contains exactly two induced subgraphs isomorphic to X), the family of line graphs of multigraphs and the family of line graphs of bipartite graphs are the maximum and minimum elements, respectively, of the poset on all families of (X, Y)-intersection graphs ordered by set inclusion. We characterize 2-pairs for which the family of (X, Y)-intersection graphs are exactly the family of line graphs or the family of line graphs of multigraphs. © 1996 John Wiley & Sons, Inc.     

Regular elements of semigroups B X ( D ) defined by generalized elementary B X ( D )-semilattices of unions

In the paper, the class of complete semigroups of binary relations is considered, each of whose elements is defined by a complete B _X (D)-semilattice of unions which belongs to the class of generalized elementary X-semilattices. Regular elements are described for each semigroup of this class. __________ Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 49, Algebra and Geometry, 2007.     

On L(d,1)-labelings of graphs

Given a graph G and a positive integer d, an L(d,1)-labeling of G is a function f that assigns to each vertex of G a non-negative integer such that if two vertices u and v are adjacent, then |f(u)−f(v)|d; if u and v are not adjacent but there is a two-edge path between them, then |f(u)−f(v)|1. The L(d,1)-number of G, λ_d(G), is defined as the minimum m such that there is an L(d,1)-labeling f of G with f(V){0,1,2,…,m}. Motivated by the channel assignment problem introduced by Hale (Proc. IEEE 68 (1980) 1497–1514), the L(2,1)-labeling and the L(1,1)-labeling (as d=2 and 1, respectively) have been studied extensively in the past decade. This article extends the study to all positive integers d. We prove that λ_d(G)Δ²+(d−1)Δ for any graph G with maximum degree Δ. Different lower and upper bounds of λ_d(G) for some families of graphs including trees and chordal graphs are presented. In particular, we show that the lower and the upper bounds for trees are both attainable, and the upper bound for chordal graphs can be improved for several subclasses of chordal graphs.     

A method for the resolution of the Jacobi equation Y ″ + RY = 0 on the manifold Sp (2)/ SU (2)

In this paper a method for the resolution of the differential equation of the Jacobi vector fields in the manifold V ₁ = Sp(2)/SU(2) is exposed. These results are applied to determine areas and volumes of geodesic spheres and balls.     

On complex manifolds polarized by an ample line bundle of sectional genus q ( X ) + 2

Let (X,L) be a polarized manifold with dim X = n. In this paper, we classify (X,L) with n = 3, , and g(L)=q(X) + 2. Moreover we also classify (X,L) with , g(L)=q(x) + 2, and . Received February 12, 1999     

Best approximation in L(μ, X), II

The object of this paper is to prove the following theorem: If Y is a closed subspace of the Banach space X, then L¹(μ, Y) is proximinal in L¹(μ, X) if and only if L^p(μ, Y) is proximinal in L^p(μ, Y) for every p, 1 < p < ∞. As an application of this result we prove that if Y is either reflexive or Y is a separable proximinal dual space, then L¹(μ, Y) is proximinal in L¹(μ, X).     

Unique continuous selections for metric projections of C(X) onto finite-dimensional vector subspaces, II

Best approximation in C(X) by elements of a Chebyshev subspace is governed by Haar's theorem, the de la Vallée Poussin estimates, the alternation theorem, the Remez algorithm, and Mairhuber's theorem. J. Blatter (1990, J. Approx. Theory 61, 194–221) considered best approximation in C(X) by elements of a subspace whose metric projection has a unique continuous selection and extended Haar's theorem and Mairhuber's theorem to this situation. In the present paper we so extend the de la Vallée Poussin estimates, the alternation theorem, and the Remez algorithm.     

Approximations from Subspaces of C0(X)

We show among other things that if B is a linear space of continuous real-valued functions vanishing at infinity on a locally compact Hausdorff space X, for which there is a continuous function h defined in a neighbourhood of 0 in the real line which is non-affine in every neighbourhood of 0 and satisfies |h(t)|k |t| for all t, such that hb is in B whenever b is in B and the composite function is defined, then every function in C₀(X) which can be approximated on every pair of points in X by functions in B can be approximated uniformly by functions in B.     

On analytic and coanalytic function spaces Cp(X)

Under the assumption (V = L) we construct countable completely regular spaces X and Y such that the spaces C_p(X) and C_p(Y) of real-valued continuous functions on X and Y, equipped with the pointwise convergence topology, are analytic noncoanalytic and they are not homeomorphic. We also give analogous examples of coanalytic nonanalytic function spaces.     

A Short Remark on Weierstrass Points at Infinity on X 0( N)

We point out that the formalism of the trace map and reduction modulo p can be used to give a short proof for the fact first proved by Ogg that is not a Weierstrass point on X₀(pM) where p is a prime not dividing M and the genus of X₀(M) is zero.     

On the λY calculus

The λY calculus is the simply typed λ calculus augmented with the fixed point operators. We show three results about λY: (a) the word problem is undecidable, (b) weak normalisability is decidable, and (c) higher type fixed point operators are not definable from fixed point operators at smaller types.     

Filtered deformations of lie algebras of series Y

The rigidity of simple graded Lie algebras of the series Y over algebraically closed fields of characteristic 3 is proved.     

D(β)-vertex-distinguishing total coloring of graphs

A new concept of the D(β)-vertex-distinguishing total coloring of graphs, i.e., the proper total coloring such that any two vertices whose distance is not larger than β have different color sets, where the color set of a vertex is the set composed of all colors of the vertex and the edges incident to it, is proposed in this paper. The D(2)-vertex-distinguishing total colorings of some special graphs are discussed, meanwhile, a conjecture and an open problem are presented.     

(k,+)-distance-hereditary graphs

In this work we introduce, characterize, and provide algorithmic results for (k,+)-distance-hereditary graphs, k0. These graphs can be used to model interconnection networks with desirable connectivity properties; a network modeled as a (k,+)-distance-hereditary graph can be characterized as follows: if some nodes have failed, as long as two nodes remain connected, the distance between these nodes in the faulty graph is bounded by the distance in the non-faulty graph plus an integer constant k. The class of all these graphs is denoted by DH(k,+). By varying the parameter k, classes DH(k,+) include all graphs and form a hierarchy that represents a parametric extension of the well-known class of distance-hereditary graphs.     

Star discrepancy estimates for digital (t, m, 2)-nets and digital (t, 2) -sequences over Z2

Summary We prove upper bounds on the star discrepancy of digital (t, m, 2)-nets and (t, 2)-sequences over Z₂. The main tool is a decomposition lemma for digital (t, m, 2)-nets, which states that every digital (t, m, 2)-net is just the union of 2^tdigitally shifted digital (0, m - t, 2)-nets. Using this result we generalize upper bounds on the star discrepancy of digital (0, m, 2) -nets and (0, 2) -sequences.     

Linear (q+1)-fold Blocking Sets in PG(2, q)

A (q+1)-fold blocking set of size (q+1)(q⁴+q²+1) in PG(2, q⁴) which is not the union of q+1 disjoint Baer subplanes, is constructed     

A note on feedback cyclicity of C[Y]

Let (A,B) be an n-dimensional linear system with 2-inputs over C[Y], the ring of polynomials in one-variable over the field of complex numbers. We prove the feedback cyclicity of (A,B) under certain conditions on their entries and deduce that (A,B) is feedback cyclic in an exceptional case left open in W. Schmale [Linear Algebra Appl. 275–276 (1998) 551–562].