Differentiability of the volume of a region enclosed by level sets

The level of a function f on Rn encloses a region. The volume of a region between two such levels depends on both levels. Fixing one of them the volume becomes a function of the remaining level. We show that if the function f is smooth, the volume function is again smooth for regular values of f. For critical values of f the volume function is only finitely differentiable. The initial motivation for this study comes from Radiotherapy, where such volume functions are used in an optimization process. Thus their differentiability properties become important.     

On the stability index for weighted composition operators

Let ?>0. A continuous linear operator T:C(X)?C(Y) is said to ?-preserve disjointness if ‖(Tf)(Tg)‖_∞≤?, whenever f,g∈C(X) satisfy ‖f‖_∞=‖g‖_∞=1 and fg≡0. In this paper we continue our study of the minimal interval where the possible maximal distance from a norm one operator which ?-preserves disjointness to the set of weighted composition maps may lie. We provide sharp bounds for both the finite and the infinite case, which turn out to be completely different.     

A superlinear space decomposition algorithm for constrained nonsmooth convex program

A class of constrained nonsmooth convex optimization problems, that is, piecewise C² convex objectives with smooth convex inequality constraints are transformed into unconstrained nonsmooth convex programs with the help of exact penalty function. The objective functions of these unconstrained programs are particular cases of functions with primal-dual gradient structure which has connection with VU space decomposition. Then a VU space decomposition method for solving this unconstrained program is presented. This method is proved to converge with local superlinear rate under certain assumptions. An illustrative example is given to show how this method works.     

Matching polynomials for chains of cycles

Došli? and Måløy (2010) [2] obtained the extremal 6-cactus chains with respect to the number of matchings and of independent sets. Motivated by the prior paper, in this paper we give recurrences for matching polynomials of ortho-chains and meta-chains, and show that they are the h-cactus chains with the most matchings.     

On the spectral characterization of some unicyclic graphs

Let H(n;q,n₁,n₂) be a graph with n vertices containing a cycle C_q and two hanging paths P_n1 and P_n2 attached at the same vertex of the cycle. In this paper, we prove that except for the A-cospectral graphs H(12;6,1,5) and H(12;8,2,2), no two non-isomorphic graphs of the form H(n;q,n₁,n₂) are A-cospectral. It is proved that all graphs H(n;q,n₁,n₂) are determined by their L-spectra. And all graphs H(n;q,n₁,n₂) are proved to be determined by their Q-spectra, except for graphs with a being a positive even number and with b≥4 being an even number. Moreover, the Q-cospectral graphs with these two exceptions are given.     

Sensitivity of risk measures with respect to the normal approximation of total claim distributions

A simple and commonly used method to approximate the total claim distribution of a (possibly weakly dependent) insurance collective is the normal approximation. In this article, we investigate the error made when the normal approximation is plugged in a fairly general distribution-invariant risk measure. We focus on the rate of convergence of the error relative to the number of clients, we specify the relative error’s asymptotic distribution, and we illustrate our results by means of a numerical example. Regarding the risk measure, we take into account distortion risk measures as well as distribution-invariant coherent risk measures.     

Diffusion relaxation limit of a bipolar hydrodynamic model for semiconductors

In the paper, we discuss the relaxation limit of a bipolar isentropic hydrodynamical models for semiconductors with small momentum relaxation time. With the help of the Maxwell iteration, we prove that, as the relaxation time tends to zero, periodic initial-value problems of a scaled bipolar isentropic hydrodynamic model have unique smooth solutions existing in the time interval where the classical drift-diffusion model has smooth solutions. Meanwhile, we justify a formal derivation of the corresponding drift-diffusion model from the bipolar hydrodynamic model.     

Approximation by means of nonlinear Kantorovich sampling type operators in Orlicz spaces

In this paper we introduce a nonlinear version of the Kantorovich sampling type series in a nonuniform setting. By means of the above series we are able to reconstruct signals (functions) which are continuous or uniformly continuous. Moreover, we study the problem of the convergence in the setting of Orlicz spaces: this allows us to treat signals which are not necessarily continuous. Our theory applies to L^p-spaces, interpolation spaces, exponential spaces and many others. Several graphical examples are provided.     

Darcy's law as long-time limit of adiabatic porous media flow

It is conjectured that Darcy's law governs the motion of compressible porous media flow in large time. This has been justified for one-dimensional isentropic flows. In this work, we show the conjecture is true for one-dimensional adiabatic flows with generic small smooth initial data.     

Halphen pencils on quartic threefolds

