In this paper we consider various problems involving the action of a reductive group G on an affine variety V . We prove some general rationality results about the G-orbits in V . In addition, we extend fundamental results of Kempf and Hesselink regarding optimal destabilizing parabolic subgroups of G for such general G-actions. We apply our general rationality results to answer a question of S...

In this paper we consider various problems involving the action of a reductive group G on an affine variety V . We prove some general rationality results about the G-orbits in V . In addition, we extend fundamental results of Kempf and Hesselink regarding optimal destabilizing parabolic subgroups of G for such general G-actions. We apply our general rationality results to answer a question of S...

the realization optimality theory is a recent development in the original optimality theory which is proposed to deal with morphological issues especially the inflectional ones. its main idea is to consider the morphological realization rules as ranked violable language-specific constraints that control the realization processes and provide phonological information of grammatical morphemes. thi...

A class of G-semipreinvex functions, which are some generalizations of the semipreinvex functions, and theG-convex functions, is introduced. Examples are given to show their relations among G-semipreinvex functions, semipreinvex functions and G-convex functions. Some characterizations of G-semipreinvex functions are also obtained, and some optimality results are given for a class of G-semiprein...

and Applied Analysis 3 Proof. Let x, y ∈ K. From the assumption of f(y+η(x, y)) ≤ f(x), when λ = 0, 1, we can know that f (y + λη (x, y)) ≤ G −1 (λG (f (x)) + (1 − λ)G (f (y))) . (9) Then, there are two cases to be considered. (i) Iff(x) ̸ = f(y), then by the semistrictG-preinvexity of f, we have the following:

For the burnt pancake problem, we provide new values of g(−IN ), new hard positions and new experimental optimality ratios.

In this paper we consider the problem of computing an ‘‘optimal’’ popular matching. We assume that our input instance G = (A∪P , E1 ∪̇ · · · ∪̇ Er ) admits a popular matching and here we are asked to return not any popular matching but an optimal popular matching, where the definition of optimality is given as a part of the problem statement; for instance, optimality could be fairness inwhich cas...

In this paper we study set-valued optimization problems with equilibrium constraints (SOPEOs) described by parametric generalized equations in the form 0 E G(x) + Q(x), where both G and Q are set-valued mappings between infinite-dimensional spaces. Such models particularly arise from certain optimization-related problems governed by set-valued variational inequalities and first-order optimality...

this paper provides an optimality-theoretic account of dissimilation in standard persian as well as some other accents and dialects of persian. as such, this work starts by introducing optimality theory (henceforth ot) and its basic concepts and then it investigates dissimilation in this framework. it argues for the superiority of ot over derivational approaches regarding a case in which both d...

The objective of the research is to study and compare response surface designs: Central composite designs (CCD), BoxBehnken designs (BBD), Small composite designs (SCD), Hybrid designs, and Uniform shell designs (USD) over sets of reduced models when the design is in a spherical region for 3 and 4 design variables. The two optimality criteria ( D and G ) are considered which larger values imply...