arXiv AI By Costin B\u{a}dic\u{a}, Amelia B\u{a}dic\u{a}

On the Triangle Inequality for the Jaccard Distance in Arbitrary Lattices

Read the original on arXiv AI →

This paper extends the Jaccard distance to arbitrary lattices and real valuations, proving that the triangle inequality holds when the valuation is strictly positive, monotone, and modular. It further shows that in relatively complemented distributive lattices the inequality remains valid under positive, monotone, supermodular, and log‑submodular valuations, and adapts the symmetric‑difference Jaccard formulation for submodular valuations in sectionally complemented distributive lattices. The authors also establish that supermodularity is a necessary condition for the generalized Jaccard distance to be a metric and discuss the implications of these relaxed structural constraints for fields such as quantum information theory, formal concept analysis, and machine learning.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Jul 28

Formalizing Flag Algebras in Lean

arXiv:2607. 23500v1 Announce Type: cross Abstract: Razborov's flag algebra method is a powerful tool for proving asymptotic inequalities in extremal graph theory, often reducing the task to finding a finite certificate by semidefinite programming.

By Gyeongwon Jeong, Seonghun Park, Jihoon Hyun, Sang-il Oum, Hongseok Yang
arXiv AI
Jul 8

Lean-Quantum: Toward AI-Assisted Formalization of Quantum Information

arXiv:2607. 05492v1 Announce Type: cross Abstract: Quantum information theory is built on entropic quantities; among them, the sandwiched R\'enyi relative entropy is a fundamental divergence with various applications, and its data processing inequality (DPI) under quantum channels is a cornerstone result.

By Kazumi Kasaura, Kei Tsukamoto, Kento Mori, Risa Mizuno, Takahiro Namatame, Yuta Oriike, Masaya Taniguchi, Sho Sonoda, Hayata Yamasaki
arXiv Machine Learning
Oct 22

Supermodular Rank: Set Function Decomposition and Optimization

The paper introduces the concept of supermodular rank, defined as the minimal number of supermodular components required to express a function on a lattice. It characterizes the maximum possible rank and the structure of functions with a fixed rank, and analogously defines submodular rank. Leveraging submodular decompositions, the authors propose an algorithm that partitions a set‑function optimization problem into submodular subproblems, thereby improving approximation guarantees for monotone maximization and ratio minimization while incurring a computational cost tied to the submodular rank.

By Rishi Sonthalia, Anna Seigal, Guido Montufar