首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
We show that the Moore–Gibson–Thomson equation
τ?ttty+α?tty?c2Δy?bΔ?ty=k?tt(y2)+χω(t)u,
is controlled by a force that is supported on an moving subset ω(t) of the domain, satisfying a geometrical condition. Using the concept of approximately outer invertible map, a generalized implicit function theorem and assuming that γ:=α?τc2b>0, the local null controllability in the nonlinear case is established. Moreover, the analysis of the critical value γ=0 for the linear equation is included.  相似文献   

2.
3.
Let Bd denote the unit ball of Cd, d1. Given an inner function I:BdB1, we study the corresponding family σα[I], α?B1, of pluriharmonic Clark measures on the complex sphere. We introduce and investigate related unitary operators Uα mapping analogs of model spaces onto L2(σα), α?B1. In particular, we explicitly characterize the set of Uα?f such that fσα is a pluriharmonic measure.  相似文献   

4.
We study ground states of two-component Bose–Einstein condensates (BEC) with trapping potentials in R2, where the intraspecies interaction (?a1,?a2) and the interspecies interaction ?β are both attractive, i.e, a1, a2 and β are all positive. The existence and non-existence of ground states are classified completely by investigating equivalently the associated L2-critical constraint variational problem. The uniqueness and symmetry-breaking of ground states are also analyzed under different types of trapping potentials as ββ?=a?+(a??a1)(a??a2), where 0<ai<a?:=6w622 (i=1,2) is fixed and w is the unique positive solution of Δw?w+w3=0 in R2. The semi-trivial limit behavior of ground states is tackled in the companion paper [12].  相似文献   

5.
《Discrete Mathematics》2020,343(3):111721
The Z2s-additive codes are subgroups of Z2sn, and can be seen as a generalization of linear codes over Z2 and Z4. A Z2s-linear Hadamard code is a binary Hadamard code which is the Gray map image of a Z2s-additive code. A partial classification of these codes by using the dimension of the kernel is known. In this paper, we establish that some Z2s-linear Hadamard codes of length 2t are equivalent, once t is fixed. This allows us to improve the known upper bounds for the number of such nonequivalent codes. Moreover, up to t=11, this new upper bound coincides with a known lower bound (based on the rank and dimension of the kernel). Finally, when we focus on s{2,3}, the full classification of the Z2s-linear Hadamard codes of length 2t is established by giving the exact number of such codes.  相似文献   

6.
7.
We consider subordinators Xα=(Xα(t))t0 in the domain of attraction at 0 of a stable subordinator (Sα(t))t0 (where α(0,1)); thus, with the property that Π¯α, the tail function of the canonical measure of Xα, is regularly varying of index ?α(?1,0) as x0. We also analyse the boundary case, α=0, when Π¯α is slowly varying at 0. When α(0,1), we show that (tΠ¯α(Xα(t)))?1 converges in distribution, as t0, to the random variable (Sα(1))α. This latter random variable, as a function of α, converges in distribution as α0 to the inverse of an exponential random variable. We prove these convergences, also generalised to functional versions (convergence in D[0,1]), and to trimmed versions, whereby a fixed number of its largest jumps up to a specified time are subtracted from the process. The α=0 case produces convergence to an extremal process constructed from ordered jumps of a Cauchy subordinator. Our results generalise random walk and stable process results of Darling, Cressie, Kasahara, Kotani and Watanabe.  相似文献   

8.
9.
10.
The ZpZp2-additive codes are subgroups of Zpα1×Zp2α2, and can be seen as linear codes over Zp when α2=0, Zp2-additive codes when α1=0, or Z2Z4-additive codes when p=2. A ZpZp2-linear generalized Hadamard (GH) code is a GH code over Zp which is the Gray map image of a ZpZp2-additive code. Recursive constructions of ZpZp2-additive GH codes of type (α1,α2;t1,t2) with t1,t21 are known. In this paper, we generalize some known results for ZpZp2-linear GH codes with p=2 to any p3 prime when α10, and then we compare them with the ones obtained when α1=0. First, we show for which types the corresponding ZpZp2-linear GH codes are nonlinear over Zp. Then, for these codes, we compute the kernel and its dimension, which allow us to classify them completely. Moreover, by computing the rank of some of these codes, we show that, unlike Z4-linear Hadamard codes, the Zp2-linear GH codes are not included in the family of ZpZp2-linear GH codes with α10 when p3 prime. Indeed, there are some families with infinite nonlinear ZpZp2-linear GH codes, where the codes are not equivalent to any Zps-linear GH code with s2.  相似文献   

