arXiv subjects

Ahmet Alkan

Publications and source records attributed to Ahmet Alkan.

2 recordsLinked to original sources

arXiv2026

Decomposition-Closed Sublattices as Minimizer Sets of Modular Functions over Distributive Lattices

We characterize the subsets of a finite distributive lattice that arise as the minimizer sets of modular functions. It is immediate that the minimizer set of any modular function is a decomposition-closed sublattice. Our main theorem establishes the converse: every decomposition-closed sublattice is the minimizer set of a modular function. Our proof is constructive. Using Birkhoff's representation, we decompose the problem along the intervals determined by an arbitrary maximal chain of the given sublattice. The key ingredient is a weight assignment on connected difference posets that yields local modular functions vanishing precisely at the endpoints of each interval. We also provide an example showing that this characterization fails for nondistributive lattices.

math.RA↗

arXiv2021

Stable Marriage Problems with Ties and Incomplete Preferences: An Empirical Comparison of ASP, SAT, ILP, CP, and Local Search Methods

We study a variation of the Stable Marriage problem, where every man and every woman express their preferences as preference lists which may be incomplete and contain ties. This problem is called the Stable Marriage problem with Ties and Incomplete preferences (SMTI). We consider three optimization variants of SMTI, Max Cardinality, Sex-Equal and Egalitarian, and empirically compare the following methods to solve them: Answer Set Programming, Constraint Programming, Integer Linear Programming. For Max Cardinality, we compare these methods with Local Search methods as well. We also empirically compare Answer Set Programming with Propositional Satisfiability, for SMTI instances. This paper is under consideration for acceptance in Theory and Practice of Logic Programming (TPLP).

cs.AI↗