On the complexity of the multicut problem in bounded tree-width graphs and digraphs

Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices whose removal leaves no path from each source to the corresponding sink. This is a classical NP-hard problem, and we show that the edge version becomes tractable in bounded tree-width graphs if the number of source-sink pairs is fixed, but remains NP-hard in directed acyclic graphs and APX-hard in bounded tree-width and bounded degree unweighted digraphs. The vertex version, although tractable in trees, is proved to be NP-hard in unweighted cacti of bounded degree and bounded path-width.     

A new construction of vertex algebras and quasi-modules for vertex algebras

In this paper, a new construction of vertex algebras from more general vertex operators is given and a notion of quasimodule for vertex algebras is introduced and studied. More specifically, a notion of quasilocal subset(space) of for any vector space W is introduced and studied, generalizing the notion of usual locality in the most possible way, and it is proved that on any maximal quasilocal subspace there exists a natural vertex algebra structure and that any quasilocal subset of generates a vertex algebra. Furthermore, it is proved that W is a quasimodule for each of the vertex algebras generated by quasilocal subsets of . A notion of Γ-vertex algebra is also introduced and studied, where Γ is a subgroup of the multiplicative group C^× of nonzero complex numbers. It is proved that any maximal quasilocal subspace of is naturally a Γ-vertex algebra and that any quasilocal subset of generates a Γ-vertex algebra. It is also proved that a Γ-vertex algebra exactly amounts to a vertex algebra equipped with a Γ-module structure which satisfies a certain compatibility condition. Finally, two families of examples are given, involving twisted affine Lie algebras and certain quantum torus Lie algebras.     

Decomposition rank and absorbing extensions of type I algebras

We prove the following: Let A and B be separable C^*-algebras. Suppose that B is a type I C^*-algebra such that

(i)

B has only infinite dimensional irreducible *-representations, and

(ii)

B has finite decomposition rank.

If

0→B→C→A→0     

Remarks on convergence of trigonometric series with special varying coefficients

We give an essential generalization of Telyakovskii's results on the convergence of trigonometric series with rarely changing coefficients in the norm of L₁.     

On constants in the Füredi-Hajnal and the Stanley-Wilf conjecture

For a given permutation matrix P, let fP(n) be the maximum number of 1-entries in an n×n(0,1)-matrix avoiding P and let SP(n) be the set of all n×n permutation matrices avoiding P. The Füredi-Hajnal conjecture asserts that cP:=limn→∞fP(n)/n is finite, while the Stanley-Wilf conjecture asserts that is finite.In 2004, Marcus and Tardos proved the Füredi-Hajnal conjecture, which together with the reduction introduced by Klazar in 2000 proves the Stanley-Wilf conjecture.We focus on the values of the Stanley-Wilf limit (sP) and the Füredi-Hajnal limit (cP). We improve the reduction and obtain which decreases the general upper bound on sP from sP?constconstO(klog(k)) to sP?constO(klog(k)) for any k×k permutation matrix P. In the opposite direction, we show .For a lower bound, we present for each k a k×k permutation matrix satisfying cP=Ω(k²).     

Binary relations and reduced hypergroups

Different partial hypergroupoids are associated with binary relations defined on a set H. In this paper we find sufficient and necessary conditions for these hypergroupoids in order to be reduced hypergroups. Given two binary relations ρ and σ on H we investigate when the hypergroups associated with the relations ρ∩σ, ρ∪σ and ρσ are reduced. We also determine when the cartesian product of two hypergroupoids associated with a binary relation is a reduced hypergroup.     

Gale duality and Koszul duality

Given a hyperplane arrangement in an affine space equipped with a linear functional, we define two finite-dimensional, noncommutative algebras, both of which are motivated by the geometry of hypertoric varieties. We show that these algebras are Koszul dual to each other, and that the roles of the two algebras are reversed by Gale duality. We also study the centers and representation categories of our algebras, which are in many ways analogous to integral blocks of category O.     

Special metrics and triality

We investigate a new 8-dimensional Riemannian geometry defined by a generic closed and coclosed 3-form with stabiliser PSU(3), and which arises as a critical point of Hitchin's variational principle. We give a Riemannian characterisation of this structure in terms of invariant spinor-valued 1-forms, which are harmonic with respect to the twisted Dirac operator ? on Δ⊗Λ¹. We establish various obstructions to the existence of topological reductions to PSU(3). For compact manifolds, we also give sufficient conditions for topological PSU(3)-structures that can be lifted to topological SU(3)-structures. We also construct the first known compact example of an integrable non-symmetric PSU(3)-structure. In the same vein, we give a new Riemannian characterisation for topological quaternionic Kähler structures which are defined by an Sp(1)⋅Sp(2)-invariant self-dual 4-form. Again, we show that this form is closed if and only if the corresponding spinor-valued 1-form is harmonic for ? and that these equivalent conditions produce constraints on the Ricci tensor.     

Further improved recursions for a class of compound Poisson distributions

