Constructions of optimal quaternary constant weight codes via group divisible designs

Generalized Steiner systems were first introduced by Etzion and used to construct optimal constant weight codes over an alphabet of size g+1 with minimum Hamming distance 2k−3, in which each codeword has length v and weight k. As to the existence of a , a lot of work has been done for k=3, while not so much is known for k=4. The notion k-^∗GDD was first introduced by Chen et al. and used to construct . The necessary condition for the existence of a is v≥14. In this paper, it is proved that there exists a for any prime power and v≥19. By using this result, the known results on the existence of optimal quaternary constant weight codes are then extended.     

Exact rates in log law for positively associated random variables

Let be a strictly stationary sequence of positively associated random variables with mean zero and finite variance. Set , Mn=maxk?n|Sk|, n?1. Suppose . In this paper, we study the exact convergence rates of a kind of weighted infinite series of , and as ε↘0, respectively.     

A remark on Ricceri's conjecture for a class of nonlinear eigenvalue problems

Consider the eigenvalue problem : −Δu=λf(x,u) in Ω, u=0 on ∂Ω, where Ω is a bounded smooth domain in RN. Denote by the set of all Carathéodory functions f:Ω×R→R such that for a.e. x∈Ω, f(x,⋅) is Lipschitzian with Lipschitz constant L, f(x,0)=0 and , and denote by (resp. ) the set of λ>0 such that has at least one nonzero classical (resp. weak) solution. Let λ₁ be the first eigenvalue for the Laplacian-Dirichlet problem. We prove that and . Our result is a positive answer to Ricceri's conjecture if use f(x,u) instead of f(u) in the conjecture.     

Generalization of transitive fraternal augmentations for directed graphs and its applications

Let be a directed graph. A transitive fraternal augmentation of is a directed graph with the same vertex set, including all the arcs of and such that for any vertices x,y,z,

1.

if and then or (fraternity);

2.

if and then (transitivity).

In this paper, we explore some generalization of the transitive fraternal augmentations for directed graphs and its applications. In particular, we show that the 2-coloring number col₂(G)≤O(∇₁(G)∇₀(G)²), where ∇_k(G) (k≥0) denotes the greatest reduced average density with depth k of a graph G; we give a constructive proof that ∇_k(G) bounds the distance (k+1)-coloring number col_k+1(G) with a function f(∇_k(G)). On the other hand, ∇_k(G)≤(col_2k+1(G))^2k+1. We also show that an inductive generalization of transitive fraternal augmentations can be used to study nonrepetitive colorings of graphs.     

How to play the Majority game with a liar

The Majority game is played by a questioner () and an answerer (). holds n elements, each of which can be labeled as 0 or 1. is trying to identify some element holds as having the Majority label or, in the case of a tie, claim there is none. To do this asks questions comparing whether two elements have the same or different label. ’s goal is to ask as few questions as possible while ’s goal is to delay as much as possible. Let q^∗ denote the minimal number of questions needed for to identify a Majority element regardless of ’s answers.In this paper we investigate upper and lower bounds for q^∗ in a variation of the Majority game, where is allowed to lie up to t times. We consider two versions of the game, the adaptive (where questions are asked sequentially) and the oblivious (where questions are asked in one batch).     

Improved induced matchings in sparse graphs

An induced matching in a graph G=(V,E) is a matching M such that (V,M) is an induced subgraph of G. Clearly, among two vertices with the same neighbourhood (called twins) at most one is matched in any induced matching, and if one of them is matched then there is another matching of the same size that matches the other vertex. Motivated by this, Kanj et al. [10] studied induced matchings in twinless graphs. They showed that any twinless planar graph contains an induced matching of size at least and that there are twinless planar graphs that do not contain an induced matching of size greater than . We improve both these bounds to , which is tight up to an additive constant. This implies that the problem of deciding whether a planar graph has an induced matching of size k has a kernel of size at most 28k. We also show for the first time that this problem is fixed parameter tractable for graphs of bounded arboricity.Kanj et al. also presented an algorithm which decides in -time whether an n-vertex planar graph contains an induced matching of size k. Our results improve the time complexity analysis of their algorithm. However, we also show a more efficient -time algorithm. Its main ingredient is a new, O^∗(4^l)-time algorithm for finding a maximum induced matching in a graph of branch width at most l.     

