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     

Multidimensional version of M. A. Krasnoseľskii’s generalized contraction principle

Let M be a complete K-metric space with n-dimensional metric ρ(x, y): M × M → R ⁿ , where K is the cone of nonnegative vectors in R ⁿ . A mapping F: M → M is called a Q-contraction if ρ (Fx,Fy) ⩽ Qρ (x,y), where Q: K → K is a semi-additive absolutely stable mapping. A Q-contraction always has a unique fixed point x* in M, and ρ(x*,a) ⩽ (I - Q)^-1 ρ(Fa, a) for every point a in M. The point x* can be obtained by the successive approximation method x _k = Fx _k-1, k = 1, 2,..., starting from an arbitrary point x ₀ in M, and the following error estimates hold: ρ (x*, x _k ) ⩽ Q ^k (I - Q)^-1ρ(x ₁, _x ⁰) ⩽ (I - Q)^-1 Q ^k ρ(x ₁, x ₀), k = 1, 2,.... Generally the mappings (I - Q)^-1 and Q ^k do not commute. For n = 1, the result is close to M. A. Krasnosel’skii’s generalized contraction principle.     

How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity?

 Let D be a semicomplete multipartite digraph, with partite sets V ₁, V ₂,…, V _c, such that |V ₁|≤|V ₂|≤…≤|V _c|. Define f(D)=|V(D)|−3|V _c|+1 and . We define the irregularity i(D) of D to be max|d ⁺(x)−d ⁻(y)| over all vertices x and y of D (possibly x=y). We define the local irregularity i _l(D) of D to be max|d ⁺(x)−d ⁻(x)| over all vertices x of D and we define the global irregularity of D to be i _g(D)=max{d ⁺(x),d ⁻(x) : x∈V(D)}−min{d ⁺(y),d ⁻(y) : y∈V(D)}. In this paper we show that if i _g(D)≤g(D) or if i _l(D)≤min{f(D), g(D)} then D is Hamiltonian. We furthermore show how this implies a theorem which generalizes two results by Volkmann and solves a stated problem and a conjecture from [6]. Our result also gives support to the conjecture from [6] that all diregular c-partite tournaments (c≥4) are pancyclic, and it is used in [9], which proves this conjecture for all c≥5. Finally we show that our result in some sense is best possible, by giving an infinite class of non-Hamiltonian semicomplete multipartite digraphs, D, with i _g(D)=i(D)=i _l(D)=g(D)+?≤f(D)+1. Revised: September 17, 1998     

On tense modules for extended algebras over rational fields

Let k(x) be the field of fractions of the polynomial algebra k[x] over the field k. We prove that, for an arbitrary finite dimensional k-algebra Λ, any finitely generated Λ ⊗_k k(x)-module M such that its minimal projective presentation admits no non-trivial selfextension is of the form M ≅ N^k(x), for some finitely generated Λ-module N. Some consequences are derived for tilting modules over the rational algebra Λ ⊗_k k(x) and for some generic modules for Λ. Received: 24 November 2003; revised: 11 February 2005     

Some properties of multivariate extreme value distributions and multivariate tail equivalence

Summary Denote byH ak-dimensional extreme value distribution with marginal distributionH _i (x)=Λ(x)=exp(−e ^−x ),x∈R ¹. Then it is proved thatH(x)=Λ(x ₁)...Λ(x _k ) for anyx=(x ₁, ...,x _k ) ∈R ^k , if and only if the equation holds forx=(0,...,0). Next some multivariate extensions of the results by Resnick (1971,J. Appl. Probab.,8, 136–156) on tail equivalence and asymptotic distributions of extremes are established.     

Non-spectral problem for a class of planar self-affine measures

The self-affine measure μM,D corresponding to an expanding matrix M∈Mn(R) and a finite subset D⊂Rn is supported on the attractor (or invariant set) of the iterated function system {?d(x)=M⁻¹(x+d)}_d∈D. The spectral and non-spectral problems on μM,D, including the spectrum-tiling problem implied in them, have received much attention in recent years. One of the non-spectral problem on μM,D is to estimate the number of orthogonal exponentials in L²(μM,D) and to find them. In the present paper we show that if a,b,c∈Z, |a|>1, |c|>1 and ac∈Z?(3Z),

     

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     

