A complete global solution to the pressure gradient equation

We study the domain of existence of a solution to a Riemann problem for the pressure gradient equation in two space dimensions. The Riemann problem is the expansion of a quadrant of gas of constant state into the other three vacuum quadrants. The global existence of a smooth solution was established in Dai and Zhang [Z. Dai, T. Zhang, Existence of a global smooth solution for a degenerate Goursat problem of gas dynamics, Arch. Ration. Mech. Anal. 155 (2000) 277-298] up to the free boundary of vacuum. We prove that the vacuum boundary is the coordinate axes.     

脂松香、石炭酸松香树脂和马林酸松香树脂的红外光谱剖析及鉴别

本文对脂松香、石炭酸松香树脂和马林酸松香树脂的红外光谱剖析及鉴别，方法快速，简便，准确。     

A new trigonometric method of summation and its application to the degree of approximation

The object of the present investigation is to introduce a new trigonometric method of summation which is both regular and Fourier effective and determine its status with reference to other methods of summation (see §2-§4) and also give an application of this method to determine the degree of approximation in a new Banach space of functions conceived as a generalized Holder metric (see §5).     

关于PFI-代数与剩余格

本文提出了一种强FI代数-PFI代数,并且深入研究了它的性质,借此进一步揭示了FI-代数和剩余格之间更加密切的联系,进而以FI-代数为基本框架建立了R0-代数、正则剩余格等逻辑系统的结构特征(包括对隅结构)及其相互关系．这种以FI-代数为基础来统一处理剩余格和R0-代数的方法,同样适合于格蕴涵代数和MV代数等代数结构,而且从中更能清楚地看出它们之间的密切联系,也将有助于对相应形式逻辑系统与模糊推理的研究．     

On the maximum cardinality search lower bound for treewidth

The Maximum Cardinality Search (MCS) algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbours becomes visited. A maximum cardinality search ordering (MCS-ordering) of a graph is an ordering of the vertices that can be generated by the MCS algorithm. The visited degree of a vertex v in an MCS-ordering is the number of neighbours of v that are before v in the ordering. The visited degree of an MCS-ordering ψ of G is the maximum visited degree over all vertices v in ψ. The maximum visited degree over all MCS-orderings of graph G is called its maximum visited degree. Lucena [A new lower bound for tree-width using maximum cardinality search, SIAM J. Discrete Math. 16 (2003) 345-353] showed that the treewidth of a graph G is at least its maximum visited degree.We show that the maximum visited degree is of size O(logn) for planar graphs, and give examples of planar graphs G with maximum visited degree k with O(k!) vertices, for all k∈N. Given a graph G, it is NP-complete to determine if its maximum visited degree is at least k, for any fixed k?7. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete.In this paper, we also propose some heuristics for the problem, and report on an experimental analysis of them. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the value of the maximum visited degree of a graph, which appear to give results close to optimal on many graphs from real life applications.     

A stable approach to the equivariant Hopf theorem

Let G be a finite group. For semi-free G-manifolds which are oriented in the sense of Waner [S. Waner, Equivariant RO(G)-graded bordism theories, Topology and its Applications 17 (1984) 1-26], the homotopy classes of G-equivariant maps into a G-sphere are described in terms of their degrees, and the degrees occurring are characterised in terms of congruences. This is first shown to be a stable problem, and then solved using methods of equivariant stable homotopy theory with respect to a semi-free G-universe.     

The inverse scattering problem for Schrödinger and Klein–Gordon equations with a nonlocal nonlinearity

We study the inverse scattering problem for the nonlinear Schrödinger equation and for the nonlinear Klein–Gordon equation with the generalized Hartree type nonlinearity. We reconstruct the nonlinearity from knowledge of the scattering operator, which improves the known results.     

Support problem for the intermediate Jacobians of l-adic representations

We consider the support problem of Erdös in the context of l-adic representations of the absolute Galois group of a number field. Main applications of the results of the paper concern Galois cohomology of the Tate module of abelian varieties with real and complex multiplications, the algebraic K-theory groups of number fields and the integral homology of the general linear group of rings of integers. We answer the question of Corrales-Rodrigáñez and Schoof concerning the support problem for higher dimensional abelian varieties.     

Effects of Moisture and Stresses on the Structure and Properties of Polyester Resin

The results of a complex study of structural changes in a cured Norpol 440 polyester resin under the action of damp environment and mechanical loading are presented. A considerable effect of absorbed moisture on the structure and some characteristics of the material is revealed by using thermophysical methods and X-ray diffractometry. The joint effect of moisture and mechanical stress is estimated by investigating the creep in stationary and nonstationary moisture conditions. The anisotropy of the material structure formed during creep is evaluated from the results of dilatometric measurements. It is found that the degree of anisotropy of the material after creep accompanied by moisture sorption is higher than that after creep in the conditions of moisture equilibrium with atmosphere. It is established that the aftercure and relaxation of the residual creep deformation come to an end at heating to 80-85°C. At a further rise in temperature and repeated heating, changes in the material structure are not observed.