Singular-value-like decomposition for complex matrix triples

The classical singular value decomposition for a matrix A∈C^m×n is a canonical form for A that also displays the eigenvalues of the Hermitian matrices AA^∗ and A^∗A. In this paper, we develop a corresponding decomposition for A that provides the Jordan canonical forms for the complex symmetric matrices and . More generally, we consider the matrix triple , where are invertible and either complex symmetric or complex skew-symmetric, and we provide a canonical form under transformations of the form , where X,Y are nonsingular.     

Higher power moments of the Riesz mean error term of symmetric square L-function

Let be the error term of the Riesz mean of the symmetric square L-function. We give the higher power moments of and show that if there exists a real number A₀:=A₀(ρ)>3 such that , then we can derive asymptotic formulas for , 3?h<A₀, h∈N. Particularly, we get asymptotic formulas for , h=3,4,5 unconditionally.     

Normal families and shared values of meromorphic functions

Let be a positive integer, let F be a family of meromorphic functions in a domain D, all of whose zeros have multiplicity at least k+1, and let , be two holomorphic functions on D. If, for each f∈F, f=a(z)⇔f(k)=h(z), then F is normal in D.     

The oscillation of differential transforms - entire Jacobi expansions

Let L=(1−x²)D²−((β−α)−(α+β+2)x)D with , and . Let f∈C^∞[−1,1], , with normalized Jacobi polynomials and the Cn decrease sufficiently fast. Set Lk=L(Lk−1), k?2. Let ρ>1. If the number of sign changes of (Lkf)(x) in (−1,1) is O(k1/(ρ+1)), then f extends to be an entire function of logarithmic order . For Legendre expansions, the result holds with replaced with .     

Haj?asz-Sobolev imbedding and extension

The author establishes some geometric criteria for a Haj?asz-Sobolev -extension (resp. -imbedding) domain of Rn with n?2, s∈(0,1] and p∈[n/s,∞] (resp. p∈(n/s,∞]). In particular, the author proves that a bounded finitely connected planar domain Ω is a weak α-cigar domain with α∈(0,1) if and only if for some/all s∈[α,1) and p=(2−α)/(s−α), where denotes the restriction of the Triebel-Lizorkin space on Ω.     

A Morita type equivalence for dual operator algebras

We generalize the main theorem of Rieffel for Morita equivalence of W^∗-algebras to the case of unital dual operator algebras: two unital dual operator algebras A,B have completely isometric normal representations α,β such that α(A)=[M^∗β(B)M]^−w∗ and β(B)=[Mα(A)M^∗]^−w∗ for a ternary ring of operators M (i.e. a linear space M such that MM^∗M⊂M) if and only if there exists an equivalence functor which “extends” to a ∗-functor implementing an equivalence between the categories and . By we denote the category of normal representations of A and by the category with the same objects as and Δ(A)-module maps as morphisms (Δ(A)=A∩A^∗). We prove that this functor is equivalent to a functor “generated” by a B,A bimodule, and that it is normal and completely isometric.     

Chen-Ruan cohomology of some moduli spaces of parabolic vector bundles

Let (X,D) be an ?-pointed compact Riemann surface of genus at least two. For each point x∈D, fix parabolic weights such that . Fix a holomorphic line bundle ξ over X of degree one. Let PMξ denote the moduli space of stable parabolic vector bundles, of rank two and determinant ξ, with parabolic structure over D and parabolic weights . The group of order two line bundles over X acts on PMξ by the rule E_∗⊗L?E_∗⊗L. We compute the Chen-Ruan cohomology ring of the corresponding orbifold.     

Galois deformation theory for norm fields and flat deformation rings

Let K be a finite extension of Qp, and choose a uniformizer π∈K, and put . We introduce a new technique using restriction to to study flat deformation rings. We show the existence of deformation rings for -representations “of height ≤h” for any positive integer h, and prove that when h=1 they are isomorphic to “flat deformation rings”. This -deformation theory has a good positive characteristics analogue of crystalline representations in the sense of Genestier-Lafforgue. In particular, we obtain a positive characteristic analogue of crystalline deformation rings, and can analyze their local structure.     

