Unique factorization of compositive hereditary graph properties

A graph property is any class of graphs that is closed under isomorphisms. A graph property P is hereditary if it is closed under taking subgraphs; it is compositive if for any graphs G1, G2 ∈ P there exists a graph G ∈ P containing both G1 and G2 as subgraphs. Let H be any given graph on vertices v1, . . . , vn, n ≥ 2. A graph property P is H-factorizable over the class of graph properties P if there exist P 1 , . . . , P n ∈ P such that P consists of all graphs whose vertex sets can be partitioned into n parts, possibly empty, satisfying: 1. for each i, the graph induced by the i-th non-empty partition part is in P i , and 2. for each i and j with i = j, there is no edge between the i-th and j-th parts if vi and vj are non-adjacent vertices in H. If a graph property P is H-factorizable over P and we know the graph properties P 1 , . . . , P n , then we write P = H [ P 1 , . . . , P n ]. In such a case, the presentation H[ P 1 , . . . , P n ] is called a factorization of P over P. This concept generalizes graph homomorphisms and (P 1 , . . . , P n )-colorings. In this paper, we investigate all H-factorizations of a graph property P over the class of all hered- itary compositive graph properties for finite graphs H. It is shown that in many cases there is exactly one such factorization.     

Barzilai–Borwein method with variable sample size for stochastic linear complementarity problems

A smoothing method for solving stochastic linear complementarity problems is proposed. The expected residual minimization reformulation of the problem is considered, and it is approximated by the sample average approximation (SAA). The proposed method is based on sequential solving of a sequence of smoothing problems where each of the smoothing problems is defined with its own sample average approximation. A nonmonotone line search with a variant of the Barzilai–Borwein (BB) gradient direction is used for solving each of the smoothing problems. The BB search direction is efficient and low cost, particularly suitable for nonmonotone line search procedure. The variable sample size scheme allows the sample size to vary across the iterations and the method tends to use smaller sample size far away from the solution. The key point of this strategy is a good balance between the variable sample size strategy, the smoothing sequence and nonmonotonicity. Eventually, the maximal sample size is used and the SAA problem is solved. Presented numerical results indicate that the proposed strategy reduces the overall computational cost.     

Extensions of the Fill–Fishkind formula and the infimum – parallel sum relation

Recently, in (Arias ML, Corach G, Maestripieri A. Range additivity, shorted operator and the Sherman–Morrison–Woodburry formula, Linear Algebra Appl. 2015;467), authors gave a generalization of a formula by Fill and Fishkind, regarding the Moore–Penrose inverse of the sum of two matrices, in the setting of arbitrary Hilbert spaces. We consider this formula under some weaker assumptions and derive certain conclusions generalizing the mentioned result. We also extend a formula connecting the infimum of two orthogonal projections and their parallel sum to a formula connecting the star-infimum and the parallel sum of operators which need not be positive, using the concept of parallel sum that was introduced in (Antezana J, Corach G, Stojanoff D. Bilateral shorted operators and parallel sums. Linear Algebra Appl. 2006;414).     

Stochastically perturbed vector-borne disease models with direct transmission

In this paper we study a stochastic epidemic model of vector-borne diseases with direct mode of transmission and its delay modification. More precisely, we extend the deterministic epidemic models by introducing random perturbations around the endemic equilibrium state. By using suitable Lyapunov functions and functionals, we obtain stability conditions for the considered models and study the effect of the delay on the stability of the endemic equilibrium. Finally, numerical simulations for the stochastic model of malaria disease transmission are presented to illustrate our mathematical findings.     

The Kramer–Mesner method with tactical decompositions: some new unitals on 65 points

We propose a combination of two known computational methods for the construction of designs with prescribed groups of automorphisms: the Kramer–Mesner method and the method of tactical decompositions. This combined method is used to construct new unitals with parameters 2‐(65, 5, 1). © 2011 Wiley Periodicals, Inc. J Combin Designs 19:290‐303, 2011     

Quantum Interference, Quantum Theory of Measurement, and (In)completeness of Quantum Mechanics

The new techniques and ideas in quantum interferometry with neutrons, photons, atoms, electrons, and Bose condensates that fluorished in the last two decades have influenced in a decisive way the thinking and the research in the foundations and interpretation of quantum mechanics. The controversies existing among different schools on the reality of matter waves of quantum theory, the postulates of quantum measurement theory, and the (in)completeness of quantum mechanics have to be approached now in a new way. Our argumentation follows the spirit of the Paris school.     

Weakly compactly generated Banach spaces and the strong law of large numbers

IfB is a weakly compactly generated Banach space andf: (S,S, ) satisfies the strong law of large numbers, thenf=f ₁+f ₂, wheref ₁ is Bochner -integrable andf ₂ is Pettis -integrable with Pettis norm 0. The decomposition is unique.     

Sums and Limits of Generalized Direct Families of Algebras

In this paper we introduce a generalization of direct families of algebras and we study their limits and sums. In the case of generalized direct families of algebras carried by idempotent algebras we investigate some subdirect decompositions of their sums. The results that we obtain generalize various results given by J.L. Chrislock and T. Tamura [2], M. iri and S. Bogdanovi [3-7], H. Mitsch [13], M. Petrich [14-16], B.M. Schein [23-24] and others.Supported by Grant 04M03B of RFNS through Math. Inst. SANU     

Graphs with Least Eigenvalue −2: The Star Complement Technique

Let G be a connected graph with least eigenvalue –2, of multiplicity k. A star complement for –2 in G is an induced subgraph H = G – X such that |X| = k and –2 is not an eigenvalue of H. In the case that G is a generalized line graph, a characterization of such subgraphs is used to decribe the eigenspace of –2. In some instances, G itself can be characterized by a star complement. If G is not a generalized line graph, G is an exceptional graph, and in this case it is shown how a star complement can be used to construct G without recourse to root systems.