Global optimization for first order Markov Random Fields with submodular priors

This paper copes with the global optimization of Markovian energies. Energies are defined on an arbitrary graph and pairwise interactions are considered. The label set is assumed to be linearly ordered and of finite cardinality, while each interaction term (prior) shall be a submodular function. We propose an algorithm that computes a global optimizer under these assumptions. The approach consists of mapping the original problem into a combinatorial one that is shown to be globally solvable using a maximum-flow/s-t minimum-cut algorithm. This restatement relies on considering the level sets of the labels (seen as binary variables) instead of the label values themselves. The submodularity assumption of the priors is shown to be a necessary and sufficient condition for the applicability of the proposed approach. Finally, some numerical results are presented.     

A general two-sided matching market with discrete concave utility functions

In the theory of two-sided matching markets there are two standard models: (i) the marriage model due to Gale and Shapley and (ii) the assignment model due to Shapley and Shubik. Recently, Eriksson and Karlander introduced a hybrid model, which was further generalized by Sotomayor. In this paper, we propose a common generalization of these models by utilizing the framework of discrete convex analysis introduced by Murota, and verify the existence of a pairwise-stable outcome in our general model.     

Moore bound for mixed networks

Mixed graphs contain both undirected as well as directed links between vertices and therefore are an interesting model for interconnection communication networks. In this paper, we establish the Moore bound for mixed graphs, which generalizes both the directed and the undirected Moore bound.     

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 minimax theorem for vector-valued functions in lexicographic order

In this paper, a minimax theorem and a saddle point theorem are obtained for vector-valued functions in the sense of lexicographic order, respectively. An equivalent relationship between the minimax inequality and the saddle point is established. Some examples are given to illustrate our results.     

Higher order duality in multiobjective fractional programming with support functions

In this paper a new class of higher order (F,ρ,σ)-type I functions for a multiobjective programming problem is introduced, which subsumes several known studied classes. Higher order Mond-Weir and Schaible type dual programs are formulated for a nondifferentiable multiobjective fractional programming problem where the objective functions and the constraints contain support functions of compact convex sets in Rn. Weak and strong duality results are studied in both the cases assuming the involved functions to be higher order (F,ρ,σ)-type I. A number of previously studied problems appear as special cases.     

Infinitely many homoclinic orbits for the second order Hamiltonian systems with general potentials

In this paper we study the following nonperiodic second order Hamiltonian systems

     

Bartholdi zeta functions of some graphs

We give a decomposition formula for the Bartholdi zeta function of a graph G which is partitioned into some irregular coverings. As a corollary, we obtain a decomposition formula for the Bartholdi zeta function of G which is partitioned into some regular coverings.     

On upper and lower bounds of higher order derivatives for solutions to the 2D micropolar fluid equations

The present paper is concerned with asymptotic behaviours of the solutions to the micropolar fluid motion equations in R². Upper and lower bounds are derived for the L² decay rates of higher order derivatives of solutions to the micropolar fluid flows. The findings are mainly based on the basic estimates of the linearized micropolar fluid motion equations and generalized Gronwall type argument.     

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.     

Spanning trails containing given edges

A graph G is Eulerian-connected if for any u and v in V(G), G has a spanning (u,v)-trail. A graph G is edge-Eulerian-connected if for any e^′ and e^″ in E(G), G has a spanning (e^′,e^″)-trail. For an integer r?0, a graph is called r-Eulerian-connected if for any X⊆E(G) with |X|?r, and for any , G has a spanning (u,v)-trail T such that X⊆E(T). The r-edge-Eulerian-connectivity of a graph can be defined similarly. Let θ(r) be the minimum value of k such that every k-edge-connected graph is r-Eulerian-connected. Catlin proved that θ(0)=4. We shall show that θ(r)=4 for 0?r?2, and θ(r)=r+1 for r?3. Results on r-edge-Eulerian connectivity are also discussed.     

Statistical convergence and ideal convergence for sequences of functions

Let I⊂P(N) stand for an ideal containing finite sets. We discuss various kinds of statistical convergence and I-convergence for sequences of functions with values in R or in a metric space. For real valued measurable functions defined on a measure space (X,M,μ), we obtain a statistical version of the Egorov theorem (when μ(X)<∞). We show that, in its assertion, equi-statistical convergence on a big set cannot be replaced by uniform statistical convergence. Also, we consider statistical convergence in measure and I-convergence in measure, with some consequences of the Riesz theorem. We prove that outer and inner statistical convergences in measure (for sequences of measurable functions) are equivalent if the measure is finite.     

Weighted-Hardy functions with Hadamard gaps on the unit ball

We prove that an analytic function f on the unit ball B with Hadamard gaps, that is, (the homogeneous polynomial expansion of f) satisfying n_k+1/n_k?λ>1 for all k∈N, belongs to the space if and only if . Moreover, we show that the following asymptotic relation holds . Also we prove that lim_r→1(1-r²)^α‖Rf_r‖_p=0 if and only if . These results confirm two conjectures from the following recent paper [S. Stevi?, On Bloch-type functions with Hadamard gaps, Abstr. Appl. Anal. 2007 (2007) 8 pages (Article ID 39176)].     

