Koszulity and Koszul modules of dual extension algebras

Let A and B be algebras, and let T be the dual extension algebra of A and B. We provide a different method to prove that T is Koszul if and only if both A and B are Koszul. Furthermore, we prove that an algebra is Koszul if and only if one of its iterated dual extension algebras is Koszul, if and only if all its iterated dual extension algebras are Koszul. Finally, we give a necessary and sufficient condition for a dual extension algebra to have the property that all linearly presented modules are Koszul modules, which provides an effective way to construct algebras with such a property.     

Solvability of finite groups

H is called an ? _p -embedded subgroup of G, if there exists a p-nilpotent subgroup B of G such that H _p ∈ Syl _p (B) and B is ? _p -supplemented in G. In this paper, by considering prime divisor 3, 5, or 7, we use ? _p -embedded property of primary subgroups to investigate the solvability of finite groups. The main result is follows. Let E be a normal subgroup of G, and let P be a Sylow 5-subgroup of E. Suppose that 1 < d ? |P| and d divides |P|. If every subgroup H of P with |H| = d is ?₅-embedded in G, then every composition factor of E satisfies one of the following conditions: (1) I/C is cyclic of order 5, (2) I/C is 5′-group, (3) I/C ? A₅.     

On the growth and approximation of entire functions represented by Laplace–Stieltjes’ transformation

In the present paper, we obtain the characterization of various growth parameters of an entire function F(s) represented by Laplace–Stieltjes transformation in terms of the rate of decrease of \(E_n ( {F,\beta } ),\)where \(E_n ( {F,\beta } )\) represents the error in approximating the function F(s) by exponential polynomials.     

On optimal partitions,individual values and cooperative games: Does a wiser agent always produce a higher value?

We consider an optimal partition of resources (e.g. consumers) between several agents, given utility functions (“wisdoms”) for the agents and their capacities. This problem is a variant of optimal transport (Monge–Kantorovich) between two measure spaces where one of the measures is discrete (capacities) and the costs of transport are the wisdoms of the agents. We concentrate on the individual value for each agent under optimal partition and show that, counter-intuitively, this value may decrease if the agent’s wisdom is increased. Sufficient and necessary conditions for the monotonicity with respect to the wisdom functions of the individual values will be given, independently of the other agents. The sharpness of these conditions is also discussed. Motivated by the above we define a cooperative game based on optimal partition and investigate conditions for stability of the grand coalition.     

Strange products of projections

Let H be an infinite-dimensional Hilbert space. We show that there exist three orthogonal projections X ₁,X ₂,X ₃ onto closed subspaces of H such that for every 0 ≠ z ₀ ∈ H there exist k ₁, k ₂, · · · ∈ {1, 2, 3} so that the sequence of iterates defined by z _n = X _kn z _n ?1 does not converge in norm.     

Rational integrability of trigonometric polynomial potentials on the flat torus

We consider a lattice ? ? ? ⁿ and a trigonometric potential V with frequencies k ∈ ?. We then prove a strong rational integrability condition on V, using the support of its Fourier transform. We then use this condition to prove that a real trigonometric polynomial potential is rationally integrable if and only if it separates up to rotation of the coordinates. Removing the real condition, we also make a classification of rationally integrable potentials in dimensions 2 and 3 and recover several integrable cases. After a complex change of variables, these potentials become real and correspond to generalized Toda integrable potentials. Moreover, along the proof, some of them with high-degree first integrals are explicitly integrated.     

Computing topological indices of Sudoku graphs

In QSAR/QSPR study, physico-chemical properties and topological indices such as Randi?, atom-bond connectivity (ABC) and geometric-arithmetic (GA) index are used to predict the bioactivity of chemical compounds. A topological index is actually designed by transforming a chemical structure into a numeric number. These topological indices correlate certain physico-chemical properties like boiling point, stability, strain energy etc. of chemical compounds. Graph theory has found a considerable use in this area of research. The topological indices of certain interconnection networks were studied recently by Imran et al. (Appl Math Comput 244:936–951, 2014). In this paper, we extend this study to \(n\times n\) Sudoku graphs and derive analytical closed results of general Randi? index \(R_{\alpha }(G)\) for different values of “\(\alpha \)” for Sudoku (SK). We also compute the general Randi?, first Zagreb, ABC, GA, \(ABC_{4}\) and \(GA_{5}\) indices and give closed formulae of these indices for Sudoku graphs.     

Inverse Anisotropic Curvature Flow from Convex Hypersurfaces

In this paper, we study the inverse anisotropic curvature flow from strictly convex hypersurfaces. We show the long-time existence and the convergence to the Wulff shape after rescaling, under certain conditions on the general speed functions.     

An improved NSGA-III algorithm based on elimination operator for many-objective optimization

Due to the low selection pressure of the Pareto-dominance relation and the ineffectivity of diversity maintenance schemes in the environmental selection, the classical Pareto-dominance based multi-objective evolutionary algorithms (MOEAs) fail to handle many-objective optimization problems. The recently presented non-dominated sorting genetic algorithm III (NSGA-III) employs the uniformly distributed reference points to significantly promote population diversity, but the convergence based on the Pareto-dominance relation could still be enhanced. For this purpose, an improved NSGA-III algorithm based on elimination operator (NSGA-III-EO) is proposed. In the proposed algorithm, the elimination operator first identifies the reference point with maximum niche count and then employs the penalty-based boundary intersection distance to rank the individuals associated with it. To this end, the selection scheme is used to remove the worse individuals rather than to select the superior individuals. The proposed NSGA-III-EO is tested on a number of well-known benchmark problems with up to fifteen objectives and shows the competitive performance compared with five state-of-the-art MOEAs. Additionally, it is also tested on constrained problems having a large number of objectives and shows good performance.     

Extended formulations in mixed integer conic quadratic programming

In this paper we consider the use of extended formulations in LP-based algorithms for mixed integer conic quadratic programming (MICQP). Extended formulations have been used by Vielma et al. (INFORMS J Comput 20: 438–450, 2008) and Hijazi et al. (Comput Optim Appl 52: 537–558, 2012) to construct algorithms for MICQP that can provide a significant computational advantage. The first approach is based on an extended or lifted polyhedral relaxation of the Lorentz cone by Ben-Tal and Nemirovski (Math Oper Res 26(2): 193–205 2001) that is extremely economical, but whose approximation quality cannot be iteratively improved. The second is based on a lifted polyhedral relaxation of the euclidean ball that can be constructed using techniques introduced by Tawarmalani and Sahinidis (Math Programm 103(2): 225–249, 2005). This relaxation is less economical, but its approximation quality can be iteratively improved. Unfortunately, while the approach of Vielma, Ahmed and Nemhauser is applicable for general MICQP problems, the approach of Hijazi, Bonami and Ouorou can only be used for MICQP problems with convex quadratic constraints. In this paper we show how a homogenization procedure can be combined with the technique by Tawarmalani and Sahinidis to adapt the extended formulation used by Hijazi, Bonami and Ouorou to a class of conic mixed integer programming problems that include general MICQP problems. We then compare the effectiveness of this new extended formulation against traditional and extended formulation-based algorithms for MICQP. We find that this new formulation can be used to improve various LP-based algorithms. In particular, the formulation provides an easy-to-implement procedure that, in our benchmarks, significantly improved the performance of commercial MICQP solvers.