On the Integrability of Strong Maximal Functions Corresponding to Different Frames

For the frame in ⁿ, let B₂()()( ⁿ) be a family of all n-dimensional rectangles containing x and having edges parallel to the straight lines of , and let M_{B 2()} be a maximal operator corresponding to B ₂(). The main result of the paper is the following Theorem. For any function fL(1+1n⁺ L)( ⁿ ) (n2) there exists a measure preserving and invertible mapping ^{n n} such that

Pointwise Hardy inequalities

If is an open set with the sufficiently regular boundary, then the Hardy inequality holds for and , where . The main result of the paper is a pointwise inequality , where on the right hand side there is a kind of maximal function. The pointwise inequality combined with the Hardy-Littlewood maximal theorem implies the Hardy inequality. This generalizes some recent results of Lewis and Wannebo.

     

Finite generation of powers of ideals

Suppose is a maximal ideal of a commutative integral domain and that some power of is finitely generated. We show that is finitely generated in each of the following cases: (i) is of height one, (ii) is integrally closed and , (iii) is a monoid domain over a field , where is a cancellative torsion-free monoid such that , and is the maximal ideal . We extend the above results to ideals of a reduced ring such that is Noetherian. We prove that a reduced ring is Noetherian if each prime ideal of has a power that is finitely generated. For each with , we establish existence of a -dimensional integral domain having a nonfinitely generated maximal ideal of height such that is -generated.

     

n-极大子群为C-正规的有限群

首先,利用Hall子群的C－正规性,得到了有限群成为。可解群的一个充分条付,推广了Schur-Zassenhaus定理;其次,考查了 n－极大子群或其 2阶及 4阶循环子群为 C-正规对有限群结构的影响．     

有阻尼Sine－Gordon方程的全局吸引子的维数

本文通过引入新范数，得到有阻尼Ｓｉｎｅ－Ｇｏｒｄｏｎ方程的Ｄｉｒｉｃｈｌｅｔ问题的全局吸引子的维数的一个估计．结果表明：当“阻尼”与“扩散”同时增大或正弦项系数减小时，吸引子的维数减小．特别地，得到了零维吸引子存在的参数条件．     

A linear filtering problem in complete correlated actions

In the last paper, the geometry of the Sz.-Nagy-Foia model for contraction operators on Hilbert spaces was used to advantage in several problems of multivariate analysis. The lifting of intertwining operators, one of the basic results from the Sz.-Nagy-Foia theory, is now recognized as the most adequate operatorial form of the deep classical results of the extrapolation theory. The labeling of the exact intertwining dilations given by [1]Acta Sci. Math. (Szeged) 40 9–32] and the recursive methods used there open a broad perspective for using the Sz.-Nagy-Foia model in multivariate filtering theory. In this paper, using the notion of correlated action (see [5 and 6] Rev. Roumaine Math. Pures Appl. 23, No. 9 1393–1423]) as a time domain, a linear filtering problem is formulated and its solution in terms of the coefficients of the analytic function which factorizes the spectral distribution of the known data and the coefficients of an analytic function which describes the cross correlations is given. In some special cases it is shown that the filter coefficients can be determined using recursive methods from the intertwining dilation theory, of the autocorrelation function of the known data and an intertwining operator, interpreted as the initial estimator given by the prior statistics.     

Infrared Variables for the SU(3) Yang–Mills Field

We generalize the self-dual parameterization of the SU(2) Yang–Mills field proposed by Niemi and Faddeev for describing the infrared limit of the theory to the case of the gauge group SU(3). We demonstrate that the duality property intrinsic to the SU(2) gauge field cannot be transferred automatically to the higher-rank group case. We interpret the algebraic structures appearing in the Lagrangian for the new compact variables in terms of the group products SU(2)³.     

MODIFIED APPROXIMATE PROXIMAL POINT ALGORITHMS FOR FINDING ROOTS OF MAXIMAL MONOTONE OPERATORS

§1　Introduction and preliminariesA set T Rn×Rnis called a monotone operator on Rn,if T has the property(x,y) ,(x′,y′)∈T 〈x -x′,y -y′〉≥0 ,where〈·,·〉denotes the inner product on Rn.T is maximal if(considered as a graph) itis not strictly contained in any other monotone operator on Rn.It is well known that thetheory of maximal monotone operators plays an important role in the study of convexprogramming and variational inequalities since itcan provide a powerful general framework…     

Finding All Maximal Cliques in Dynamic Graphs

Clustering applications dealing with perception based or biased data lead to models with non-disjunct clusters. There, objects to be clustered are allowed to belong to several clusters at the same time which results in a fuzzy clustering. It can be shown that this is equivalent to searching all maximal cliques in dynamic graphs like G _t = (V,E _t), where E _{t – 1} E _t, t = 1,...,T; E ₀ = . In this article algorithms are provided to track all maximal cliques in a fully dynamic graph.     

A characterization of the finite simple groups with set of indices of their maximal subgroups

We study the problem concerning the influence of indices of maximal subgroups of a simple group on the structure of a group. We obtain a characterization property of all finite simple groups.