In the present paper we develop more efficient recursive formulae for the evaluation of the t-order cumulative function Γ^th(x) and the t-order tail probability Λ^th(x) of the class of compound Poisson distributions in the case where the derivative of the probability generating function of the claim amounts can be written as a ratio of two polynomials. These efficient recursions can be applied for the exact evaluation of the probability function (given by De Pril [De Pril, N., 1986a. Improved recursions for some compound Poisson distributions. Insurance Math. Econom. 5, 129-132]), distribution function, tail probability, stop-loss premiums and t-order moments of stop-loss transforms of compound Poisson distributions. Also, efficient recursive algorithms are given for the evaluation of higher-order moments and r-order factorial moments about any point for this class of compound Poisson distributions. Finally, several examples of discrete claim size distributions belonging to this class are also given.     

Separable states and positive maps

Using the natural duality between linear functionals on tensor products of C^∗-algebras with the trace class operators on a Hilbert space H and linear maps of the C^∗-algebra into B(H), we study the relationship between separability, entanglement and the Peres condition of states and positivity properties of the linear maps.     

Minimum monopoly in regular and tree graphs

In this paper we consider a graph optimization problem called minimum monopoly problem, in which it is required to find a minimum cardinality set S⊆V, such that, for each u∈V, |N[u]∩S|?|N[u]|/2 in a given graph G=(V,E). We show that this optimization problem does not have a polynomial-time approximation scheme for k-regular graphs (k?5), unless P=NP. We show this by establishing two L-reductions (an approximation preserving reduction) from minimum dominating set problem for k-regular graphs to minimum monopoly problem for 2k-regular graphs and to minimum monopoly problem for (2k-1)-regular graphs, where k?3. We also show that, for tree graphs, a minimum monopoly set can be computed in linear time.     

Colorings of k-balanced matrices and integer decomposition property of related polyhedra

We show that a class of polyhedra, arising from certain 0,1 matrices introduced by Truemper and Chandrasekaran, has the integer decomposition property. This is accomplished by proving certain coloring properties of these matrices.     

Domains of infinitesimal generators of automorphism flows

We present a systematic characterization of the domain of a generator of a one parameter group on certain C∗-subalgebras of via finite-dimensional estimates. Our approach yields an example of a densely defined closed symmetric derivation on a C∗-subalgebras of whose domain is not closed with respect to the C¹-functional calculus. This completes and complements the earlier example of McIntosh (J. Funct. Anal. 30 (1977) 264). Our methods are partly based on the theory of adjoint C₀-semigroups.     

Optimization and sensitivity analysis of controlling arrivals in the queueing system with single working vacation

This paper analyzes the F-policy M/M/1/K queueing system with working vacation and an exponential startup time. The F-policy deals with the issue of controlling arrivals to a queueing system, and the server requires a startup time before allowing customers to enter the system. For the queueing systems with working vacation, the server can still provide service to customers rather than completely stop the service during a vacation period. The matrix-analytic method is applied to develop the steady-state probabilities, and then obtain several system characteristics. We construct the expected cost function and formulate an optimization problem to find the minimum cost. The direct search method and Quasi-Newton method are implemented to determine the optimal system capacity K, the optimal threshold F and the optimal service rates (μ_B,μ_V) at the minimum cost. A sensitivity analysis is conducted to investigate the effect of changes in the system parameters on the expected cost function. Finally, numerical examples are provided for illustration purpose.     

Non-simultaneous blow-up and blow-up rates for reaction-diffusion equations

This paper considers blow-up solutions for reaction-diffusion equations, complemented by homogeneous Dirichlet boundary conditions. It is proved that there exist initial data such that one block or two (separated or contiguous) blocks of n components blow up simultaneously while the others remain bounded. As a corollary, a necessary and sufficient condition is obtained such that any blow-up must be the case for at least two components blowing up simultaneously. We also show some other exponent regions, where any blow-up of k(∈{1,2,…,n}) components must be simultaneous. Moreover, the corresponding blow-up rates and sets are discussed. The results extend those in Liu and Li [B.C. Liu, F.J. Li, Non-simultaneous blow-up of n components for nonlinear parabolic systems, J. Math. Anal. Appl. 356 (2009) 215-231].     

Super-simple, pan-orientable and pan-decomposable GDDs with block size 4

In this paper we study (4,2μ)-GDDs of type gⁿ possessing both the pan-decomposable property introduced by Granville, Moisiadis, Rees, On complementary decompositions of the complete graph, Graphs and Combinatorics 5 (1989) 57-61 and the pan-orientable property introduced by Grüttmüller, Hartmann, Pan-orientable block designs, Australas. J. Combin. 40 (2008) 57-68. We show that the necessary condition for a (4,2μ)-GDD satisfying both of these properties, namely (1) n≥4, μg(n−1)≡0 (mod 3), and (2) g−1,n are not both even if μ is odd are sufficient. When λ=2, our designs are super-simple.We also determine the spectrum of (4,2)-GDDs which are super-simple and possess some of the decomposable/orientable conditions, but are not pan-decomposable or pan-orientable. In particular, we show that the necessary conditions for a super-simple directable (4,2)-GDD of type gⁿ are sufficient.     

Fixed point theorems in fuzzy metric spaces

In the present work, we establish several fixed point theorems for a new class of self-maps in M-complete fuzzy metric spaces and compact fuzzy metric spaces, respectively.