A rational function quantum equivalence relation on the set of all prime numbers

Autor: Lan Nguyen

Publikováno v: Mathematics Open, Vol 04, Iss (2025)

In this paper, we prove new results which make it possible to vastly simplify solution of the problem of Nathanson concerning the enlargement of support bases and thus of the corresponding semigroup supports of rational function solutions to the quan

Externí odkaz: https://doaj.org/article/8513c10397ad436482e0690c315f9f12

A Brunn-Minkowski Inequality for the Integer Lattice

Autor: Gardner, R. J., Gronchi, P.

Publikováno v: Transactions of the American Mathematical Society, 2001 Oct 01. 353(10), 3995-4024.

Externí odkaz: https://www.jstor.org/stable/2693781

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

On the subset sum problem for finite fields

Autor: Marco Pavone

Let G be the additive group of a finite field. J. Li and D. Wan determined the exact number of solutions of the subset sum problem over G, by giving an explicit formula for the number of subsets of G of prescribed size whose elements sum up to a give

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1a5ca4578536e1c23163a8d65a61c0a5
http://hdl.handle.net/10447/522418

The Online Min-Sum Set Cover Problem

Autor: Fotakis, Dimitris, Kavouras, Loukas, Koumoutsos, Grigorios, Skoulakis, Stratis, Vardas, Manolis

Publikováno v: Leibniz International Proceedings in Informatics (LIPIcs), 168
47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)

We consider the online Min-Sum Set Cover (MSSC), a natural and intriguing generalization of the classical list update problem. In Online MSSC, the algorithm maintains a permutation on n elements based on subsets S₁, S₂, … arriving online. The a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1afcebdbc07139633c84cf410e759e2e