Separable Bimodules and Approximation

Using approximations, we give several characterizations of separability of bimodules. We also discuss how separability properties can be used to transfer some representation theoretic properties from one ring to another: contravariant finiteness of the subcategory of (finitely generated) left modules with finite projective dimension, finitistic dimension, finite representation type, Auslander algebra, tame or wild representation type. Presented by A. VerschorenMathematics Subjects Classifications (2000) 16L60, 16H05, 16G10.Research supported by the bilateral project BIL99/43 “New computational, geometric and algebraic methods applied to quantum groups and diffferential operators” of the Flemish and Chinese governments.     

Strict Mittag‐Leffler modules

We characterize strict Mittag‐Leffler modules in terms of free realizations of positive primitive formulas, and rings over which (pure‐) projectives are trivial in terms of various notions of separability of (flat) strict Mittag‐Leffler modules. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

On Azumaya Graphs

We study Azumaya multiplicative graphs over a suitable base category, generalizing in this way the theory of Azumaya algebras over a ring, with or without unit, and the theory of enriched Azumaya categories. We exhibit the links with the corresponding notions of centrality, separability, Brauer group and Brauer–Taylor group.     

Subgroup separability of graphs of abelian groups

In the present paper we give necessary and sufficient conditions for the subgroup separability of the fundamental group of a finite graph of groups with finitely generated abelian vertex groups.

     

Computing the complexity of the relation of isometry between separable Banach spaces

We compute here the Borel complexity of the relation of isometry between separable Banach spaces, using results of Gao, Kechris [2], Mayer‐Wolf [5], and Weaver [8]. We show that this relation is Borel bireducible to the universal relation for Borel actions of Polish groups. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the separability of subproblems in Benders decompositions

Benders decomposition is a well-known procedure for solving a combinatorial optimization problem by defining it in terms of a master problem and a slave problem. Its effectiveness relies, among other factors, on the possibility of synthesizing Benders cuts that rule out not only one, but a large class of trial values for the master problem. In turn, for the class of problems we consider (i.e., optimization plus constraint satisfaction) the possibility of separating the slave problem into several subproblems—i.e., problems exhibiting strong intra-relationships and weak inter-relationships—can be exploited for improving searching procedures efficiency. The notion of separation is typically given informally, or relying on syntactical aspects. This paper formally addresses the notion of slave problem separability by giving a semantic definition and exploring it from the computational point of view. Several examples of separable problems are provided, including some proving that a semantic notion of separability is much more helpful than a syntactic one. We show that separability can be formally characterized as equivalence of logical formulae, and prove the undecidability of the separability check problem. Finally, we show how there are cases where automated tools can still be used for checking subproblem separability.     

可分离凸优化问题的非精确平行分裂算法

针对一类可分离凸优化问题提出了一种非精确平行分裂算法.该算法充分利用了所求解问题的可分离结构,并对子问题进行非精确求解.在适当的条件下,证明了所提出的非精确平行分裂算法的全局收敛性,初步的数值实验说明了算法有效性.     

AN EXTENSION OF PREDICTOR-CORRECTOR ALGORITHM TO A CLASS OF CONVEX SEPARABLE PROGRAM

1.IntroductionIn[1]Mizuno,ToddandYepresentedapredictor-correctoralgorithmforlinearpramgrammingwhichpossessesaquadraticconvergencerateofthedualgaptozero.GuoandWul6]gaveamodificationofthisalgorithmforsolvingconvexquadraticprogramwithupperbounds.Itisshownthatthemodifiedmethodnotonlypreservesalltheoriginalmerits,butalsoreducesthedualgapbyaconstantfactorineachcorrectorstep,incontrasttotheMizuno,TOddandYe'soriginalpredictor--correctormethodwherethedualgapremainsunchanged.Thealgorithmdiscussedint…     

Variations on selective separability in non-regular spaces

We study various variations on selective separability in non-regular topological spaces. We use the notions of θ-closure and θ-density to define selective versions of θ-separability. These properties are also related to topological games.     

Weak and strong structures and the {T_{3.5}} property for generalized topological spaces

We study selective and game-theoretic versions of properties like the ccc, weak Lindelöfness and separability, giving various characterizations of them and exploring connections between these properties and some classical cardinal invariants of the continuum.     

A simple method to find out when an ordinary differential equation is separable

In many statistical discussions, especially in data analysis, the idea of polynomials plays a key role. For example, Dwyer [1] employed polynomials to express factorial moments of discrete distribution in terms of cumulative totals. Traditionally, polynomials are derived using the difference operator method (see [2], p. 134]). In this article, using the differential equation approach as an alternative method, we obtain generalized exponential and logarithmic polynomials, and find their special cases appearing in statistical signal‐noise models.     

Selective separability and its variations

A space X is said to be selectively separable (=M-separable) if for each sequence {Dn:n∈ω} of dense subsets of X, there are finite sets Fn⊂Dn (n∈ω) such that ?{Fn:n∈ω} is dense in X. On selective separability and its variations, we show the following: (1) Selective separability, R-separability and GN-separability are preserved under finite unions; (2) Assuming CH (the continuum hypothesis), there is a countable regular maximal R-separable space X such that X² is not selectively separable; (3) c{0,1} has a selectively separable, countable and dense subset S such that the group generated by S is not selectively separable. These answer some questions posed in Bella et al. (2008) [7].     

