On finite retract lattices of monounary algebras

For a monounary algebra (A, f) we denote R ^∅(A, f) the system of all retracts (together with the empty set) of (A, f) ordered by inclusion. This system forms a lattice. We prove that if (A, f) is a connected monounary algebra and R ^∅(A, f) is finite, then this lattice contains no diamond. Next distributivity of R ^∅(A, f) is studied. We find a representation of a certain class of finite distributive lattices as retract lattices of monounary algebras.     

Lattices of subrepresentations of Lie algebras and their isomorphisms

To obtain the representation (L, R) of Lie algebras over the ring Λ, we construct the lattice of subrepresentations ℒ(L, R). Relations between the algebras L and R and the lattice ℒ(L, R) are studied. It turns out that in some cases the isomorphism of the lattice ℒ(L, R) can be continued so as to obtain a wider sublattice ℒ(LλR) consisting of subalgebras of a semidirect product LλR. __________ Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 46, Algebra, 2007.     

Punishing Factors for Finitely Connected Domains

Let Ω and Π be two finitely connected hyperbolic domains in the complex plane \Bbb C{\Bbb C} and let R(z, Ω) denote the hyperbolic radius of Ω at z and R(w, Π) the hyperbolic radius of Π at w. We consider functions f that are analytic in Ω and such that all values f(z) lie in the domain Π. This set of analytic functions is denoted by A(Ω, Π). We prove among other things that the quantities C_n(W,P) := sup_{f ? A(W,P)}sup_{z ? W}\frac|f⁽ⁿ⁾(z)| R(f(z),P)n! (R(z,W))ⁿC_n(\Omega,\Pi)\,:=\,\sup_{f\in A(\Omega,\Pi)}\sup_{z\in \Omega}\frac{\vert f^{(n)}(z)\vert\,R(f(z),\Pi)}{n!\,(R(z,\Omega))^n} are finite for all n ? \Bbb N{n \in {\Bbb N}} if and only if ∂Ω and ∂Π do not contain isolated points.     

Monotone perturbations of the laplacian inL 1(R N )

The semilinear perturbation of Poisson’s equation (E): −Δu+β(u)∋f, where β is a maximal monotone graph inR, has been investigated by Ph. Bénilan, H. Brézis and M. Crandall forf∈L ¹(R ^N ),N≧1, under the assumptions 0∈β(0) ifN≧3 and 0∈β(0) ∩ Int β(R) ifN=1,2. We discuss in this paper the solvability and well-posedness of (E) in terms of any maximal monotone graph β. In particular, if β takes only positive values andN≧3 we prove that no solution exists; ifN=2 we give necessary and sufficient conditions on β andf for (E) to be solvable in a natural sense.     

Stability of <Emphasis Type="Italic">C</Emphasis>-regularized Semigroups

Let T = (T(t))t≥0 be a bounded C-regularized semigroup generated by A on a Banach space X and R(C) be dense in X. We show that if there is a dense subspace Y of X such that for every x ∈ Y, σu(A, Cx), the set of all points λ ∈ iR to which (λ - A)^-1 Cx can not be extended holomorphically, is at most countable and σr(A) N iR = Ф, then T is stable. A stability result for the case of R(C) being non-dense is also given. Our results generalize the work on the stability of strongly continuous senfigroups.     

A descent method for submodular function minimization

We show a descent method for submodular function minimization based on an oracle for membership in base polyhedra. We assume that for any submodular function f: ?→R on a distributive lattice ?⊆2 ^V with ?,V∈? and f(?)=0 and for any vector x∈R ^V where V is a finite nonempty set, the membership oracle answers whether x belongs to the base polyhedron associated with f and that if the answer is NO, it also gives us a set Z∈? such that x(Z)>f(Z). Given a submodular function f, by invoking the membership oracle O(|V|²) times, the descent method finds a sequence of subsets Z ₁,Z ₂,···,Z _k of V such that f(Z ₁)>f(Z ₂)>···>f(Z _k )=min{f(Y) | Y∈?}, where k is O(|V|²). The method furnishes an alternative framework for submodular function minimization if combined with possible efficient membership algorithms. Received: September 9, 2001 / Accepted: October 15, 2001?Published online December 6, 2001     

On double sine and cosine transforms,Lipschitz and Zygmund classes

We consider complex-valued functions f ∈ L 1 (R+2),where R +:= [0,∞),and prove sufficient conditions under which the double sine Fourier transform f ss and the double cosine Fourier transform f cc belong to one of the two-dimensional Lipschitz classes Lip(α,β) for some 0 α,β≤ 1;or to one of the Zygmund classes Zyg(α,β) for some 0 α,β≤ 2.These sufficient conditions are best possible in the sense that they are also necessary for nonnegative-valued functions f ∈ L 1 (R+2).     

环域上一类拟线性椭圆型方程的正径向解的存在性

The existence of positive radial solutions of the equation -din( |Du|p-2Du)=f(u) is studied in annular domains in Rn,n≥2. It is proved that if f(0)≥0, f is somewherenegative in (0,∞), limu→0^ f‘ (u)=0 and limu→∞ (f(u)/u^p-1)=∞, then there is alarge positive radial solution on all annuli. If f(0)≤0 and satisfies certain conditions, then the equation has no radial solution if the annuli are too wide.     

Characterising the Accuracy of Multivariable Refinable Functions via the Symbol Function

