skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Counting Perron numbers by absolute value: COUNTING PERRON NUMBERS BY ABSOLUTE VALUE
Award ID(s):
1648702
PAR ID:
10030922
Author(s) / Creator(s):
 ;  
Publisher / Repository:
DOI PREFIX: 10.1112
Date Published:
Journal Name:
Journal of the London Mathematical Society
Volume:
96
Issue:
1
ISSN:
0024-6107
Page Range / eLocation ID:
181 to 200
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. In this paper we investigate the problem of quantifying the contribution of each variable to the satisfying assignments of a Boolean function based on the Shapley value. Our main result is a polynomial-time equivalence between computing Shapley values and model counting for any class of Boolean functions that are closed under substitutions of variables with disjunctions of fresh variables. This result settles an open problem raised in prior work, which sought to connect the Shapley value computation to probabilistic query evaluation. We show two applications of our result. First, the Shapley values can be computed in polynomial time over deterministic and decomposable circuits, since they are closed under OR-substitutions. Second, there is a polynomial-time equivalence between computing the Shapley value for the tuples contributing to the answer of a Boolean conjunctive query and counting the models in the lineage of the query. This equivalence allows us to immediately recover the dichotomy for Shapley value computation in case of self-join-free Boolean conjunctive queries; in particular, the hardness for non-hierarchical queries can now be shown using a simple reduction from the \#P-hard problem of model counting for lineage in positive bipartite disjunctive normal form. 
    more » « less
  2. The Frobenius-Perron theory of an endofunctor of a k \Bbbk -linear category (recently introduced in Chen et al. [Algebra Number Theory 13 (2019), pp. 2005–2055]) provides new invariants for abelian and triangulated categories. Here we study Frobenius-Perron type invariants for derived categories of commutative and noncommutative projective schemes. In particular, we calculate the Frobenius-Perron dimension for domestic and tubular weighted projective lines, define Frobenius-Perron generalizations of Calabi-Yau and Kodaira dimensions, and provide examples. We apply this theory to the derived categories associated to certain Artin-Schelter regular and finite-dimensional algebras. 
    more » « less