Restricted recourse strategies for bounding the expected network recourse function

This paper presents bounds for the expected recourse function for stochastic programs with network recourse. Cyclic recourse, a concept introduced by Wallace [18], allows the approximation of the recourse problem by restricting the optimal flows on a set of cycles and by augmenting the original network to induce separability. We introduce a new procedure that uses again a set of cycles but does not approximate the problem; instead it solves it heuristically without altering the original network or requiring separability. The method produces tighter bounds and is computationally feasible for large networks. Numerical experiments with selected networks illustrate the effectiveness of the approach.     

Versions of separability in bitopological spaces

We study selective versions of separability in bitopological spaces. In particular, we investigate these properties in function spaces endowed with the topology of pointwise convergence and the compact-open topology.     

Separability for Positive Operators on Tensor Product of Hilbert Spaces

The separability and the entanglement(that is, inseparability) of the composite quantum states play important roles in quantum information theory. Mathematically, a quantum state is a trace-class positive operator with trace one acting on a complex separable Hilbert space. In this paper,in more general frame, the notion of separability for quantum states is generalized to bounded positive operators acting on tensor product of Hilbert spaces. However, not like the quantum state case, there are different kinds of separability for positive operators with different operator topologies. Four types of such separability are discussed; several criteria such as the finite rank entanglement witness criterion,the positive elementary operator criterion and PPT criterion to detect the separability of the positive operators are established; some methods to construct separable positive operators by operator matrices are provided. These may also make us to understand the separability and entanglement of quantum states better, and may be applied to find new separable quantum states.     

A Crank‐Nicolson and ADI Galerkin method with quadrature for hyperbolic problems

We propose, analyze, and implement fully discrete two‐time level Crank‐Nicolson methods with quadrature for solving second‐order hyperbolic initial boundary value problems. Our algorithms include a practical version of the ADI scheme of Fernandes and Fairweather [SIAM J Numer Anal 28 (1991), 1265–1281] and also generalize the methods and analyzes of Baker [SIAM J Numer Anal 13 (1976), 564–576] and Baker and Dougalis [SIAM J Numer Anal 13 (1976), 577–598]. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

Approximate Separability of the Green's Function of the Helmholtz Equation in the High Frequency Limit

The minimum number of terms that are needed in a separable approximation for a Green's function reveals the intrinsic complexity of the solution space of the underlying differential equation. It also has implications for whether low‐rank structures exist in the linear system after numerical discretization. The Green's function for a coercive elliptic differential operator in divergence form was shown to be highly separable [2], and efficient numerical algorithms exploiting low‐rank structures of the discretized systems were developed. In this work, a new approach to study the approximate separability of the Green's function of the Helmholtz equation in the high‐frequency limit is developed. We show (1) lower bounds based on an explicit characterization of the correlation between two Green's functions and a tight dimension estimate for the best linear subspace to approximate a set of decorrelated Green's functions, (2) upper bounds based on constructing specific separable approximations, and (3) sharpness of these bounds for a few case studies of practical interest. © 2018 Wiley Periodicals, Inc.     

SEPARABILITY CONDITIONS IN ACTS OVER MONOIDS

We discuss residual finiteness and several related separability conditions for the class of monoid acts, namely weak subact separability, strong subact separability and complete separability. For each of these four separability conditions, we investigate which monoids have the property that all their (finitely generated) acts satisfy the condition. In particular, we prove that: all acts over a finite monoid are completely separable (and hence satisfy the other three separability conditions); all finitely generated acts over a finitely generated commutative monoid are residually finite and strongly subact separable (and hence weakly subact separable); all acts over a commutative idempotent monoid are residually finite and strongly subact separable; and all acts over a Clifford monoid are strongly subact separable.

     

On the martingale problem for Banach space valued stochastic differential equations

LetE denote a real separable Banach space and letZ=(Z(t, f) be a family of centered, homogeneous, Gaussian independent increment processes with values inE, indexed by timet0 and the continuous functionsf:[0,t] E. If the dependence ont andf fulfills some additional properties,Z is called a gaussian random field. For continuous, adaptedE-valued processesX a stochastic integral processY = ₀ ^. Z(t, X)(dt) is defined, which is a continuous local martingale with tensor quadratic variation[Y] = ₀ ^. Q(t, X)dt, whereQ(t, f) denotes the covariance operator ofZ(t, f).Y is called a solution of the homogeneous Gaussian martingale problem, ifY = ₀ ^. Z(t, Y)(dt). Such solutions occur naturally in connection with stochastic differential equations of the type (D):dX(t)=G(t, X) dt+Z(t, X)(dt), whereG is anE-valued vector field. It is shown that a solution of (D) can be obtained by a kind of variation of parameter method, first solving a deterministic integral equation only involvingG and then solving an associated homogeneous martingale problem.