The definition of stabilizer and orbit for Hopf algebra action is given, and a duality theorem on stabilizer is proved.

We prove a weighted generalization of Kiinig’s duality theorem for infinite bipartite graphs and a weighted version of its dual.

By using Alexander duality on simplicial complexes we give a new and algebraic proof of Dirac’s theorem on chordal graphs.

In this note we extend duality theorems for crossed products obtained by M. Koppinen and C. Chen from the case of a base field or a Dedekind domain to the case of an arbitrary noetherian commutative ground ring under fairly weak conditions. In particular we extend an improved version of the celebrated Blattner-Montgomery duality theorem to the case of arbitrary noetherian ground rings.

The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstructions fall away when duality is reinterpreted on the basis of a ‘singular’ approach to graph homology, whose cycles are defined topologically in a space formed by the graph together with its ends and can be infinite. O...

We introduce a new Fenchel dual for vector optimization problems inspired by the form of the Fenchel dual attached to the scalarized primal multiobjective problem. For the vector primal-dual pair we prove weak and strong duality. Furthermore, we recall two other Fenchel-type dual problems introduced in the past in the literature, in the vector case, and make a comparison among all three duals. ...

We give some new regularity conditions for Fenchel duality in separated locally convex vector spaces, written in terms of the notion of quasi interior and quasi-relative interior, respectively. We provide also an example of a convex optimization problem for which the classical generalized interior-point conditions given so far in the literature cannot be applied, while the one given by us is ap...

Bounded linear regularity, the strong conical hull intersection property (strong CHIP), and the conical hull intersection property (CHIP) are properties of a collection of finitely many closed convex intersecting sets in Euclidean space. It was shown recently that these properties are fundamental in several branches of convex optimization, including convex feasibility problems, error bounds, Fe...

A full duality gives us a natural dual equivalence between a quasi-variety generated by a finite algebra and a class of structured topological spaces. There are many well-known examples of full dualities: Stone’s duality for Boolean algebras [12], Priestley’s duality for distributive lattices [11], and the Hofmann, Mislove, Stralka duality for semilattices [6]. A finite algebra M is called full...

We point out a connection between sensitivity analysis and the fundamental theorem of linear programming by characterizing when a linear programming problem has no duality gap. The main result is that the value function is subdifferentiable at the primal constraint if and only if there exists an optimal dual solution and there is no duality gap. To illustrate the subtlety of the condition, we e...