Related papers: A Note on Ordinal Submodularity

We show that the spaces of transfinite words, namely ordinal-indexed words, over a Noetherian space, is also Noetherian, under a natural topology which we call the regular subword topology. We characterize its sobrification and its…

We develop a theory of Hilbert $\widetilde{\C}$-modules by investigating their structural and functional analytic properties. Particular attention is given to finitely generated submodules, projection operators, representation theorems for…

We analyze combinatorial optimization problems with ordinal, i.e., non-additive, objective functions that assign categories (like good, medium and bad) rather than cost coefficients to the elements of feasible solutions. We review different…

Based on the needs of convergence proofs of preconditioned proximal point methods, we introduce notions of partial strong submonotonicity and partial (metric) subregularity of set-valued maps. We study relationships between these two…

The notion of cosilting module was recently introduced as a generalization of the concept of cotilting module. In this paper, it is introduced the notion of finitely cosilting module, i.e. a cosilting module with some finitness conditions,…

In this note we study multiple-ratio fractional 0--1 programs, a broad class of NP-hard combinatorial optimization problems. In particular, under some relatively mild assumptions we provide a complete characterization of the conditions,…

It has been observed independently by many researchers that the isolating cut lemma of Li and Panigrahi [FOCS 2020] can be easily extended to obtain new algorithms for finding the non-trivial minimizer of a symmetric submodular function and…

We develop categorical and number theoretical tools for the classification of super-modular categories. We apply these tools to obtain a partial classification of super-modular categories of rank $8$. In particular we find three distinct…

Submodularity is an important concept in integer and combinatorial optimization. A classical submodular set function models the utility of selecting homogenous items from a single ground set, and such selections can be represented by binary…

Inspired by prior work of Bruinier and Ono and Mertens and Rolen, we study class polynomials for non-holomorphic modular functions arising from modular forms of negative weight. In particular, we give general conditions for the…

This note offers an unusual approach of studying a class of modules inasmuch as it is investigating a subclass of the category of modules over a valuation domain. This class is far from being a full subcategory, it is not even a category.…

In this paper, we study uniqueness problems for an entire function that shares small functions of finite order with their difference operators. In particular, we give a generalization of results in [2,3,13].

Maximizing monotone submodular functions under cardinality constraints is a classic optimization task with several applications in data mining and machine learning. In this paper we study this problem in a dynamic environment with…

We study centralizer clones of finite lattices and semilattices. For semilattices, we give two characterizations of the centralizer and also derive formulas for the number of operations of a given essential arity in the centralizer. We also…

We introduce a new higher categorical structure called a weakly globular n-fold category. This structure is based on iterated internal categories and on the notion of weak globularity. We identify a suitable class of pseudo-functors whose…

This work explores the novel idea of learning a submodular scoring function to improve the specificity/selectivity of existing feature attribution methods. Submodular scores are natural for attribution as they are known to accurately model…

Logical models have been successfully used to describe regulatory and signaling networks without requiring quantitative data. However, existing data is insufficient to adequately define a unique model, rendering the parametrization of a…

The concept of a $\lambda$-lattice was introduced by V. Sn\'a\v sel in order to generalize some lattice concepts for directed posets whose elements need not have suprema or infima. We extend the concept of semimodularity from lattices to…

When a function belonging to a fractional-order Sobolev space is supported in a proper subset of the Lipschitz domain on which the Sobolev space is defined, how is its Sobolev norm as a function on the smaller set compared to its norm on…

It is known that a subharmonic function of finite order $\rho$ can be approximated by the logarithm of the modulus of an entire function at the point $z$ outside an exceptional set up to $C\log|z|$. In this article we prove that if such an…