Un contre-exemple pour un espace d'interpolation qui n'est pas faiblement LUR

According to a previous result of the author, if $(A_0,A_1)$ is an interpolation couple, if $A_0^{?}$ is weakly LUR, then the complex interpolation spaces ${(A_0^{?},A_1^{?})}_{\theta }$ have the same property.Here we construct an interpolation couple $(B_0,B_1)$ where $B_0$ is LUR, but where the complex interpolation spaces ${(B_0,B_1)}_{\theta }$ are not strictly convex.     

On the sum of distinct primes or squares of primes

In 1965 Erd?s introduced $f_2(s)$: $f_2(s)$ is the smallest integer such that every $l>f_2(s)$ is the sum of s distinct primes or squares of primes where a prime and its square are not both used. We prove that for all sufficiently large s, $f_2(s)?p_2+p_3+?+p_{s+1}+3106$, and the set of s with the equality has the density 1.     

Extension operators and twisted sums of c0 and C(K) spaces

We investigate the following problem posed by Cabello Sanchéz, Castillo, Kalton, and Yost:Let K be a nonmetrizable compact space. Does there exist a nontrivial twisted sum of $c_0$ and $C(K)$, i.e., does there exist a Banach space X containing a non-complemented copy Y of $c_0$ such that the quotient space $X/Y$ is isomorphic to $C(K)$?Using additional set-theoretic assumptions we give the first examples of compact spaces K providing a negative answer to this question. We show that under Martin's axiom and the negation of the continuum hypothesis, if either K is the Cantor cube $2^{{\omega }_1}$ or K is a separable scattered compact space of height 3 and weight ${\omega }_1$, then every twisted sum of $c_0$ and $C(K)$ is trivial.We also construct nontrivial twisted sums of $c_0$ and $C(K)$ for K belonging to several classes of compacta. Our main tool is an investigation of pairs of compact spaces $K?L$ which do not admit an extension operator $C(K)\to C(L)$.     

Construction of quasi-cyclic self-dual codes

There is a one-to-one correspondence between ?-quasi-cyclic codes over a finite field ${\mathbb{F}}_q$ and linear codes over a ring $R={\mathbb{F}}_q[Y]/(Y^m?1)$. Using this correspondence, we prove that every ?-quasi-cyclic self-dual code of length m? over a finite field ${\mathbb{F}}_q$ can be obtained by the building-up construction, provided that $\mathrm{char}({\mathbb{F}}_q)=2$ or $q\equiv 1(\mathrm{mod}4)$, m is a prime p, and q is a primitive element of ${\mathbb{F}}_p$. We determine possible weight enumerators of a binary ?-quasi-cyclic self-dual code of length p? (with p a prime) in terms of divisibility by p. We improve the result of Bonnecaze et al. (2003) [3] by constructing new binary cubic (i.e., ?-quasi-cyclic codes of length 3?) optimal self-dual codes of lengths $30,36,42,48$ (Type I), 54 and 66. We also find quasi-cyclic optimal self-dual codes of lengths 40, 50, and 60. When $m=5$, we obtain a new 8-quasi-cyclic self-dual $[40,20,12]$ code over ${\mathbb{F}}_3$ and a new 6-quasi-cyclic self-dual $[30,15,10]$ code over ${\mathbb{F}}_4$. When $m=7$, we find a new 4-quasi-cyclic self-dual $[28,14,9]$ code over ${\mathbb{F}}_4$ and a new 6-quasi-cyclic self-dual $[42,21,12]$ code over ${\mathbb{F}}_4$.     

Minimal homogeneous Steiner 2-(v,3) trades

A Steiner 2-$(v,3)$ trade is a pair $(T_1,T_2)$ of disjoint partial Steiner triple systems, each on the same set of $v$ points, such that each pair of points occurs in $T_1$ if and only if it occurs in $T_2$. A Steiner 2-$(v,3)$ trade is called d-homogeneous if each point occurs in exactly d blocks of $T_1$ (or $T_2$). In this paper we construct minimal d-homogeneous Steiner 2-$(v,3)$ trades of foundation $v$ and volume $\mathit{dv}/3$ for sufficiently large values of $v$. (Specifically, $v>3(1.75d^2+3)$ if $v$ is divisible by 3 and $v>d(4^{d/3+1}+1)$ otherwise.)     

Non-level semi-standard graded Cohen–Macaulay domain with h-vector (h0,h1,h2)

Let $\mathbb{k}$ be an algebraically closed field of characteristic 0, and $A={?}_{i\in \mathbb{N}}{A}_i$ a Cohen–Macaulay graded domain with $A_0=\mathbb{k}$. If A is semi-standard graded (i.e., A is finitely generated as a $\mathbb{k}[A_1]$-module), it has the h-vector$(h_0,h_1,\dots ,h_s)$, which encodes the Hilbert function of A. From now on, assume that $s=2$. It is known that if A is standard graded (i.e., $A=\mathbb{k}[A_1]$), then A is level. We will show that, in the semi-standard case, if A is not level, then $h_1+1$ divides $h_2$. Conversely, for any positive integers h and n, there is a non-level A with the h-vector $(1,h,(h+1)n)$. Moreover, such examples can be constructed as Ehrhart rings (equivalently, normal toric rings).     

