Fractional Subadditivity of Submodular Functions: Equality Conditions and Their Applications
Gunank Singh Jakhar,Gowtham Raghunath Kurri,Suryajith Chillara,Vinod M. Prabhakaran
International Symposium on Information Theory, ISIT, 2025
Abs | | bib Tex
@inproceedings{bib_Frac_2025, AUTHOR = {Gunank Singh Jakhar, Gowtham Raghunath Kurri, Suryajith Chillara, Vinod M. Prabhakaran}, TITLE = {Fractional Subadditivity of Submodular Functions: Equality Conditions and Their Applications}, BOOKTITLE = {International Symposium on Information Theory}. YEAR = {2025}}
Submodular functions are known to satisfy various forms of fractional subadditivity. This work investigates the conditions for equality to hold exactly or approximately in the fractional subadditivity of submodular functions. We establish that a small gap in the inequality implies that the function is close to being modular, and that the gap is zero if and only if the function is modular. We then present natural implications of these results for special cases of submodular functions, such as entropy, relative entropy, and matroid rank. As a consequence, we characterize the necessary and sufficient conditions for equality to hold in Shearer's lemma, recovering a result of Ellis et al. (2016) as a special case. We leverage our results to propose a new multivariate mutual information, which generalizes Watanabe's total correlation (1960), Han's dual total correlation (1975), and Csiszar and Narayan's shared information (2004), and analyze its properties. Among these properties, we extend Watanabe's characterization of total correlation as the maximum correlation over partitions to fractional partitions. When applied to matrix determinantal inequalities for positive definite matrices, our results recover the equality conditions of the classical determinantal inequalities of Hadamard, Szasz, and Fischer as special cases.
Branching Programs with Extended Memory: New Insights
Suryajith Chillara,Nithish Raja G
International Conference on Algorithms and Complexity, CIAC, 2025
@inproceedings{bib_Bran_2025, AUTHOR = {Suryajith Chillara, Nithish Raja G}, TITLE = {Branching Programs with Extended Memory: New Insights}, BOOKTITLE = {International Conference on Algorithms and Complexity}. YEAR = {2025}}
One of the central themes of Algebraic Complexity Theory is to understand the relative computation power of algebraic complexity classes VP and VNP. VP is a class of polynomial families which can be computed efficiently by algebraic circuits. VNP is a class of polynomials which can be efficiently expressed through polynomial families in VP, but we do not know if they can be computed efficiently. It is a long standing open problem in this area to show that VP is a strict subset of VNP. At this juncture, it is fair to believe that newer characterization of these complexity classes could help us understand these models better (and possibly help us in resolving this question in restricted settings like non-commutativity at the very least).
It is well known that Algebraic Branching Programs (ABPs) characterize the class VBP (or equivalently VPskew ). Recently, Mengel [MFCS, 2013] showed that ABPs can be extended with memory and the computational models thus obtained can be used to characterize VP and VNP. In particular, Mengel showed that ABPs with a single stack characterize VP, and branching programs with random-access memory characterize VNP. In this work we show that algebraic branching programs with just 2 stacks efficiently simulates the polynomial families in VNP, and two stack branching programs are VNP-complete. Further, we observe that k-stack branching programs (for all polynomially bounded k) are no more powerful than 2-stack branching programs (upto a polynomial blowup in size).
This strengthens the work of Mengel in the following way – VBP vs. VP vs. VNP are characterized by algebraic branching programs with 0, 1, and 2 stacks, respectively, or no-memory, a stack as memory, and a queue as memory respectively, which hold even in the non-commutative setting. We also refine Mengel’s characterization of VP through stack-height characterization.
On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts
Amir Shpilka,Coral Grichener,Suryajith Chillara
Symposium on Theoretical Aspects of Computer Science, STACS, 2023
@inproceedings{bib_On_H_2023, AUTHOR = {Amir Shpilka, Coral Grichener, Suryajith Chillara}, TITLE = {On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts}, BOOKTITLE = {Symposium on Theoretical Aspects of Computer Science}. YEAR = {2023}}
We say that two given polynomials f, g ∈ R[x_1, ..., x_n], over a ring R, are equivalent under shifts if there exists a vector (a_1, ..., a_n) ∈ Rⁿ such that f(x_1+a_1, ..., x_n+a_n) = g(x_1, ..., x_n). This is a special variant of the polynomial projection problem in Algebraic Complexity Theory. Grigoriev and Karpinski (FOCS 1990), Lakshman and Saunders (SIAM J. Computing, 1995), and Grigoriev and Lakshman (ISSAC 1995) studied the problem of testing polynomial equivalence of a given polynomial to any t-sparse polynomial, over the rational numbers, and gave exponential time algorithms. In this paper, we provide hardness results for this problem. Formally, for a ring R, let SparseShift_R be the following decision problem - Given a polynomial P(X), is there a vector 𝐚 such that P(X+𝐚) contains fewer monomials than P(X). We show that SparseShift_R is at least as hard as checking if a given system of polynomial equations over R[x_1,..., x_n] has a solution (Hilbert’s Nullstellensatz). As a consequence of this reduction, we get the following results. 1) SparseShift_ℤ is undecidable. 2) For any ring R (which is not a field) such that HN_R is NP_R-complete over the Blum-Shub-Smale model of computation, SparseShift_ is also NP_R-complete. In particular, SparseShift_ℤ is also NP_ℤ-complete. We also study the gap version of the SparseShift_R and show the following. 1) For every function β:ℕ → ℝ_+ such that β ∈ o(1), N^β-gap-SparseShift_ℤ is also undecidable (where N is the input length). 2) For R = 𝔽_p, ℚ, ℝ or ℤ_q and for every β > 1 the β-gap-SparseShift_R problem is NP-hard. Furthermore, there exists a constant α > 1 such that for every d = O(1) in the sparse representation model, and for every d ≤ n^O(1) in the arithmetic circuit model, the α^d-gap-SparseShift_R problem is NP-hard when given polynomials of degree at most d, in O(nd) many variables, as input.
Functional Lower Bounds for Restricted Arithmetic Circuits of Depth Four
Suryajith Chillara
Foundations of Software Technology and Theoretical Computer Science, FSTTCS, 2021
@inproceedings{bib_Func_2021, AUTHOR = {Suryajith Chillara}, TITLE = {Functional Lower Bounds for Restricted Arithmetic Circuits of Depth Four}, BOOKTITLE = {Foundations of Software Technology and Theoretical Computer Science}. YEAR = {2021}}
Recently, Forbes, Kumar and Saptharishi [CCC, 2016] proved that there exists an explicit d O(1) - variate and degree d polynomial Pd ∈ VNP such that if any depth four circuit C of bounded formal degree d which computes a polynomial of bounded individual degree O(1), that is functionally equivalent to Pd, then C must have size 2 Ω(√ d log d) . The motivation for their work comes from Boolean Circuit Complexity. Based on a characterization for ACC0 circuits by Yao [FOCS, 1985] and Beigel and Tarui [CC, 1994], Forbes, Kumar and Saptharishi [CCC, 2016] observed that functions in ACC0 can also be computed by algebraic Σ∧ΣΠ circuits (i.e., circuits of the form – sums of powers of polynomials) of 2 logO(1) n size. Thus they argued that a 2 ω(poly log n) “functional” lower bound for an explicit polynomial Q against Σ∧ΣΠ circuits would imply a lower bound for the “corresponding Boolean function” of Q against non-uniform ACC0 . In their work, they ask if their lower bound be extended to Σ∧ΣΠ circuits. In this paper, for large integers n and d such that ω(log2 n) ≤ d ≤ n 0.01, we show that any Σ∧ΣΠ circuit of bounded individual degree at most O d k2 that functionally computes Iterated Matrix Multiplication polynomial IMMn,d (∈ VP) over {0, 1} n 2d must have size n Ω(k) . Since Iterated Matrix Multiplication IMMn,d over {0, 1} n 2d is functionally in GapL, improvement of the afore mentioned lower bound to hold for quasipolynomially large values of individual degree would imply a fine-grained separation of ACC0 from GapL. For the sake of completeness, we also show a syntactic size lower bound against any Σ∧ΣΠ circuit computing IMMn,d (for the same regime of d) which is tight over large fields. Like Forbes, Kumar and Saptharishi [CCC, 2016], we too prove lower bounds against circuits of bounded formal degree which functionally compute IMMn,d, for a slightly larger range of individual degree. 2012 ACM Subject Classification Theory of computation → Circuit complexity; Theory of computation → Algebraic complexity theory Keywords and phrases Functional Lower