On a new class of Finsler metrics

In this paper, the geometric meaning of (α,β)-norms is made clear. On this basis, a new class of Finsler metrics called general (α,β)-metrics are introduced, which are defined by a Riemannian metric and a 1-form. These metrics not only generalize (α,β)-metrics naturally, but also include some metrics structured by R. Bryant. The spray coefficients formula of some kinds of general (α,β)-metrics is given and the projective flatness is also discussed.     

Rayleigh dissipation from the general recurrence of metrics in path spaces

Given a pair (metric g, symmetric 2-covariant tensor field H though as a Rayleigh dissipation) on a path space (manifold M, semispray S), the family of nonlinear connections N such that H equals the dynamical derivative of g with respect to (S,N) is determined by using the Obata tensors. In this way, we generalize the case of metric nonlinear connections as well as that of recurrent metrics. As applications, we treat firstly the case of Finslerian (α,β)-metrics finding all nonlinear connections for which the associated Finsler-Sasaki metric is exactly the dynamical derivative of the Riemannian-Sasaki metric. Secondly, we apply our results for the case of Beil metrics used in Relativity and field theories.     

Remarks on invariant metrics on Teichmüller space

We make some comparisons concerning the induced infinitesimal Kobayashi metric, the induced Siegel metric, the L² Bergman metric, the Teichmüller metric and the Weil-Petersson metric on the Teichmüller space of a compact Riemann surface of genus g?2. As a consequence, among others, we show that the moduli space has finite volume with respect to the L² Bergman metric. This answers a question raised by Nag in 1989.     

Zeros of orthogonal Laurent polynomials and solutions of strong Stieltjes moment problems

The strong Stieltjes moment problem for a bisequence consists of finding positive measures μ with support in [0,∞) such that

     

Ordinal subdivision and special pasting in quasicategories

Quasicategories are simplicial sets with properties generalising those of the nerve of a category. They model weak (ω,1)-categories. Using a combinatorially defined ordinal subdivision, we examine composition rules for certain special pasting diagrams in quasicategories. The subdivision is of combinatorial interest in its own right and is linked with various combinatorial constructions.     

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.     

Group actions and Helly's theorem

We describe a connection between the combinatorics of generators for certain groups and the combinatorics of Helly's 1913 theorem on convex sets. We use this connection to prove fixed point theorems for actions of these groups on nonpositively curved metric spaces. These results are encoded in a property that we introduce called “property FAr”, which reduces to Serre's property FA when r=1. The method applies to S-arithmetic groups in higher Q-rank, to simplex reflection groups (including some nonarithmetic ones), and to higher rank Chevalley groups over polynomial and other rings (for example SLn(Z[x₁,…,xd]), n>2).     

Addendum to “Variations of selective separability” [Topology Appl. 156 (7) (2009) 1241-1252]

Two proofs omitted in the paper mentioned in the title are presented.     

Optimal stopping for non-linear expectations—Part II

Relying on the stochastic analysis tools developed in Bayraktar and Yao (2011) [1], we solve the optimal stopping problems for non-linear expectations.     

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.     

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.     

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.     

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.     

More on “Connected (n, m)-graphs with minimum and maximum zeroth-order general Randi? index”

Let G be a graph and d(u) denote the degree of a vertex u in G. The zeroth-order general Randi? index ⁰R_α(G) of the graph G is defined as ∑_u∈V(G)d(u)^α, where the summation goes over all vertices of G and α is an arbitrary real number. In this paper we correct the proof of the main Theorem 3.5 of the paper by Hu et al. [Y. Hu, X. Li, Y. Shi, T. Xu, Connected (n,m)-graphs with minimum and maximum zeroth-order general Randi? index, Discrete Appl. Math. 155 (8) (2007) 1044-1054] and give a more general Theorem. We finally characterize ¹ for α<0 the connected G(n,m)-graphs with maximum value ⁰R_α(G(n,m)), where G(n,m) is a simple connected graph with n vertices and m edges.     

The Independence Number for De Bruijn networks and Kautz networks

Let D be a directed graph; the (l,ω)-Independence Number of graph D, denoted by α_l,ω(D), is an important performance parameter for interconnection networks. De Bruijn networks and Kautz networks, denoted by B(d,n) and K(d,n) respectively, are versatile and efficient topological structures of interconnection networks. For l=1,2,…,n, this paper shows that α_l,d−1(B(d,n))=dⁿ,α_l,d−1(K(d,n))=α_l,d(K(d,n))=dⁿ+dⁿ⁻¹ if d≥3 and n≤d−2. In particular, the paper shows the exact value of the Independence Number for B(d,1) and B(d,2) for any d. For the generalized situation, the paper obtains a lower bound α_l,d−1(B(d,n))≥d² if n≥3 and d≥5.     

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     

Conservation laws for some compacton equations using the multiplier approach

This paper is an application of the variational derivative method to the derivation of the conservation laws for partial differential equations. The conservation laws for (1+1) dimensional compacton k(2,2) and compacton k(3,3) equations are studied via multiplier approach. Also the conservation laws for (2+1) dimensional compacton Zk(2,2) equation are established by first computing the multipliers.     

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²).     

Property (w) and perturbations II

This note is a continuation of a previous article [P. Aiena, M.T. Biondi, Property (w) and perturbations, J. Math. Anal. Appl. 336 (2007) 683-692] concerning the stability of property (w), a variant of Weyl's theorem, for a bounded operator T acting on a Banach space, under finite-dimensional perturbations K commuting with T. A counterexample shows that property (w) in general is not preserved under finite-dimensional perturbations commuting with T, also under the assumption that T is a-isoloid.