in this paper, using clarke’s generalized directional derivative and di-invexity we introduce new concepts of nonsmooth k-α-di-invex and generalized type i univex functions over cones for a nonsmooth vector optimization problem with cone constraints. we obtain some sufficient optimality conditions and mond-weir type duality results under the foresaid generalized invexity and type i cone-univexi...

An automorphism of a group G is called regular if it moves every element of G except the identity. BURNSIDE proved that a finite group G has a regular automorphism of order two if and only if G is an abelian group of odd order, and then the only such automorphism maps every element onto its inverse ([21, p. 230). More recently several authors considered the question: what groups can admit regul...

We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we construct efficient locally decodable codes with positive information rate and low (almost optimal) query complexity which can correctly decode any given bit of the message from constant channel error rate ρ. This compa...

Frick and Grohe [J. ACM 48 (2006), 1184–1206] introduced a notion of graph classes with locally bounded tree-width and established that every first order logic property can be decided in almost linear time in such a graph class. Here, we introduce an analogous notion for matroids (locally bounded branch-width) and show the existence of a fixed parameter algorithm for first order logic propertie...

Given an undirected graph G = (V,E) and a nonnegative integer k, the NPhard Cluster Editing problem asks whether G can be transformed into a disjoint union of cliques by modifying at most k edges. In this work, we study how “local degree bounds” influence the complexity of Cluster Editing and of the related Cluster Deletion problem which allows only edge deletions. We show that even for graphs ...

Many real-life problems can be modeled by graph-theoretic problems. These graph problems are usually NP-hard and hence there is no efficient algorithm for solving them, unless P= NP. One way to overcome this hardness is to solve the problems when restricted to special graphs. Trees are one kind of graph for which several NP-complete problems can be solved in polynomial time. Graphs of bounded t...

For Cluster Editing where both the number of clusters and the edit degree are bounded, we speed up the kernelization by almost a factor n compared to Komusiewicz and Uhlmann (2012), at cost of a marginally worse kernel size bound. We also give sufficient conditions for a subset of vertices to be a cluster in some optimal clustering.

Given a tree T with n vertices, we show, by using a dynamic programming approach, that the problem of finding a 3-coloring of T respecting local (i.e., associated with p prespecified subsets of vertices) color bounds can be solved in O(n6p−1 log n) time. We also show that our algorithm can be adapted to the case of k-colorings for fixed k.

We obtain a number of consequences of the theorem on the automatic continuity of locally bounded finite-dimensional representations of connected Lie groups on the derived subgroup of the group, as well as an analogue of Lie’s theorem for (not necessarily continuous) finite-dimensional representations of connected soluble locally compact groups. In particular, we give a description of connected ...

A family of sets F is locally k-wide if and only if the width (as a poset ordered by inclusion) of F x = fU 2 F j x 2 U g is at most k for every x. The directed covering graph of a locally 1-wide family of sets is a forest of rooted trees. It is shown that if F is a locally k-wide family of subsets of f1; : : : ; ng, then jFj (2k) k?1 n. The proof involves a counting argument based on families ...