11.
In this paper, we will study Ciani curves in characteristic p3, in particular their standard forms C:x4+y4+z4+rx2y2+sy2z2+tz2x2=0. It is well-known that any Ciani curve is a non-hyperelliptic curve of genus 3, and its Jacobian variety is isogenous to the product of three elliptic curves. As a main result, we will show that if C is superspecial, then r,s,t belong to Fp2 and C is maximal or minimal over Fp2. Moreover, in this case we will provide a simple criterion in terms of r,s,t,p that tells whether C is maximal (resp. minimal) over Fp2.  相似文献   

12.
Very recently, Tu et al. presented a sufficient condition on (a1,a2,a3), see Theorem 1.1, such that f(x)=x32m+a1x2m+1+1+a2x2m+2+a3x3 is a class of permutation polynomials over F2n with n=2m and m odd. In this present paper, we prove that the sufficient condition is also necessary.  相似文献   

13.
We consider a critical superprocess {X;Pμ} with general spatial motion and spatially dependent stable branching mechanism with lowest stable index γ0>1. We first show that, under some conditions, Pμ(|Xt|0) converges to 0 as t and is regularly varying with index (γ01)1. Then we show that, for a large class of non-negative testing functions f, the distribution of {Xt(f);Pμ(|6Xt60)}, after appropriate rescaling, converges weakly to a positive random variable z(γ01) with Laplace transform E[euz(γ01)]=1(1+u(γ01))1(γ01).  相似文献   

14.
The Orlicz (?2,?1)-mixed inequality states that(j1=1n(j2=1n|A(ej1,ej2)|)2)1226A6 for all bilinear forms A:Kn×KnK and all positive integers n, where Kn denotes Rn or Cn endowed with the supremum norm. In this paper we extend this inequality to multilinear forms, with Kn endowed with ?p norms for all p[1,].  相似文献   

15.
16.
17.
This paper is to derive a new blow-up criterion for the 2D full compressible Navier–Stokes equations without heat conduction in terms of the density ρ and the pressure P. More precisely, it indicates that in a bounded domain the strong solution exists globally if the norm ||ρ||L(0,t;L)+||P||Lp0(0,t;L)< for some constant  p0 satisfying 1<p02. The boundary condition is imposed as a Navier-slip boundary one and the initial vacuum is permitted. Our result extends previous one which is stated as ||ρ||L(0,t;L)+||P||L(0,t;L)<.  相似文献   

18.
Let F2m be a finite field of cardinality 2m, R=F2m[u]u4=F2m+uF2m+u2F2m+u3F2m (u4=0) which is a finite chain ring, and n is an odd positive integer. For any δ,αF2m×, an explicit representation for the dual code of any (δ+αu2)-constacyclic code over R of length 2n is given. And some dual codes of (1+u2)-constacyclic codes over R of length 14 are constructed. For the case of δ=1, all distinct self-dual (1+αu2)-constacyclic codes over R of length 2n are determined.  相似文献   

19.
20.
The paper investigates the properties of a class of resource allocation algorithms for communication networks: if a node of this network has L requests to transmit and is idle, it tries to access the channel at a rate proportional to log(1+L). A stochastic model of such an algorithm is investigated in the case of the star network, in which J nodes can transmit simultaneously, but interfere with a central node 0 in such a way that node 0 cannot transmit while one of the other nodes does. One studies the impact of the log policy on these J+1 interacting communication nodes. A fluid scaling analysis of the network is derived with the scaling parameter N being the norm of the initial state. It is shown that the asymptotic fluid behavior of the system is a consequence of the evolution of the state of the network on a specific time scale (Nt,t(0,1)). The main result is that, on this time scale and under appropriate conditions, the state of a node with index j1 is of the order of Naj(t), with 0aj(t)<1, where t?aj(t) is a piecewise linear function. Convergence results on the fluid time scale and a stability property are derived as a consequence of this study.  相似文献   

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

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