On the coefficients of Neumann series of Bessel functions

Recently Pogány and Süli (Proc. Amer. Math. Soc. 137 (7) (2009) 2363-2368) derived a closed-form integral expression for Neumann series of Bessel functions. In this note we precisely characterize the class of functions α that generate the integral representation of a Neumann series of Bessel functions in the sense that the restriction αN_|=(αn) of a function α to the set N of all positive integers is the sequence of coefficients of the initial Neumann series.     

Use of an interval global optimization tool for exploring feasibility of batch extractive distillation

An interval arithmetic based branch-and-bound optimizer is applied to find the singular points and bifurcations in studying feasibility of batch extractive distillation. This kind of study is an important step in synthesizing economic industrial processes applied to separate liquid mixtures of azeotrope-forming chemical components. The feasibility check methodology includes computation and analysis of phase plots of differential algebraic equation systems (DAEs). Singular points and bifurcations play an essential role in judging feasibility. The feasible domain of parameters can be estimated by tracing the paths of the singular points in the phase plane; bifurcations indicate the border of this domain. Since the algebraic part of the DAE cannot be transformed to an explicit form, implicit function theorem is applied in formulating the criterion of bifurcation points. The singular points of the maps at specified process parameters are found with interval methodology. Limiting values of the parameters are determined by searching for points satisfying bifurcation criteria.     

Tripartite Ramsey numbers for paths

In this article, we study the tripartite Ramsey numbers of paths. We show that in any two‐coloring of the edges of the complete tripartite graph K(n, n, n) there is a monochromatic path of length (1 ? o(1))2n. Since R(P_2n+1,P_2n+1)=3n, this means that the length of the longest monochromatic path is about the same when two‐colorings of K_3n and K(n, n, n) are considered. © 2007 Wiley Periodicals, Inc. J Graph Theory 55: 164–174, 2007     

Convergence and nonlinear stability of the Lagrange-Galerkin method for the Navier-Stokes equations

Summary The Lagrange-Galerkin method is a numerical technique for solving convection — dominated diffusion problems, based on combining a special discretisation of the Lagrangian material derivative along particle trajectories with a Galerkin finite element method. We present optimal error estimates for the Lagrange-Galerkin mixed finite element approximation of the Navier-Stokes equations in a velocity/pressure formulation. The method is shown to be nonlinearly stable.     

Full ordering in the Shorrocks mobility sense of the semiring of monotone doubly stochastic matrices

In this paper, we investigate the ordering on a semiring of monotone doubly stochastic transition matrices in Shorrocks’ sense. We identify a class of an equilibrium index of mobility that induces the full ordering in a semiring, while this ordering is compatible with Dardanoni’s partial ordering on a set of monotone primitive irreducible doubly stochastic matrices.     

Asymmetric integral as a limit of generated Choquet integrals based on absolutely monotone real set functions

We introduce a generated Choquet integral with respect to absolutely monotone and sign stable set functions. Another type of integrals defined with respect to such a set function is obtained as a limit of an appropriate sequence of generated Choquet integrals.     

The negative cycles polyhedron and hardness of checking some polyhedral properties

Given a graph G=(V,E) and a weight function on the edges w:E→ℝ, we consider the polyhedron P(G,w) of negative-weight flows on G, and get a complete characterization of the vertices and extreme directions of P(G,w). Based on this characterization, and using a construction developed in Khachiyan et al. (Discrete Comput. Geom. 39(1–3):174–190, 2008), we show that, unless P=NP, there is no output polynomial-time algorithm to generate all the vertices of a 0/1-polyhedron. This strengthens the NP-hardness result of Khachiyan et al. (Discrete Comput. Geom. 39(1–3):174–190, 2008) for non 0/1-polyhedra, and comes in contrast with the polynomiality of vertex enumeration for 0/1-polytopes (Bussiech and Lübbecke in Comput. Geom., Theory Appl. 11(2):103–109, 1998). As further applications, we show that it is NP-hard to check if a given integral polyhedron is 0/1, or if a given polyhedron is half-integral. Finally, we also show that it is NP-hard to approximate the maximum support of a vertex of a polyhedron in ℝ ⁿ within a factor of 12/n.     

Flow sharing and bankruptcy games

We discuss the relationship between bankruptcy problems and flow sharing problems, respectively, and show that the latter type of problem can be interpreted as a generalization of the former. The corresponding flow sharing game is convex, hence we can use the converse reduced game property to characterize the nucleolus and the constrained egalitarian solution. Our main contribution is thus to introduce the nucleolus as an alternative solution concept for flow sharing problems, and to offer a game-theoretic interpretation of the traditional egalitarian solution.     

How to avoid using the Regularity Lemma: Pósa’s conjecture revisited

In this paper we investigate how the use of the Regularity Lemma and the Blow-up Lemma can be avoided in certain extremal problems of dense graphs. We present the ideas for the following well-known Pósa conjecture on the square of a Hamiltonian cycle. In 1962 Pósa conjectured that any graph G of order n and minimum degree at least contains the square of a Hamiltonian cycle. In an earlier paper we proved this conjecture with the use of the Regularity Lemma-Blow-up Lemma method for n≥n₀ where n₀ is very large. Here we present another proof (and a general method) that avoids the use of the Regularity Lemma and thus the resulting n₀ is much smaller.