CoHochschild homology of chain coalgebras

Generalizing the work of Doi and of Idrissi, we define a coHochschild homology theory for chain coalgebras over any commutative ring and prove its naturality with respect to morphisms of chain coalgebras up to strong homotopy. As a consequence we obtain that if the comultiplication of a chain coalgebra C is itself a morphism of chain coalgebras up to strong homotopy, then the coHochschild complex admits a natural comultiplicative structure. In particular, if K is a reduced simplicial set and C_∗K is its normalized chain complex, then is naturally a homotopy-coassociative chain coalgebra. We provide a simple, explicit formula for the comultiplication on when K is a simplicial suspension.The coHochschild complex construction is topologically relevant. Given two simplicial maps g,h:K→L, where K and L are reduced, the homology of the coHochschild complex of C_∗L with coefficients in C_∗K is isomorphic to the homology of the homotopy coincidence space of the geometric realizations of g and h, and this isomorphism respects comultiplicative structure. In particular, there is an isomorphism, respecting comultiplicative structure, from the homology of to H_∗L|K|, the homology of the free loops on the geometric realization of K.     

The coarse shape groups

The (pointed) coarse shape category Sh^* (), having (pointed) topological spaces as objects and having the (pointed) shape category as a subcategory, was recently constructed. Its isomorphisms classify (pointed) topological spaces strictly coarser than the (pointed) shape type classification. In this paper we introduce a new algebraic coarse shape invariant which is an invariant of shape and homotopy, as well. For every pointed space (X,?) and for every k∈N₀, the coarse shape group , having the standard shape group for its subgroup, is defined. Furthermore, a functor is constructed. The coarse shape and shape groups already differ on the class of polyhedra. An explicit formula for computing coarse shape groups of polyhedra is given. The coarse shape groups give us more information than the shape groups. Generally, does not imply (e.g. for solenoids), but from pro-πk(X,?)=0 follows . Moreover, for pointed metric compacta (X,?), the n-shape connectedness is characterized by , for every k?n.     

Fourier transforms and generalized Lipschitz classes in uniform metric

For functions f∈L¹(R)∩C(R) with Fourier transforms in L¹(R) we give necessary and sufficient conditions for f to belong to the generalized Lipschitz classes Hω,m and hω,m in terms of behavior of .     

Solution of a nonsymmetric algebraic Riccati equation from a two-dimensional transport model

For the steady-state solution of an integral-differential equation from a two-dimensional model in transport theory, we shall derive and study a nonsymmetric algebraic Riccati equation B^--XF^--F⁺X+XB⁺X=0, where , and with a nonnegative matrix P, positive diagonal matrices D^±, and nonnegative parameters f, and . We prove the existence of the minimal nonnegative solution X^∗ under the physically reasonable assumption , and study its numerical computation by fixed-point iteration, Newton’s method and doubling. We shall also study several special cases; e.g. when and P is low-ranked, then is low-ranked and can be computed using more efficient iterative processes in U and V. Numerical examples will be given to illustrate our theoretical results.     

A characterization of k-hyponormality via weak subnormality

An operator T acting on a Hilbert space is said to be weakly subnormal if there exists an extension acting on such that for all . When such partially normal extensions exist, we denote by m.p.n.e.(T) the minimal one. On the other hand, for k?1, T is said to be k-hyponormal if the operator matrix is positive. We prove that a 2-hyponormal operator T always satisfies the inequality T∗[T∗,T]T?‖T‖2[T∗,T], and as a result T is automatically weakly subnormal. Thus, a hyponormal operator T is 2-hyponormal if and only if there exists B such that BA∗=A∗T and is hyponormal, where A:=[T∗,T]1/2. More generally, we prove that T is (k+1)-hyponormal if and and only if T is weakly subnormal and m.p.n.e.(T) is k-hyponormal. As an application, we obtain a matricial representation of the minimal normal extension of a subnormal operator as a block staircase matrix.