共查询到20条相似文献,搜索用时 31 毫秒
1.
Let u be a weak solution of (-△)mu = f with Dirichlet boundary conditions in a smooth bounded domain Ω Rn. Then, the main goal of this paper is to prove the following a priori estimate:‖u‖ Wω2 m,p(Ω) ≤ C ‖f‖ Lωp (Ω),where ω is a weight in the Muckenhoupt class Ap. 相似文献
2.
In this paper, the structure of the critical group of the graph K
m
× C
n
is determined, where m, n ≥ 3. 相似文献
3.
Crossing numbers of graphs are in general very difficult to compute. There are several known exact results on the crossing
number of the Cartesian products of paths, cycles or stars with small graphs. In this paper we study cr(Km □ Pn), the crossing number of the Cartesian product Km □ Pn. We prove that
for m ≥ 3,n ≥ 1 and cr(Km □ Pn)≥ (n − 1)cr(Km+2 − e) + 2cr(Km+1). For m≤ 5, according to Klešč, Jendrol and Ščerbová, the equality holds. In this paper, we also prove that the equality holds for
m = 6, i.e., cr(K6 □ Pn) = 15n + 3.
Research supported by NFSC (60373096, 60573022). 相似文献
4.
The minimum number of total independent partition sets of V ∪ E of graph G(V,E) is called the total chromatic number of G denoted by χ
t
(G). If the difference of the numbers of any two total independent partition sets of V ∪ E is no more than one, then the minimum number of total independent partition sets of V ∪ E is called the equitable total chromatic number of G, denoted by χ
et
(G). In this paper, we obtain the equitable total chromatic number of the join graph of fan and wheel with the same order.
Supported by the National Natural Science Foundation of China (No. 10771091). 相似文献
5.
Yong Hua Mao 《数学学报(英文版)》2009,25(12):2055-2064
Lp Poincare inequalities for general symmetric forms are established by new Cheeger's isoperimetric constants. Lp super-Poincare inequalities are introduced to describe the equivalent conditions for the Lp compact embedding, and the criteria via the new Cheeger's constants for those inequalities are presented. Finally, the concentration or the volume growth of measures for these inequalities are studied. 相似文献
6.
This paper is concerned with the study of the set P
-1(0), when P varies over all orthogonally additive polynomials on
p
and L
p
spaces. We apply our results to obtain characterizations of the weak-polynomial topologies associated to this class of polynomials. 相似文献
7.
This paper presents an approach using a recursive algorithm for packing (?, w)-rectangles into larger rectangular and L-shaped pieces. Such a problem has actual applications for non-guillotine cutting and pallet/container loading. Our motivation for developing the L-approach is based on the fact that it can solve difficult pallet loading instances. Indeed, it is able to solve all testing problems (more than 20 000 representatives of infinite equivalence classes of the literature), including the 18 hard instances unresolved by other heuristics. We conjecture that the L-approach always finds optimum packings of (?, w)-rectangles into rectangular pieces. Moreover, the approach may also be useful when dealing with cutting and packing problems involving L-shaped pieces. 相似文献
8.
Masao Fukushima 《Optimization Letters》2012,6(4):679-686
We present an SOR-type algorithm and a Jacobi-type algorithm that can effectively be applied to the ℓ
1 − ℓ
2 problem by exploiting its special structure. The algorithms are globally convergent and can be implemented in a particularly
simple manner. Relations with coordinate minimization methods are discussed. 相似文献
9.
We define and construct Ramanujan complexes. These are simplicial complexes which are higher dimensional analogues of Ramanujan graphs (constructed in [LPS]). They are obtained as quotients of the buildings of typeà d?1 associated with PGL d (F) whereF is a local field of positive characteristic. 相似文献
10.
Given an operator T : X → Y between Banach spaces, and a Banach lattice E consisting of measurable functions, we consider the point-wise extension of the operator to the vector-valued Banach lattices
T
E
: E(X) → E(Y) given by T
E
(f)(ω) = T(f(ω)). It is proved that for any Banach lattice E which does not contain c
0, the operator T is an isomorphism on a subspace isomorphic to c
0 if and only if so is T
E
. An analogous result for invertible operators on subspaces isomorphic to ℓ
1 is also given. 相似文献
11.
Emília Draženská 《Mathematica Slovaca》2011,61(5):675-686
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. The
crossing numbers of G□C
n
for some graphs G on five and six vertices and the cycle C
n
are also given. In this paper, we extend these results by determining the crossing number of the Cartesian product G □ C
n
, where G is a specific graph on six vertices. 相似文献
12.
Jingjing Ma 《Algebra Universalis》2011,65(4):341-351
It is shown that a unital finite-dimensional ℓ-simple ℓ-algebra with a distributive basis is isomorphic to a lattice-ordered matrix algebra with the entrywise lattice order over
a lattice-ordered twisted group algebra of a finite group with the coordinatewise lattice order. It is also shown that the
isomorphism is unique. 相似文献
13.
Yu. K. Dem’yanovich 《Journal of Mathematical Sciences》2009,156(4):577-588
A general approach to the construction of asymptotics of coordinate (not necessarily polynomial) B
φ
-splines of an arbitrary order is proposed. Asymptotic representations for Lagrange type third order B
φ
-splines are obtained. Bibliography: 4 titles.
Translated from Problemy Matematicheskogo Analiza, No. 38, December 2008, pp. 11–21. 相似文献
14.
The set of all non-increasing nonnegative integer sequences π = (d(v
1), d(v
2), …, d(v
n
)) is denoted by NS
n
. A sequence π ∈ NS
n
is said to be graphic if it is the degree sequence of a simple graph G on n vertices, and such a graph G is called a realization of π. The set of all graphic sequences in NS
n
is denoted by GS
n
. A graphical sequence π is potentially H-graphical if there is a realization of π containing H as a subgraph, while π is forcibly H-graphical if every realization of π contains H as a subgraph. Let K
k
denote a complete graph on k vertices. Let K
m
−H be the graph obtained from Km by removing the edges set E(H) of the graph H (H is a subgraph of K
m
). This paper summarizes briefly some recent results on potentially K
m
−G-graphic sequences and give a useful classification for determining σ (H, n). 相似文献
15.
Sh. M. Nasibov 《Mathematical Notes》2017,101(1-2):123-131
Sufficient conditions for the blow-up of nontrivial generalized solutions of the interior Dirichlet problem with homogeneous boundary condition for the homogeneous elliptic-type equation Δu + q(x)u = 0, where either q(x) ≠ const or q(x) = const= λ > 0, are obtained. A priori upper bounds (Theorem 4 and Remark 6) for the exact constants in the well-known Sobolev and Steklov inequalities are established. 相似文献
16.
Based on the prime graph of a finite simple group, its order is the product of its order components (see [4]). We prove that the simple groups PSU3(q) are uniquely determined by their order components. Our result immediately implies that the Thompsons conjecture and the Wujie Shis conjecture [16] are valid for these groups.AMS Subject Classification: 20D05, 20D60 相似文献
17.
Free completely <Emphasis Type="Italic">J</Emphasis><Superscript>(<Emphasis Type="Italic">ℓ</Emphasis>)</Superscript>-simple Semigroups
下载免费PDF全文
![点击此处可从《数学学报(英文版)》网站下载免费的PDF全文](/ch/ext_images/free.gif)
A semigroup is called completely J(ι)-simple if it is isomorphic to some Rees matrix semigroup over a left cancellative monoid and each entry of whose sandwich matrix is in the group of units of the left cancellative monoid. It is proved that completely J(ι)-simple semigroups form a quasivarity. Moreover, the construction of free completely J(ι)-simple semigroups is given. It is found that a free completely J(ι)-simple semigroup is just a free completely J *-simple semigroup and also a full subsemigroup of some completely simple semigroups. 相似文献
18.
R. Słowik 《印度理论与应用数学杂志》2017,48(3):323-334
We prove that if F is a field such that |F| > 2, then every bilocal automorphism of T ∞(F) - the algebra of ? × ? upper triangular matrices over F, is an automorphism. 相似文献
19.
We use the method of local representation and original method of Brauer to study the block with K(B)−L(B)=1, and get some properties on the defect group and the structure of this kind of blocks. Then, we show that K(B) conjecture holds for this kind of blocks. 相似文献
20.
Kenji Kamizono 《Proceedings of the Steklov Institute of Mathematics》2009,265(1):115-130
In this paper, we generalize the result of Bikulov and Volovich (1997) and construct a p-adic Brownian motion over ℚ
p
. First, we construct directly a p-adic white noise over ℚ
p
by using a specific complete orthonormal system of (ℚ
p
). A p-adic Brownian motion over ℚ
p
is then constructed by the Paley-Wiener method. Finally, we introduce a p-adic random walk and prove a theorem on the approximation of a p-adic Brownian motion by a p-adic random walk. 相似文献