Suppose that f(x) = (f ₁(x),...,f _r (x)) ^T , x∈R ^d is a vector-valued function satisfying the refinement equation f(x) = ∑_Λ c _κ f(2x−κ) with finite set Λ of Z ^d and some r×r matricex c _κ. The requirements for f to have accuracy p are given in terms of the symbol function m(ξ). Supported by NSFC     

Colouring Arcwise Connected Sets in the Plane I

Let ? be the family of finite collections ? where ? is a collection of bounded, arcwise connected sets in ℝ² which for any S, T∈? where S∩T≠∅, it holds that S∩T is arcwise connected. We investigate the problem of bounding the chromatic number of the intersection graph G of a collection ?∈?.  Assuming G is triangle-free, suppose there exists a closed Jordan curve C⊂ℝ² such that C intersects all sets of ? and for all S∈?, the following holds: (i) S∩(C∪int (C)) is arcwise connected or S∩int (C)=∅. (ii) S∩(C∪ext (C)) is arcwise connected or S∩ext (C)=∅.  Here int(C) and ext (C) denote the regions in the interior, resp. exterior, of C. Such being the case, we shall show that χ(?) is bounded by a constant independent of ?. Revised: December 3, 1998     

On Lefschetz series

Let R = ⊕ _i=0^∞ R ⁱ be a connected graded commutative algebra over the field ℚ of rational numbers, and let f be a graded endomorphism of R. In this paper, we show that the Lefschetz series of f can be computed directly from the induced linear map Q(f) on the ℚ vector space of indecomposables of R. We give an explicit algorithm to compute the Lefschetz series of f from Q(f). The main tool we used is the graded algebra version of Gr?bner basis theory. At the end of this paper, some examples and applications are given.     

Regularity of Poisson equation in some logarithmic space

In this note, the regularity of Poisson equation -△u = f with f lying in logarithmic function space Lp(LogL)a(Ω)(1＜p ＜∞, a ∈ R) is studied. The result of the note generalizes the W2,p estimate of Poisson equation in Lp(Ω).     

A note on the existence of singular integrals

Abstract. In this note the existence of a singular integral operator T acting on Lipo(R“) spacesis studied. Suppose     

Non-oscillating Paley-Wiener functions

A non-oscillating Paley-Wiener function is a real entire functionf of exponential type belonging toL ₂(R) and such that each derivativef ⁽ⁿ⁾,n=0, 1, 2,…, has only a finite number of real zeros. It is established that the class of such functions is non-empty and contains functions of arbitrarily fast decay onR allowed by the convergence of the logarithmic integral. It is shown that the Fourier transform of a non-oscillating Paley-Wiener function must be infinitely differentiable outside the origin. We also give close to best possible asymptotic (asn→∞) estimates of the number of real zeros of then-th derivative of a functionf of the class and the size of the smallest interval containing these zeros.     

Embedding a polytope in a lattice

We present a special similarity ofR ⁴ⁿ which maps lattice points into lattice points. Applying this similarity, we prove that if a (4n−1)-polytope is similar to a lattice polytope (a polytope whose vertices are all lattice points) inR ⁴ⁿ , then it is similar to a lattice polytope inR ⁴ⁿ⁻¹, generalizing a result of Schoenberg [4]. We also prove that ann-polytope is similar to a lattice polytope in someR ^N if and only if it is similar to a lattice polytope inR ²ⁿ⁺¹, and if and only if sin²(<ABC) is rational for any three verticesA, B, C of the polytope.     

The minimizing of the Nielsen root classes

Given a map f: X→Y and a Nielsen root class, there is a number associated to this root class, which is the minimal number of points among all root classes which are H-related to the given one for all homotopies H of the map f. We show that for maps between closed surfaces it is possible to deform f such that all the Nielsen root classes have cardinality equal to the minimal number if and only if either N R[f]≤1, or N R[f]>1 and f satisfies the Wecken property. Here N R[f] denotes the Nielsen root number. The condition “f satisfies the Wecken property is known to be equivalent to |deg(f)|≤N R[f]/(1−χ(M ₂)−χ(M ₁0/(1−χ(M ₂)) for maps between closed orientable surfaces. In the case of nonorientable surfaces the condition is A(f)≤N R[f]/(1−χ(M ₂)−χ(M ₂)/(1−χ(M ₂)). Also we construct, for each integer n≥3, an example of a map f: K _n →N from an n-dimensionally connected complex of dimension n to an n-dimensional manifold such that we cannot deform f in a way that all the Nielsen root classes reach the minimal number of points at the same time.     

On the Fractional Intersection Number of a Graph

 An intersection representation of a graph G is a function f:V(G)→2^S (where S is any set) with the property that uv∈E(G) if and only if f(u)∩f(v)≠∅. The size of the representation is |S|. The intersection number of G is the smallest size of an intersection representation of G. The intersection number can be expressed as an integer program, and the value of the linear relaxation of that program gives the fractional intersection number. This is in consonance with fractional versions of other graph invariants such as matching number, chromatic number, edge chromatic number, etc.  We examine cases where the fractional and ordinary intersection numbers are the same (interval and chordal graphs), as well as cases where they are wildly different (complete multipartite graphs). We find the fractional intersection number of almost all graphs by considering random graphs. Received: July 1, 1996 Revised: August 11, 1997