Now showing items 1139-1158 of 2622

• #### p-Laplace方程解的渐近性质 ﻿

(中国科学（ A辑， 数学）, 2006-12)
对p-Laplace方程讨论了当p趋于无穷时解的渐近性质
• #### p-调和逼近方法和可控增长条件下能量极小p-调和映射的最优内部正则性 ﻿

(2006-11-20)
考虑能量极小p-调和映射的弱解在可控增长条件下的部分正则性,结合p-调和逼近引理和Tan及Yan在处理退缩椭圆方程组和障碍问题中得到decay估计的方法得到了弱解的部分正则性,并且得到的正则性结果中的指标是最优的．
• #### ${P_5}$群的Chermak-Delgado格 ﻿

(2017)
简称Chermak-Delgado格为CD格,${\rm{CD}}\left( G \right)$代表群G的CD格.若$\left| G; \right.\left| { = {p^n},} \right.\left| {G:Z\left( G \right)\left| { =; {p^i},G \in } \right.CD\left( G \right)}; \right.$,则称$G$是${P_i}$群.研究了\$\left| ...
• #### Pancyclism of 3-domination-critical graphs with small minimum degree ﻿

(2008-03)
A graph G is 3-domination-critical if its domination number gamma is 3 and the addition of any edge decreases gamma by 1. Let G be a connected 3-domination-critical graph of order n. Shao etc. proved that if delta(G) >= 3 ...
• #### Parafermion vertex operator algebras ﻿

(FRONT MATH CHINA, 2011-08)
This paper reviews some recent results on the parafermion vertex operator algebra associated to the integrable highest weight module L(k, 0) of positive integer level k for any affine Kac-Moody Lie algebra (g) over cap, ...
• #### PARALLEL IN TIME ALGORITHM WITH SPECTRAL-SUBDOMAIN ENHANCEMENT FOR VOLTERRA INTEGRAL EQUATIONS ﻿

(SIAM PUBLICATIONS, 2013)
This paper proposes a parallel in time (also called time parareal) method to solve Volterra integral equations of the second kind. The parallel in time approach follows the spirit of the domain decomposition that consists ...
• #### Parallel spectral-element direction splitting method for incompressible Navier-Stokes equations ﻿

(Elsevier, 2014 Octob)
An efficient parallel algorithm for the time dependent incompressible Navier-Stokes equations is developed in this paper. The time discretization is based on a direction splitting method which only requires solving a ...
• #### Parameter estimation and subset selection for separable lower triangular bilinear models ﻿

(J TIME SER ANAL, 2005-09)
Parameter estimation and subset selection for separable lower triangular bilinear (SLTBL) models are considered. Under a flat prior, we present an expectation-maximization (EM) algorithm to obtain the maximum likelihood ...
• #### Perfect matchings and ears in elementary bipartite graphs ﻿

(1997-11-15)
We give lower and upper bounds for the number of reducible ears as well as upper bounds for the number of perfect matchings in an elementary bipartite graph. An application to chemical graphs is also discussed. In addition, ...
• #### PERFECT MATCHINGS IN HEXAGONAL SYSTEMS ﻿

(1985)
A simple algorithm is developed which allows to decide whether or not a given hexagonal system has a perfect matching (and to find such a matching). This decision is also of chemical relevance since a hexagonal system is ...
• #### Perfect matchings of polyomino graphs ﻿

(1997)
This paper gives necessary and sufficient conditions for a polyomino graph to have a perfect matching and to be elementary, respectively. As an application, we can decompose a non-elementary polyomino with perfect matchings ...
• #### Perron complement and Perron root ﻿

(2002-01-15)
For a nonnegative irreducible matrix A, this paper is concerned with the estimation and determination of the unique Perron root or spectral radius of A. We present a new method that utilizes the relation between Perron ...
• #### Perturbations of Frames ﻿

(SPRINGER HEIDELBERG, 2014 JUL)
In this paper, we give some sufficient conditions under which perturbations preserve Hilbert frames and near-Riesz bases. Similar results are also extended to frame sequences, Riesz sequences and Schauder frames. It is ...
• #### Pessimistic portfolio choice with one safe and one risky asset and right monotone probability difference order ﻿

(Hindawi Publishing Corporation, 2013)
As is well known, a first-order dominant deterioration in risk does not necessarily cause a risk-averse investor to reduce his holdings of that deteriorated asset under the expected utility framework, even in the simplest ...
• #### Pfaffian graphs embedding on the torus ﻿

(SCIENCE PRESS, 2013)
An orientation of a graph G with even number of vertices is Pfaffian if every even cycle C such that G - V (C) has a perfect matching has an odd number of edges directed in either direction of the cycle. The significance ...
• #### Pfaffian orientation and enumeration of perfect matchings for some Cartesian products of graphs ﻿

(2009-04-30)
The importance of Pfaffian orientations stems from the fact that if a graph G is Pfaffian, then the number of perfect matchings of G (as well as other related problems) can be computed in polynomial time. Although there ...
• #### Pfaffian orientations for a type of bipartite graph ﻿

(ELSEVIER SCIENCE BV, 2014-03-27)
An even cycle C of a graph G is nice if the graph G - V(C) has a perfect matching. An orientation of G is a Pfaffian orientation if every nice cycle of G has an odd number of edges directed in either direction of the cycle. ...
• #### Phosphorescence study of 1-bromonaphthalene in aerated aqueous solution of surfactant and beta-cyclodextrin ﻿

(1998-01-15)
Surfactant (S) induced room-temperature phosphorescence (RTP) from 1-bromonaphthalene (1-BrN) in aerated aqueous solution of beta-cyclodextrin (beta-CD) has been investigated in detail. Benesi-Hildebrand analyses indicate ...
• #### Phosphorescence-probed study on the association of surfactants with beta-cyclodextrin (vol 268, pg 31, 1997) ﻿

(1997-11-21)
The formation of association complexes between surfactants (S) and beta-cyclodextrin (beta-CD) has been studied using 1-bromonaphthalene (1-BrN) as a phosphorescent probe. In combination with the spectral structure, ...
• #### Planar k-cycle resonant graphs with k=1,2 ﻿

(2003-08-01)
A connected graph is said to be k-cycle resonant if, for 1 less than or equal to t less than or equal to k, any t disjoint cycles in G are mutually resonant, that is, there is a perfect matching M of G such that each of ...