Growth and Hölder conditions for the sample paths of Feller processes

Let (A,D(A)) be the infinitesimal generator of a Feller semigroup such that C _c ^∞(ℝ ⁿ )⊂D(A) and A|C _c ^∞(ℝ ⁿ ) is a pseudo-differential operator with symbol −p(x,ξ) satisfying |p(•,ξ)|_∞≤c(1+|ξ|²) and |Imp(x,ξ)|≤c ₀Rep(x,ξ). We show that the associated Feller process {X _t } _{t ≥0} on ℝ ⁿ is a semimartingale, even a homogeneous diffusion with jumps (in the sense of [21]), and characterize the limiting behaviour of its trajectories as t→0 and ∞. To this end, we introduce various indices, e.g., β_∞ ^x :={λ>0:lim _{|ξ|→∞ | x − y |≤2/|ξ|}|p(y,ξ)|/|ξ|^λ=0} or δ_∞ ^x :={λ>0:liminf _{|ξ|→∞ | x − y |≤2/|ξ| |ε|≤1}|p(y,|ξ|ε)|/|ξ|^λ=0}, and obtain a.s. (ℙ ^x ) that lim _{t →0} t ^−1/λ _{s ≤ t} |X _s −x|=0 or ∞ according to λ>β_∞ ^x or λ<δ_∞ ^x . Similar statements hold for the limit inferior and superior, and also for t→∞. Our results extend the constant-coefficient (i.e., Lévy) case considered by W. Pruitt [27]. Received: 21 July 1997 / Revised version: 26 January 1998     

Diophantinc approximation by linear forms on manifolds

The following Khintchine-type theorem is proved for manifoldsM embedded in ℝ ^k which satisfy some mild curvature conditions. The inequality |q·x| <Ψ(|q|) whereΨ(r) → 0 asr → ∞ has finitely or infinitely many solutionsqεℤ ^k for almost all (in induced measure) points x onM according as the sum Σ _r ^{= 1/∞} Ψ(r)r ^k−2 converges or diverges (the divergent case requires a slightly stronger curvature condition than the convergent case). Also, the Hausdorff dimension is obtained for the set (of induced measure 0) of point inM satisfying the inequality infinitely often whenψ(r) =r ^−t . τ >k − 1.     

Large deviations and continuum limit in the 2D Ising model

Summary. We study the 2D Ising model in a rectangular box Λ _L of linear size O(L). We determine the exact asymptotic behaviour of the large deviations of the magnetization ∑ _t∈ΛL σ(t) when L→∞ for values of the parameters of the model corresponding to the phase coexistence region, where the order parameter m ^* is strictly positive. We study in particular boundary effects due to an arbitrary real-valued boundary magnetic field. Using the self-duality of the model a large part of the analysis consists in deriving properties of the covariance function <σ(0)σ(t)>, as |t|→∞, at dual values of the parameters of the model. To do this analysis we establish new results about the high-temperature representation of the model. These results are valid for dimensions D≥2 and up to the critical temperature. They give a complete non-perturbative exposition of the high-temperature representation. We then study the Gibbs measure conditioned by {|∑ _t∈ΛL σ(t) −m|Λ _L ||≤|Λ _L |L ^{− c} }, with 0<c<1/4 and −m ^*<m<m ^*. We construct the continuum limit of the model and describe the limit by the solutions of a variational problem of isoperimetric type. Received: 17 October 1996 / In revised form: 7 March 1997     

Hamilton cycles,avoiding prescribed arcs,in close-to-regular tournaments