Solution techniques for the Large Set Covering Problem

Given a finite set E and a family F={E₁,…,E_m} of subsets of E such that F covers E, the famous unicost set covering problem (USCP) is to determine the smallest possible subset of F that also covers E. We study in this paper a variant, called the Large Set Covering Problem (LSCP), which differs from the USCP in that E and the subsets E_i are not given in extension because they are very large sets that are possibly infinite. We propose three exact algorithms for solving the LSCP. Two of them determine minimal covers, while the third one produces minimum covers. Heuristic versions of these algorithms are also proposed and analysed. We then give several procedures for the computation of a lower bound on the minimum size of a cover. We finally present algorithms for finding the largest possible subset of F that does not cover E. We also show that a particular case of the LSCP is to determine irreducible infeasible sets in inconsistent constraint satisfaction problems. All concepts presented in the paper are illustrated on the k-colouring problem which is formulated as a constraint satisfaction problem.     

Vertex-transitive self-complementary uniform hypergraphs of prime order

For an integer n and a prime p, let . In this paper, we present a construction for vertex-transitive self-complementary k-uniform hypergraphs of order n for each integer n such that for every prime p, where ?=max{k₍₂₎,(k−1)₍₂₎}, and consequently we prove that the necessary conditions on the order of vertex-transitive self-complementary uniform hypergraphs of rank k=2^? or k=2^?+1 due to Potoňick and Šajna are sufficient. In addition, we use Burnside’s characterization of transitive groups of prime degree to characterize the structure of vertex-transitive self-complementary k-hypergraphs which have prime order p in the case where k=2^? or k=2^?+1 and , and we present an algorithm to generate all of these structures. We obtain a bound on the number of distinct vertex-transitive self-complementary graphs of prime order , up to isomorphism.     

Construction of a high order fluid-structure interaction solver

Accuracy is critical if we are to trust simulation predictions. In settings such as fluid-structure interaction, it is all the more important to obtain reliable results to understand, for example, the impact of pathologies on blood flows in the cardiovascular system. In this paper, we propose a computational strategy for simulating fluid structure interaction using high order methods in space and time.First, we present the mathematical and computational core framework, Life, underlying our multi-physics solvers. Life is a versatile library allowing for 1D, 2D and 3D partial differential solves using h/p type Galerkin methods. Then, we briefly describe the handling of high order geometry and the structure solver. Next we outline the high-order space-time approximation of the incompressible Navier-Stokes equations and comment on the algebraic system and the preconditioning strategy. Finally, we present the high-order Arbitrary Lagrangian Eulerian (ALE) framework in which we solve the fluid-structure interaction problem as well as some initial results.     

Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method

Let be a 0-1 quadratic program which consists in minimizing a quadratic function subject to linear equality constraints. In this paper, we present QCR, a general method to reformulate into an equivalent 0-1 program with a convex quadratic objective function. The reformulated problem can then be efficiently solved by a classical branch-and-bound algorithm, based on continuous relaxation. This idea is already present in the literature and used in standard solvers such as CPLEX. Our objective in this work was to find a convex reformulation whose continuous relaxation bound is, moreover, as tight as possible. From this point of view, we show that QCR is optimal in a certain sense. State-of-the-art reformulation methods mainly operate a perturbation of the diagonal terms and are valid for any {0,1} vector. The innovation of QCR comes from the fact that the reformulation also uses the equality constraints and is valid on the feasible solution domain only. Hence, the superiority of QCR holds by construction. However, reformulation by QCR requires the solution of a semidefinite program which can be costly from the running time point of view. We carry out a computational experience on three different combinatorial optimization problems showing that the costly computational time of reformulation by QCR can however result in a drastically more efficient branch-and-bound phase. Moreover, our new approach is competitive with very specific methods applied to particular optimization problems.     

On the packing chromatic number of some lattices

For a positive integer k, a k-packing in a graph G is a subset A of vertices such that the distance between any two distinct vertices from A is more than k. The packing chromatic number of G is the smallest integer m such that the vertex set of G can be partitioned as V₁,V₂,…,V_m where V_i is an i-packing for each i. It is proved that the planar triangular lattice T and the three-dimensional integer lattice Z³ do not have finite packing chromatic numbers.     

Slight improvements of the Singleton bound

The problem of determining A_q(n,d), the maximum cardinality of a q-ary code of length n with minimum distance at least d, is considered in some cases where corresponding MDS codes do not exist. Slight improvements of the Singleton bound are given, including A_q(q+2,q)?q³-3 if q is odd, A₅(7,5)?5³-4 and A₁₆(18,15)?18⁴-4.     

Growth order and stability of semigroups and cosine operator functions

Equivalent conditions for a trajectory of a C₀-semigroup T(⋅) (resp. cosine function C(⋅)) of operators to have the growth order O(tα) or o(tα) are expressed in terms of Cesàro and Abel means of the norm of the trajectory. We then deduce characterizations of growth order and stability for T(⋅) and C(⋅). It is also shown that under some Tauberian condition the uniform boundedness (resp. strong convergence) of T(⋅) is equivalent to the uniform boundedness (resp. strong convergence) of its Abel means.