For any smooth quartic threefold in P⁴ we classify pencils on it whose general element is an irreducible surface birational to a surface of Kodaira dimension zero.     

Triangle path transit functions, betweenness and pseudo-modular graphs

The geodesic and induced path transit functions are the two well-studied interval functions in graphs. Two important transit functions related to the geodesic and induced path functions are the triangle path transit functions which consist of all vertices on all u,v-shortest (induced) paths or all vertices adjacent to two adjacent vertices on all u,v-shortest (induced) paths, for any two vertices u and v in a connected graph G. In this paper we study the two triangle path transit functions, namely the I^Δ and J^Δ on G. We discuss the betweenness axioms, for both triangle path transit functions. Also we present a characterization of pseudo-modular graphs using the transit function I^Δ by forbidden subgraphs.     

A note on the generalized min-sum set cover problem

In this paper, we consider the generalized min-sum set cover problem, introduced by Azar, Gamzu, and Yin (STOC 2009). Bansal, Gupta, and Krishnaswamy (SODA 2010) give a 485-approximation algorithm for the problem. We are able to alter their algorithm and analysis to obtain a 28-approximation algorithm, improving the performance guarantee by an order of magnitude. We use concepts from α-point scheduling to obtain our improvements.     

Tractability results for weighted Banach spaces of smooth functions

We study the L_∞-approximation problem for weighted Banach spaces of smooth d-variate functions, where d can be arbitrarily large. We consider the worst case error for algorithms that use finitely many pieces of information from different classes. Adaptive algorithms are also allowed. For a scale of Banach spaces we prove necessary and sufficient conditions for tractability in the case of product weights. Furthermore, we show the equivalence of weak tractability with the fact that the problem does not suffer from the curse of dimensionality.     

Improved algorithms for path partition and related problems

We study the L_∞ path partition problem: given a path of n weighted vertices and an integer k, remove k−1 edges from the path so that the maximum absolute deviation of the weights of the resulting k sub-paths from their mean is minimized. Previously, the best algorithm solves this problem in O(nklogk) time. We present an O(nk) time algorithm. We also give improved solutions for two related problems: the L_d path partition problem and the web proxies placement problem.     

Set systems without a 3-simplex

A 3-simplex is a collection of four sets A₁,…,A₄ with empty intersection such that any three of them have nonempty intersection. We show that the maximum size of a set system on n elements without a 3-simplex is for all n≥1, with equality only achieved by the family of sets containing a given element or of size at most 2. This extends a result of Keevash and Mubayi, who showed the conclusion for n sufficiently large.     

Moduli of convexity and smoothness of reflexive subspaces of L

We show that for any probability measure μ there exists an equivalent norm on the space L¹(μ) whose restriction to each reflexive subspace is uniformly smooth and uniformly convex, with modulus of convexity of power type 2. This renorming provides also an estimate for the corresponding modulus of smoothness of such subspaces.     

Some binomial formulas of the generalized Appell form

The authors aim here at finding all the generalizations of the binomial formula that are given by a generating-function of the generalized Appell form for a sequence of Newton polynomials. The formulas obtained include the well-known q-analogue of the binomial formula, several formulas involving hyperbolic functions, a trigonometric analogue, and some formulas involving the geometric and the exponential series.     

Attainment and (sub)differentiability of the infimal convolution of a function and the square of the norm

Let X be a Banach space whose norm is simultaneously LUR and Gateaux (Fréchet) smooth. Under some assumptions, it is shown that the infimal convolution of a fairly general function on X and the square of the norm is generically strongly attained and hence is Gateaux (Fréchet) differentiable. This contains a result of S. Dutta on distance functions.     

Counting general and self-dual interval orders

In this paper, we present a new method to derive formulas for the generating functions of interval orders, counted with respect to their size, magnitude, and number of minimal and maximal elements. Our method allows us not only to generalize previous results on refined enumeration of general interval orders, but also to enumerate self-dual interval orders with respect to analogous statistics.Using the newly derived generating function formulas, we are able to prove a bijective relationship between self-dual interval orders and upper-triangular matrices with no zero rows. Previously, a similar bijective relationship has been established between general interval orders and upper-triangular matrices with no zero rows and columns.     

Scattering matrices of regular coverings of graphs

We give a decomposition formula for the determinant on the bond scattering matrix of a regular covering of G. Furthermore, we define an L-function of G, and give a determinant expression of it. As a corollary, we express the determinant on the bond scattering matrix of a regular covering of G by means of its L-functions.