The local irregularity of a digraph D is defined as i_l(D) = max {|d⁺ (x) − d⁻ (x)| : x ϵ V(D)}. Let T be a tournament, let Γ = {V₁, V₂, …, V_c} be a partition of V(T) such that |V₁| ≥ |V₂| ≥ … ≥ |V_c|, and let D be the multipartite tournament obtained by deleting all the arcs with both end points in the same set in Γ. We prove that, if |V(T)| ≥ max{2i_l(T) + 2|V₁| + 2|V₂| − 2, i_l(T) + 3|V₁| − 1}, then D is Hamiltonian. Furthermore, if T is regular (i.e., i_l(T) = 0), then we state slightly better lower bounds for |V(T)| such that we still can guarantee that D is Hamiltonian. Finally, we show that our results are best possible. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 123–136, 1999     

Superstability of the generalized orthogonality equation on restricted domains

Chmielinski has proved in the paper [4] the superstability of the generalized orthogonality equation |〈f(x), f(y)〉| = |〈x,y〉|. In this paper, we will extend the result of Chmielinski by proving a theorem: LetD _n be a suitable subset of ℝⁿ. If a function f:D _n → ℝⁿ satisfies the inequality ∥〈f(x), f(y)〉| |〈x,y〉∥ ≤ φ(x,y) for an appropriate control function φ(x, y) and for allx, y ∈ D _n, thenf satisfies the generalized orthogonality equation for anyx, y ∈ D _n.     

On one representation of analytic functions by harmonic functions

Let u(x) be a function analytic in some neighborhood D about the origin, $ \mathcal{D} Let u(x) be a function analytic in some neighborhood D about the origin, ⊂ ℝ ⁿ . We study the representation of this function in the form of a series u(x) = u ₀(x) + |x|² u ₁(x) + |x|⁴ u ₂(x) + …, where u _k (x) are functions harmonic in . This representation is a generalization of the well-known Almansi formula. Original Russian Text ? V. V. Karachik, 2007, published in Matematicheskie Trudy, 2007, Vol. 10, No. 2, pp. 142–162.     

Coloring of distance graphs with intervals as distance sets

Let D be a set of positive integers. The distance graph G(Z,D) with distance set D is the graph with vertex set Z in which two vertices x,y are adjacent if and only if |x−y|D. The fractional chromatic number, the chromatic number, and the circular chromatic number of G(Z,D) for various D have been extensively studied recently. In this paper, we investigate the fractional chromatic number, the chromatic number, and the circular chromatic number of the distance graphs with the distance sets of the form D_m,[k,k^′]={1,2,…,m}−{k,k+1,…,k^′}, where m, k, and k^′ are natural numbers with m≥k^′≥k. In particular, we completely determine the chromatic number of G(Z,D_m,[2,k^′]) for arbitrary m, and k^′.     

Integral distance graphs

Suppose D is a subset of all positive integers. The distance graph G(Z, D) with distance set D is the graph with vertex set Z, and two vertices x and y are adjacent if and only if |x − y| ≡ D. This paper studies the chromatic number χ(Z, D) of G(Z, D). In particular, we prove that χ(Z, D) ≤ |D| + 1 when |D| is finite. Exact values of χ(G, D) are also determined for some D with |D| = 3. © 1997 John Wiley & Sons, Inc. J Graph Theory 25: 287–294, 1997     

Accuracy of several multidimensional refinable distributions

Compactly supported distributions f₁,..., f_r on ℝ^d are fefinable if each f_i is a finite linear combination of the rescaled and translated distributions f_j(Ax−k), where the translates k are taken along a lattice Γ ⊂ ∝^d and A is a dilation matrix that expansively maps Γ into itself. Refinable distributions satisfy a refinement equation f(x)=Σ_k∈Λ c_k f(Ax−k), where Λ is a finite subset of Γ, the c_k are r×r matrices, and f=(f₁,...,f_r)^T. The accuracy of f is the highest degree p such that all multivariate polynomials q with degree(q)<p are exactly reproduced from linear combinations of translates of f₁,...,f_r along the lattice Γ. We determine the accuracy p from the matrices c_k. Moreover, we determine explicitly the coefficients y_α,i(k) such that x^α=Σ _i=1 ^r Σ_k∈Γy_α,i(k) fi(x+k). These coefficients are multivariate polynomials y_α,i(x) of degree |α| evaluated at lattice points k∈Γ.     

