Infinitesimal 2-braidings and differential crossed modules

We categorify the notion of an infinitesimal braiding in a linear strict symmetric monoidal category, leading to the notion of a (strict) infinitesimal 2-braiding in a linear symmetric strict monoidal 2-category. We describe the associated categorification of the 4-term relations, leading to six categorified relations. We prove that any infinitesimal 2-braiding gives rise to a flat and fake flat 2-connection in the configuration space of n particles in the complex plane, hence to a categorification of the Knizhnik–Zamolodchikov connection. We discuss infinitesimal 2-braidings in a certain monoidal 2-category naturally assigned to every differential crossed module, leading to the notion of a symmetric quasi-invariant tensor in a differential crossed module. Finally, we prove that symmetric quasi-invariant tensors exist in the differential crossed module associated to Wagemann's version of the String Lie-2-algebra. As a corollary, we obtain a more conceptual proof of the flatness of a previously constructed categorified Knizhnik–Zamolodchikov connection with values in the String Lie-2-algebra.     

Stability analysis of the flow past miniature vortex generators in a Blasius boundary layer

It is shown in the literature that Tollmien−Schlichting waves can be damped and transition delayed by a proper modulation of the streamwise velocity in a boundary layer (BL), which can be obtained using miniature vortex generators (MVGs). Experiments show that the amplitude of TS waves is not always monotonically damped past the MVGs. In this study, direct numerical simulations and local stability analysis have been performed in order to provide an interpretation of the experiments and to characterize further the stabilization mechanism induced by this type of control. (© 2015 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

The coarse moduli space of a flat analytic groupoid

Annali di Matematica Pura ed Applicata (1923 -) - Let $$\mathcal X $$ be a flat analytic groupoid $$R_X\stackrel{s}{\underset{t}{\rightrightarrows }}X$$ such that the holomorphic map...     

States on systems of sets that are closed under symmetric difference

We consider extensions of certain states. The states are defined on the systems of sets that are closed under the formation of the symmetric difference (concrete quantum logics). These systems can be viewed as certain set‐representable quantum logics enriched with the symmetric difference. We first show how the compactness argument allows us to extend states on Boolean algebras over such systems of sets. We then observe that the extensions are sometimes possible even for non‐Boolean situations. On the other hand, a difference‐closed system can be constructed such that even two‐valued states do not allow for extensions. Finally, we consider these questions in a σ‐complete setup and find a large class of such systems with rather interesting state properties.     

Adaptive and multi-mining versions of the DM-GRASP hybrid metaheuristic

Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. Some researches have been combining machine learning techniques with metaheuristics to adaptively guide and improve the search for near optimal solutions. An example of such development is the DM-GRASP, a hybrid version of the Greedy Randomized Adaptative Search Procedures (GRASP) metaheuristic which incorporates a data mining process. In this hybrid proposal, after executing half of the total number of iterations, the data mining process extracts patterns from an elite set of sub-optimal solutions for the optimization problem. These patterns present characteristics of near optimal solutions and can be used to guide the following half GRASP iterations in the search through the solution space. In this work, we explore new versions of the DM-GRASP metaheuristic to experiment, not a single activation, but multiple and adaptive executions of the data mining process during the metaheuristic execution. We also applied the data mining technique into a reactive GRASP to show that a more sophisticated and not memoryless GRASP approach can also benefit from the use of this technique. In order to evaluate these new proposals, we adopted the server replication for reliable multicast problem since the best known results for this problem were obtained by GRASP and DM-GRASP implementations. The computational experiments, comparing traditional GRASP, DM-GRASP, and the new proposals, showed that multiple and adaptive executions of the data mining process can improve the results obtained by the DM-GRASP hybrid metaheuristic—the new proposals were able to find better results in less computational time for the reliable multicast problem.     

On the chromatic polynomial of a graph

Let P(G,λ) be the chromatic polynomial of a graph G with n vertices, independence number α and clique number ω. We show that for every λ≥n, ()^α≤≤ () ^{n −ω}. We characterize the graphs that yield the lower bound or the upper bound.?These results give new bounds on the mean colour number μ(G) of G: n− (n−ω)() ^{n −ω}≤μ(G)≤n−α() ^α. Received: December 12, 2000 / Accepted: October 18, 2001?Published online February 14, 2002     

On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables

ABSTRACT

We define and discuss different enumerative methods to compute solutions of generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables. We propose both branch-and-bound methods based on merit functions for the mixed-integer game, and branch-and-prune methods that exploit the concept of dominance to make effective cuts. We show that under mild assumptions the equilibrium set of the game is finite and we define an enumerative method to compute the whole of it. We show that our branch-and-prune method can be suitably modified in order to make a general equilibrium selection over the solution set of the mixed-integer game. We define an application in economics that can be modelled as a Nash game with linear coupling constraints and mixed-integer variables, and we adapt the branch-and-prune method to efficiently solve it.     

On Bernoulli decompositions for random variables, concentration bounds, and spectral localization

As was noted already by A. N. Kolmogorov, any random variable has a Bernoulli component. This observation provides a tool for the extension of results which are known for Bernoulli random variables to arbitrary distributions. Two applications are provided here: (i) an anti-concentration bound for a class of functions of independent random variables, where probabilistic bounds are extracted from combinatorial results, and (ii) a proof, based on the Bernoulli case, of spectral localization for random Schrödinger operators with arbitrary probability distributions for the single site coupling constants. For a general random variable, the Bernoulli component may be defined so that its conditional variance is uniformly positive. The natural maximization problem is an optimal transport question which is also addressed here.     

A canonical duality approach for the solution of affine quasi-variational inequalities

We propose a new formulation of the Karush–Kunt–Tucker conditions of a particular class of quasi-variational inequalities. In order to reformulate the problem we use the Fisher–Burmeister complementarity function and canonical duality theory. We establish the conditions for a critical point of the new formulation to be a solution of the original quasi-variational inequality showing the potentiality of such approach in solving this class of problems. We test the obtained theoretical results with a simple heuristic that is demonstrated on several problems coming from the academy and various engineering applications.