首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
4.
5.
6.
We prove that a general polynomial vector (f1,f2,f3) in three homogeneous variables of degrees (3,3,4) has a unique Waring decomposition of rank 7. This is the first new case we are aware of, and likely the last one, after five examples known since the 19th century and the binary case. We prove that there are no identifiable cases among pairs (f1,f2) in three homogeneous variables of degree (a,a+1), unless a=2, and we give a lower bound on the number of decompositions. The new example was discovered with Numerical Algebraic Geometry, while its proof needs Nonabelian Apolarity.  相似文献   

7.
According to a previous result of the author, if (A0,A1) is an interpolation couple, if A0? is weakly LUR, then the complex interpolation spaces (A0?,A1?)θ have the same property.Here we construct an interpolation couple (B0,B1) where B0 is LUR, but where the complex interpolation spaces (B0,B1)θ are not strictly convex.  相似文献   

8.
This paper deals with the existence and nonexistence of nonconstant positive steady-state solutions to a ratio-dependent predator–prey model with diffusion and with the homogeneous Neumann boundary condition. We demonstrate that there exists a0(b) satisfying 0<a0(b)<m1 for 0<b<m1, such that if 0<b<m1 and a0(b)<a<m1, then the diffusion can create nonconstant positive steady-state solutions; whereas the diffusion cannot do provided a>m1.  相似文献   

9.
This paper deals with a two-competing-species chemotaxis system with consumption of chemoattractant
{ut=d1Δu???(uχ1(w)?w)+μ1u(1?u?a1v),xΩ,t>0,vt=d2Δv???(vχ2(w)?w)+μ2v(1?a2u?v),xΩ,t>0,wt=d3Δw?(αu+βv)w,xΩ,t>0
under homogeneous Neumann boundary conditions in a bounded domain Ω?Rn (n1) with smooth boundary, where the initial data (u0,v0)(C0(Ω))2 and w0W1,(Ω) are non-negative and the parameters d1,d2,d3>0, μ1,μ2>0, a1,a2>0 and α,β>0. The chemotactic function χi(w) (i=1,2) is smooth and satisfying some conditions. It is proved that the corresponding initial–boundary value problem possesses a unique global bounded classical solution if one of the following cases hold: for i=1,2,(i) χi(w)=χ0,i>0 and
6w06L(Ω)<πdid3n+1χ0,i?2did3n+1χ0,iarctan?di?d32n+1did3;
(ii) 0<6w06L(Ω)d33(n+1)6χi6L[0,6w06L(Ω)]min?{2didi+d3,1}.Moreover, we prove asymptotic stabilization of solutions in the sense that:? If a1,a2(0,1) and u00v0, then any global bounded solution exponentially converge to (1?a11?a1a2,1?a21?a1a2,0) as t;? If a1>1>a2>0 and v00, then any global bounded solution exponentially converge to (0,1,0) as t;? If a1=1>a2>0 and v00, then any global bounded solution algebraically converge to (0,1,0) as t.  相似文献   

10.
11.
Let e be a positive integer, p be an odd prime, q=pe, and Fq be the finite field of q elements. Let f,gFq[X,Y]. The graph Gq(f,g) is a bipartite graph with vertex partitions P=Fq3 and L=Fq3, and edges defined as follows: a vertex (p)=(p1,p2,p3)P is adjacent to a vertex [l]=[l1,l2,l3]L if and only if p2+l2=f(p1,l1) and p3+l3=g(p1,l1). If f=XY and g=XY2, the graph Gq(XY,XY2) 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 Gq(f,g) containing no cycles of length less than eight and not isomorphic to the graph Gq(XY,XY2), even without requiring them to be edge-transitive. So far, no such graphs Gq(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.  相似文献   

12.
There is a one-to-one correspondence between ?-quasi-cyclic codes over a finite field Fq and linear codes over a ring R=Fq[Y]/(Ym?1). Using this correspondence, we prove that every ?-quasi-cyclic self-dual code of length m? over a finite field Fq can be obtained by the building-up construction, provided that char(Fq)=2 or q1(mod4), m is a prime p, and q is a primitive element of Fp. 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 F3 and a new 6-quasi-cyclic self-dual [30,15,10] code over F4. When m=7, we find a new 4-quasi-cyclic self-dual [28,14,9] code over F4 and a new 6-quasi-cyclic self-dual [42,21,12] code over F4.  相似文献   

13.
14.
15.
16.
TextFor any given two positive integers k1 and k2, and any set A of nonnegative integers, let rk1,k2(A,n) denote the number of solutions of the equation n=k1a1+k2a2 with a1,a2A. In this paper, we determine all pairs k1,k2 of positive integers for which there exists a set A?N such that rk1,k2(A,n)=rk1,k2(N?A,n) for all n?n0. We also pose several problems for further research.VideoFor a video summary of this paper, please click here or visit http://www.youtube.com/watch?v=EnezEsJl0OY.  相似文献   

17.
18.
In this paper, we study the elliptic problem with Dirac mass
(1){?Δu=Vup+kδ0inRN,lim|x|+?u(x)=0,
where N>2, p>0, k>0, δ0 is the Dirac mass at the origin and the potential V is locally Lipchitz continuous in RN?{0}, with non-empty support and satisfying
0V(x)σ1|x|a0(1+|x|a?a0),
with a0<N, a0<a and σ1>0. We obtain two positive solutions of (1) with additional conditions for parameters on a,a0, p and k. The first solution is a minimal positive solution and the second solution is constructed via Mountain Pass Theorem.  相似文献   

19.
20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号