Proof of a conjecture on monomial graphs

Let e be a positive integer, p be an odd prime, $q=p^e$, and ${\mathbb{F}}_q$ be the finite field of q elements. Let $f,g\in {\mathbb{F}}_q[X,Y]$. The graph $G_q(f,g)$ is a bipartite graph with vertex partitions $P={\mathbb{F}}_q^3$ and $L={\mathbb{F}}_q^3$, and edges defined as follows: a vertex $(p)=(p_1,p_2,p_3)\in P$ is adjacent to a vertex $[l]=[l_1,l_2,l_3]\in L$ if and only if $p_2+l_2=f(p_1,l_1)$ and $p_3+l_3=g(p_1,l_1)$. If $f=XY$ and $g=X{Y}^2$, the graph $G_q(XY,X{Y}^2)$ contains no cycles of length less than eight and is edge-transitive. Motivated by certain questions in extremal graph theory and finite geometry, people search for examples of graphs $G_q(f,g)$ containing no cycles of length less than eight and not isomorphic to the graph $G_q(XY,X{Y}^2)$, even without requiring them to be edge-transitive. So far, no such graphs $G_q(f,g)$ have been found. It was conjectured that if both f and g are monomials, then no such graphs exist. In this paper we prove the conjecture.     

Resolvable 4-cycle group divisible designs with two associate classes: Part size even

Let ${\lambda }_1{K}_a$ denote the graph on a vertices with ${\lambda }_1$ edges between every pair of vertices. Take p copies of this graph ${\lambda }_1{K}_a$, and join each pair of vertices in different copies with ${\lambda }_2$ edges. The resulting graph is denoted by $K(a,p;{\lambda }_1,{\lambda }_2)$, a graph that was of particular interest to Bose and Shimamoto in their study of group divisible designs with two associate classes. The existence of z-cycle decompositions of this graph have been found when $z\in \{3,4\}$. In this paper we consider resolvable decompositions, finding necessary and sufficient conditions for a 4-cycle factorization of $K(a,p;{\lambda }_1,{\lambda }_2)$ (when ${\lambda }_1$ is even) or of $K(a,p;{\lambda }_1,{\lambda }_2)$ minus a 1-factor (when ${\lambda }_1$ is odd) whenever a is even.     

Periodicity in a nonlinear discrete predator–prey system with state dependent delays

With the help of a continuation theorem based on Gaines and Mawhin's coincidence degree, easily verifiable criteria are established for the global existence of positive periodic solutions of the following nonlinear discrete state dependent delays predator–prey systemwhere $a_i,c_j,d_i:Z\to R^{+}$ are positive $\omega$-periodic, $\omega$ is a fixed positive integer. $b_1,b_2:Z\to R^{+}$ are $\omega$-periodic and ${\sum }_{k=0}^{\omega -1}{b}_i(k)>0$. ${\tau }_i,{\sigma }_j,{\rho }_i:Z\times R\times R\to R(i=1,2,\dots ,n,j=1,2,\dots ,m)$ are $\omega$-periodic with respect to their first arguments, respectively. ${\alpha }_i,{\beta }_j,{\gamma }_i(i=1,2,\dots ,n,j=1,2,\dots ,m)$ are positive constants.     

On parabolic Kazhdan–Lusztig R-polynomials for the symmetric group

Parabolic R-polynomials were introduced by Deodhar as parabolic analogues of ordinary R-polynomials defined by Kazhdan and Lusztig. In this paper, we are concerned with the computation of parabolic R-polynomials for the symmetric group. Let $S_n$ be the symmetric group on $\{1,2,\dots ,n\}$, and let $S=\{s_i|1\le i\le n?1\}$ be the generating set of $S_n$, where for $1\le i\le n?1$, $s_i$ is the adjacent transposition. For a subset $J?S$, let ${(S_n)}_J$ be the parabolic subgroup generated by J, and let ${(S_n)}^J$ be the set of minimal coset representatives for $S_n/{(S_n)}_J$. For $u\le v\in {(S_n)}^J$ in the Bruhat order and $x\in \{q,?1\}$, let $R_{u,v}^{J,x}(q)$ denote the parabolic R-polynomial indexed by u and v. Brenti found a formula for $R_{u,v}^{J,x}(q)$ when $J=S?\{s_i\}$, and obtained an expression for $R_{u,v}^{J,x}(q)$ when $J=S?\{s_{i?1},s_i\}$. In this paper, we provide a formula for $R_{u,v}^{J,x}(q)$, where $J=S?\{s_{i?2},s_{i?1},s_i\}$ and i appears after $i?1$ in v. It should be noted that the condition that i appears after $i?1$ in v is equivalent to that v is a permutation in ${(S_n)}^{S?\{s_{i?2},s_i\}}$. We also pose a conjecture for $R_{u,v}^{J,x}(q)$, where $J=S?\{s_k,s_{k+1},\dots ,s_i\}$ with $1\le k\le i\le n?1$ and v is a permutation in ${(S_n)}^{S?\{s_k,s_i\}}$.