On Sums of Two Coprime k-th Powers(II)

For fixed k ≥ 3, let E_k(x) denote the error term of the sum ?_{n ￡ x}r_k(n)\sum_{n\le x}\rho_k(n) , where r_k(n) = ?_{n=|m|^k+|l|^k, g.c.d.(m,l)=1}\rho_k(n) = \sum_{n=|m|^k+|l|^k, g.c.d.(m,l)=1} 1. It is proved that if the Riemann hypothesis is true, then E₃(x) << x^331/1254+eE_3(x)\ll x^{331/1254+\varepsilon} , E₄(x) << x^37/184+eE_4(x)\ll x^{37/184+\varepsilon} . A short interval result is also obtained.     

Homotopy Types of Stabilizers and Orbits of Morse Functions on Surfaces

Let M be a smooth compact surface, orientable or not, with boundary or without it, P either the real line ℝ ¹ or the circle S ¹, and D(M) the group of diffeomorphisms of M acting on C^∞(M, P) by the rule h⋅ f = f ∘ h ⁻¹ for h ∊ D(M) and f ∊ C^∞ (M,P). Let f: M → P be an arbitrary Morse mapping, Σ _f the set of critical points of f, D(M,Σ _f ) the subgroup of D(M) preserving Σ _f , and S(f), S (f,Σ _f ), O(f), and O(f,Σ _f ) the stabilizers and the orbits of f with respect to D(M) and D(M,Σ _f ). In fact S(f) = S(f,Σ _f ).In this paper we calculate the homotopy types of S(f), O(f) and O(f,Σ _f ). It is proved that except for few cases the connected components of S(f) and O(f,Σ _f ) are contractible, π _k O(f) = π _k M for k ≥ 3, π₂ O(f) = 0, and π₁ O(f) is an extension of π₁ D(M) ⊕ Z ^k (for some k ≥ 0) with a (finite) subgroup of the group of automorphisms of the Kronrod-Reeb graph of f.We also generalize the methods of F. Sergeraert to give conditions for a finite codimension orbit of a tame smooth action of a tame Lie group on a tame Fréchet manifold to be a tame Fréchet manifold itself. In particular, we obtain that O(f) and O(f, Σ _f ) are tame Fréchet manifolds. Communicated by Peter Michor Vienna Mathematics Subject Classifications (2000): 37C05, 57S05, 57R45.     

Uniform estimates for order statistics and Orlicz functions

We establish uniform estimates for order statistics: Given a sequence of independent identically distributed random variables ξ ₁, … , ξ _n and a vector of scalars x = (x ₁, … , x _n ), and 1 ≤ k ≤ n, we provide estimates for \mathbb E   k-min_{1 ￡ i ￡ n} |x_ix_i|{\mathbb E \, \, k-{\rm min}_{1\leq i\leq n} |x_{i}\xi _{i}|} and \mathbb E k-max_{1 ￡ i ￡ n}|x_ix_i|{\mathbb E\,k-{\rm max}_{1\leq i\leq n}|x_{i}\xi_{i}|} in terms of the values k and the Orlicz norm ||y_x||_M{\|y_x\|_M} of the vector y _x  = (1/x ₁, … , 1/x _n ). Here M(t) is the appropriate Orlicz function associated with the distribution function of the random variable |ξ ₁|, G(t) = \mathbb P ({ |x₁| ￡ t}){G(t) =\mathbb P \left(\left\{ |\xi_1| \leq t\right\}\right)}. For example, if ξ ₁ is the standard N(0, 1) Gaussian random variable, then G(t) = ?{\tfrac2p}ò₀^t e^-\fracs22ds {G(t)= \sqrt{\tfrac{2}{\pi}}\int_{0}^t e^{-\frac{s^{2}}{2}}ds }  and M(s)=?{\tfrac2p}ò₀^se^-\frac12t2dt{M(s)=\sqrt{\tfrac{2}{\pi}}\int_{0}^{s}e^{-\frac{1}{2t^{2}}}dt}. We would like to emphasize that our estimates do not depend on the length n of the sequence.